Treap (Randomized Binary Search Tree)

include/structures/treap.h View source View on GitHub

Structs

treap_node

struct treap_node {
    uint32_t           priority;
    struct treap_node  *left;
    struct treap_node  *right;
    struct treap_node  *parent;
};

treap_node_ops

struct treap_node_ops {
    int  (*cmp)(const struct treap_node *a, const struct treap_node *b);
    int  (*cmp_key)(const struct treap_node *node, const void *key);
};

treap_tree

struct treap_tree {
    struct treap_node            *root;
    const struct treap_node_ops  *ops;
};

Functions

treap_init_node

void treap_init_node(struct treap_node *n, uint32_t priority);

treap_tree_empty

bool treap_tree_empty(const struct treap_tree *tree);

treap_tree_init

void treap_tree_init(struct treap_tree *tree, const struct treap_node_ops *ops);

treap_insert

void treap_insert(struct treap_tree *tree, struct treap_node *node);

treap_remove

void treap_remove(struct treap_tree *tree, struct treap_node *node);

treap_find

struct treap_node * treap_find(const struct treap_tree *tree, const void *key);

treap_first

struct treap_node * treap_first(const struct treap_tree *tree);

treap_last

struct treap_node * treap_last(const struct treap_tree *tree);

treap_next

struct treap_node * treap_next(const struct treap_node *node);

treap_prev

struct treap_node * treap_prev(const struct treap_node *node);

Macros

TREAP_NODE_INIT

#define TREAP_NODE_INIT(prio) \
    (struct treap_node) { \
        .priority = (prio), .left = NULL, .right = NULL, .parent = NULL \
    }

treap_entry

#define treap_entry(ptr, type, member) container_of(ptr, type, member)

treap_for_each

#define treap_for_each(pos, tree) \
    for ((pos) = treap_first(tree); (pos); (pos) = treap_next(pos))

treap_for_each_safe

#define treap_for_each_safe(pos, n, tree) \
    for ((pos) = treap_first(tree), (n) = (pos) ? treap_next(pos) : NULL; \
         (pos); (pos) = (n), (n) = (pos) ? treap_next(pos) : NULL)

treap_for_each_entry

#define treap_for_each_entry(pos, type, member, tree) \
    for (pos = treap_entry(treap_first(tree), type, member); \
         (pos) != NULL && &pos->member != NULL; \
         pos = treap_entry(treap_next(&pos->member), type, member))

treap_for_each_entry_safe

#define treap_for_each_entry_safe(pos, tmp, type, member, tree) \
    for (pos = treap_entry(treap_first(tree), type, member), \
        tmp = (pos) ? treap_entry(treap_next(&pos->member), type, member) \
                    : NULL; \
         (pos) != NULL && &pos->member != NULL; pos = tmp, \
        tmp = (pos) ? treap_entry(treap_next(&pos->member), type, member) \
                    : NULL)

treap_for_each_reverse

#define treap_for_each_reverse(pos, tree) \
    for ((pos) = treap_last(tree); (pos); (pos) = treap_prev(pos))

treap_for_each_safe_reverse

#define treap_for_each_safe_reverse(pos, n, tree) \
    for ((pos) = treap_last(tree), (n) = (pos) ? treap_prev(pos) : NULL; \
         (pos); (pos) = (n), (n) = (pos) ? treap_prev(pos) : NULL)

treap_for_each_entry_reverse

#define treap_for_each_entry_reverse(pos, type, member, tree) \
    for (pos = treap_entry(treap_last(tree), type, member); \
         (pos) != NULL && &pos->member != NULL; \
         pos = treap_entry(treap_prev(&pos->member), type, member))

treap_for_each_entry_safe_reverse

#define treap_for_each_entry_safe_reverse(pos, tmp, type, member, tree) \
    for (pos = treap_entry(treap_last(tree), type, member), \
        tmp = (pos) ? treap_entry(treap_prev(&pos->member), type, member) \
                    : NULL; \
         (pos) != NULL && &pos->member != NULL; pos = tmp, \
        tmp = (pos) ? treap_entry(treap_prev(&pos->member), type, member) \
                    : NULL)

---