# releational

1
2
3
4
5

enum Relational {
    EQ,
    GT,
    LT,
};

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13

#include "context.h"

enum Relational compare(struct Node* node1, struct Node* node2) {
    int key1 = node1->key;
    int key2 = node2->key;
    if (key1 == key2) {
        return EQ;
    } else if (key1 < key2) {
        return GT;
    } else {
        return LT;
    }
}

1
2

RedBlackTree.cbc
7:extern enum Relational compare(struct Node* node1, struct Node* node2);

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15

__code putRedBlackTree(struct RedBlackTree* tree, struct Node* node) {
    struct Node* newNode = &ALLOCATE(context, Node)->Node;
    struct Node* root = tree->root;
    printTree((union Data*)(tree->root));
    tree->newNode = newNode;
    tree->root = newNode; // this should done at stackClear
    tree->parent = NULL;
    if (root) {
        tree->current = root;
        tree->result = compare(tree->current, node);
        tree->findNodeNext = C_insertNode;
        goto findNode(tree);
    }
    goto insertNode(tree, node);
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12

typedef struct Tree<Self, Impl, Type>{
    /* future Code */
    /* Type* tree; */
    /* Type* node; */
    union Data* tree;
    struct Node* node;
    __code put(Impl* tree,Type* node, __code next(...));
    __code get(Impl* tree, __code next(...));
    __code remove(Impl* tree,Type* node, __code next(...));
    // __code clearRedBlackTree();
    __code next(...);
} Tree;

1

$sd '<Type' '<Self' $(rg '<Type' -g '*.h' --files-with-matches)