Binary Search Tree Interface SilcTree SilcTreeHeader SilcTreeType silc_tree_init silc_tree_add silc_tree_del silc_tree_find silc_tree_find_ext silc_tree_count silc_tree_minmax silc_tree_enumerate silc_tree_enumerate_duplicates

silc_tree_enumerate_duplicates

SYNOPSIS

    void *silc_tree_enumerate_duplicates(SilcTree *tree, void *at);

DESCRIPTION

Enumerates all duplicate values starting at the `at'. If `at' is the only one of that value in the tree this will return NULL. Returns same values as `at' until there are no more and will then return NULL. The `at' must not be NULL.

EXAMPLE

 // Find all entries of ID 100
 probe.id = 100;
 entry = silc_tree_find(tree, &probe);
 printf("Entry %p ID %d\n", entry, entry->id);
 while ((entry = silc_tree_enumerate_duplicates(tree, entry)))
   printf("Entry %p ID %d\n", entry, entry->id);