broadroad / map

Map for C, used rbtree to implement, sort by key

Map for c

Current Map Version 1.0 For C++, there is STL to use, and so we have map to use. But for c, We have to implement ourselves. So I implement a C map, I used rb_tree to implement this. The map sort by the key, and get the value in O(logn).

Usage

I grab rb_tree from linux kernel. Just import map.h, rbtree.h, rbtree.c in you project.

Example

//put the key and value into map
root_t tree = RB_ROOT; 
char *key = "hello";
char *word = "world";
put(&tree, key, word);

//get the value from key
map_t *data = get(&tree, "zhang");
if (data != NULL)
	printf("%s\n", data->val);

//Traversal
map_t *node;
for (node = map_first(&tree); node; node=map_next(&(node->node))) {
	printf("%s\n", node->val);
}

//Free map node
if (data) {
    rb_erase(&data->node, &tree);
	map_free(data);
}

Bug Reporting and Feature Requests

If you find a bug or have an enhancement request, simply file an Issue and send a message (via github messages) to the Committers to the project to let them know that you have filed an Issue.

Contact

[email protected]

map's Issues

bug

map_t *data = (map_t*)malloc(sizeof(map_t));
data->key = (char*)malloc(sizeof(key));
strcpy(data->key, key);
data->val = (char*)malloc(sizeof(val));
strcpy(data->val, val);

sizeof???

when call map_free to free node, need to erase node from tree

test code:
#include "rbtree.h"
#include "map.h"
#include <stdio.h>
#include <unistd.h>

root_t tree = RB_ROOT;
typedef struct map_t{
char *val;
}MAP_T;
int main() {
for(int i = 0; i< 100; i++)
{
char key[8],val[8];
sprintf(key,"key%d",i);
sprintf(val,"val%d",i);
MAP_T *word1 = malloc(sizeof(MAP_T));
word1->val = strdup(val);
put(&tree, key, word1);
}
map_t *data1 = get(&tree, "key88");
if (data1 != NULL)
{
printf("%s\n", ((MAP_T *)data1->val)->val);
map_free(data1);
}
data1 = get(&tree, "key88"); //Segment fault
if (data1 == NULL)
{
printf("Can't find the node!\n");
}
map_t *node;
for (node = map_first(&tree); node; node=map_next(&(node->node))) {
printf("%s\n", node->key);
}
return 0;
}

Memory leak in put function

Memory leak in 'put' function when key is already in map