gavl_find_after(const gavl_root_t *root, const void *key)
{
gavl_node_t *n;
- n=gavl_find_after(root, key);
+ n=gavl_find_after_node(root, key);
return n?gavl_node2item(root,n):NULL;
}
gavl_print_tree1(&test_gavl1, test_gavl1.root_node, 0, NULL, 0);
}
break;
+ case 'S':
+ if (scanf("%d",&val)==1){
+ item=gavl_find_first(&test_gavl1, &val);
+ if(item)
+ printf("gavl_find_first find item with value %d\n", item->val);
+ else
+ printf("gavl_find_first found no item\n");
+ item=gavl_find_after(&test_gavl1, &val);
+ if(item)
+ printf("gavl_find_after find item with value %d\n", item->val);
+ else
+ printf("gavl_find_after found no item\n");
+ }
+ break;
case 'f':
gavl_foreach_test1(&test_gavl1);
break;