[asterisk-commits] akshayb: branch akshayb/ao2_containers r266519 - /team/akshayb/ao2_containers...

[SVN commits to the Asterisk project]

Author: akshayb
Date: Sun May 30 10:55:42 2010
New Revision: 266519

URL: http://svnview.digium.com/svn/asterisk?view=rev&rev=266519
Log:
Adding the variable file for ao2_container in btree data structure

Modified:
    team/akshayb/ao2_containers/include/asterisk/btree.h   (contents, props changed)

Modified: team/akshayb/ao2_containers/include/asterisk/btree.h
URL: http://svnview.digium.com/svn/asterisk/team/akshayb/ao2_containers/include/asterisk/btree.h?view=diff&rev=266519&r1=266518&r2=266519
==============================================================================
--- team/akshayb/ao2_containers/include/asterisk/btree.h (original)
+++ team/akshayb/ao2_containers/include/asterisk/btree.h Sun May 30 10:55:42 2010
@@ -1,1 +1,52 @@
-/*Header for btree code */
+#ifndef _BTREE_H_
+#define _BTREE_H_
+
+// Platform dependent headers
+#include <stdlib.h>
+#include <stdio.h>
+#include <strings.h>
+
+#define mem_alloc malloc
+#define mem_free free
+#define bcopy bcopy
+#define print printf
+
+typedef enum  {false,true} bool;
+
+typedef struct {
+        void * key;
+        void * val;
+} bt_key_val;
+
+typedef struct bt_node {
+	struct bt_node * next;		// Pointer used for linked list 
+	bool leaf;			// Used to indicate whether leaf or not
+        unsigned int nr_active;		// Number of active keys
+	unsigned int level;		// Level in the B-Tree
+        bt_key_val ** key_vals; 	// Array of keys and values
+        struct bt_node ** children;	// Array of pointers to child nodes
+}bt_node;
+
+typedef struct {
+	unsigned int order;			// B-Tree order
+	bt_node * root;				// Root of the B-Tree
+	unsigned int (*value)(void * key);	// Generate uint value for the key
+        unsigned int (*key_size)(void * key);    // Return the key size
+        unsigned int (*data_size)(void * data);  // Return the data size
+	void (*print_key)(void * key);		// Print the key
+}btree; 
+
+extern btree * btree_create(unsigned int order);
+extern int btree_insert_key(btree * btree, bt_key_val * key_val);
+extern int btree_delete_key(btree * btree,bt_node * subtree ,void * key);
+extern bt_key_val * btree_search(btree * btree,  void * key);
+extern void btree_destroy(btree * btree);
+extern void * btree_get_max_key(btree * btree);
+extern void * btree_get_min_key(btree * btree);
+
+#ifdef DEBUG
+extern void print_subtree(btree * btree,bt_node * node);
+#endif
+
+
+#endif

Propchange: team/akshayb/ao2_containers/include/asterisk/btree.h
------------------------------------------------------------------------------
--- svn:keywords (original)
+++ svn:keywords Sun May 30 10:55:42 2010
@@ -1,1 +1,1 @@
-Akshay Bhardwaj 29 May 2010
+Akshay Bhardwaj 30 May 2010, Contains code for btree implementation