static node_t *
removeReverseIterateCb(tree_t *aTree, node_t *aNode, void *data) {
unsigned *nNodes = (unsigned *)data;
node_t *ret = tree_prev(aTree, aNode);
nodeRemove(aTree, aNode, *nNodes);
return ret;
}
int
main(void) {
tree_t tree;
long set[NNODES];
node_t nodes[NNODES], key, *sNode, *nodeA;
unsigned i, j, k;
fprintf(stderr, "Test begin\n");
/* Initialize tree. */
tree_new(&tree, 42);
/*
* Empty tree.
*/
fprintf(stderr, "Empty tree:\n");
/* trp_first(). */
nodeA = tree_first(&tree);
if (nodeA == NULL) {
fprintf(stderr, "trp_first() --> nil\n");
} else {
fprintf(stderr, "trp_first() --> %ld\n", nodeA->key);
}
/* trp_last(). */
nodeA = tree_last(&tree);
if (nodeA == NULL) {
fprintf(stderr, "trp_last() --> nil\n");
} else {
fprintf(stderr, "trp_last() --> %ld\n", nodeA->key);
}
/* trp_search(). */
key.key = 0;
key.magic = NODE_MAGIC;
nodeA = tree_search(&tree, &key);
if (nodeA == NULL) {
fprintf(stderr, "trp_search(0) --> nil\n");
} else {
fprintf(stderr, "trp_search(0) --> %ld\n", nodeA->key);
}
/* trp_nsearch(). */
key.key = 0;
key.magic = NODE_MAGIC;
nodeA = tree_nsearch(&tree, &key);
if (nodeA == NULL) {
fprintf(stderr, "trp_nsearch(0) --> nil\n");
} else {
fprintf(stderr, "trp_nsearch(0) --> %ld\n", nodeA->key);
}
/* trp_psearch(). */
key.key = 0;
key.magic = NODE_MAGIC;
nodeA = tree_psearch(&tree, &key);
if (nodeA == NULL) {
fprintf(stderr, "trp_psearch(0) --> nil\n");
} else {
fprintf(stderr, "trp_psearch(0) --> %ld\n", nodeA->key);
}
/* trp_insert(). */
srandom(42);
for (i = 0; i < NSETS; i++) {
for (j = 0; j < NNODES; j++) {
set[j] = (long) (((double) NNODES)
* ((double) random() / ((double)RAND_MAX)));
}
for (j = 1; j <= NNODES; j++) {
#ifdef VERBOSE
fprintf(stderr, "Tree %u, %u node%s\n", i, j, j != 1 ? "s" : "");
#endif
/* Initialize tree and nodes. */
tree_new(&tree, 42);
for (k = 0; k < j; k++) {
nodes[k].magic = NODE_MAGIC;
nodes[k].key = set[k];
}
/* Insert nodes. */
for (k = 0; k < j; k++) {
#ifdef VERBOSE
fprintf(stderr, "trp_insert(%3ld)", nodes[k].key);
#endif
tree_insert(&tree, &nodes[k]);
#ifdef TREE_PRINT
fprintf(stderr, "\n\t tree: ");
#endif
#ifdef FORWARD_PRINT
fprintf(stderr, "\n\tforward: ");
#endif
assert(k + 1 == treeIterate(&tree));
#ifdef REVERSE_PRINT
fprintf(stderr, "\n\treverse: ");
#endif
assert(k + 1 == treeIterateReverse(&tree));
#ifdef VERBOSE
fprintf(stderr, "\n");
#endif
sNode = tree_first(&tree);
assert(sNode != NULL);
sNode = tree_last(&tree);
assert(sNode != NULL);
sNode = tree_next(&tree, &nodes[k]);
sNode = tree_prev(&tree, &nodes[k]);
}
/* Remove nodes. */
switch (i % 4) {
case 0: {
for (k = 0; k < j; k++) {
nodeRemove(&tree, &nodes[k], j - k);
}
break;
} case 1: {
for (k = j; k > 0; k--) {
nodeRemove(&tree, &nodes[k-1], k);
}
break;
} case 2: {
node_t *start;
unsigned nNodes = j;
start = NULL;
do {
start = tree_iter(&tree, start, removeIterateCb,
(void *)&nNodes);
nNodes--;
} while (start != NULL);
assert(nNodes == 0);
break;
} case 3: {
node_t *start;
unsigned nNodes = j;
start = NULL;
do {
start = tree_reverse_iter(&tree, start,
removeReverseIterateCb, (void *)&nNodes);
nNodes--;
} while (start != NULL);
assert(nNodes == 0);
break;
} default: {
assert(false);
}
}
}
}
fprintf(stderr, "Test end\n");
return 0;
}
int
main(void) {
tree_t tree;
long set[NNODES];
node_t nodes[NNODES], key, *sNode, *nodeA;
unsigned i, j, k, blackHeight, imbalances;
fprintf(stderr, "Test begin\n");
/* Initialize tree. */
tree_new(&tree);
/*
* Empty tree.
*/
fprintf(stderr, "Empty tree:\n");
/* rb_first(). */
nodeA = tree_first(&tree);
if (nodeA == NULL) {
fprintf(stderr, "rb_first() --> nil\n");
} else {
fprintf(stderr, "rb_first() --> %ld\n", nodeA->key);
}
/* rb_last(). */
nodeA = tree_last(&tree);
if (nodeA == NULL) {
fprintf(stderr, "rb_last() --> nil\n");
} else {
fprintf(stderr, "rb_last() --> %ld\n", nodeA->key);
}
/* rb_search(). */
key.key = 0;
key.magic = NODE_MAGIC;
nodeA = tree_search(&tree, &key);
if (nodeA == NULL) {
fprintf(stderr, "rb_search(0) --> nil\n");
} else {
fprintf(stderr, "rb_search(0) --> %ld\n", nodeA->key);
}
/* rb_nsearch(). */
key.key = 0;
key.magic = NODE_MAGIC;
nodeA = tree_nsearch(&tree, &key);
if (nodeA == NULL) {
fprintf(stderr, "rb_nsearch(0) --> nil\n");
} else {
fprintf(stderr, "rb_nsearch(0) --> %ld\n", nodeA->key);
}
/* rb_psearch(). */
key.key = 0;
key.magic = NODE_MAGIC;
nodeA = tree_psearch(&tree, &key);
if (nodeA == NULL) {
fprintf(stderr, "rb_psearch(0) --> nil\n");
} else {
fprintf(stderr, "rb_psearch(0) --> %ld\n", nodeA->key);
}
/* rb_insert(). */
srandom(42);
for (i = 0; i < NSETS; i++) {
if (i == 0) {
// Insert in order.
for (j = 0; j < NNODES; j++) {
set[j] = j;
}
} else if (i == 1) {
// Insert in reverse order.
for (j = 0; j < NNODES; j++) {
set[j] = NNODES - j - 1;
}
} else {
for (j = 0; j < NNODES; j++) {
set[j] = (long) (((double) NNODES)
* ((double) random() / ((double)RAND_MAX)));
}
}
fprintf(stderr, "Tree %u\n", i);
for (j = 1; j <= NNODES; j++) {
if (verbose) {
fprintf(stderr, "Tree %u, %u node%s\n",
i, j, j != 1 ? "s" : "");
}
/* Initialize tree and nodes. */
tree_new(&tree);
tree.rbt_nil.magic = 0;
for (k = 0; k < j; k++) {
nodes[k].magic = NODE_MAGIC;
nodes[k].key = set[k];
}
/* Insert nodes. */
for (k = 0; k < j; k++) {
if (verbose) {
fprintf(stderr, "rb_insert(%3ld)", nodes[k].key);
}
tree_insert(&tree, &nodes[k]);
if (tree_print) {
fprintf(stderr, "\n\t tree: ");
}
rbtn_black_height(node_t, link, &tree, blackHeight);
imbalances = treeRecurse(tree.rbt_root, blackHeight, 0,
&(tree.rbt_nil));
if (imbalances != 0) {
fprintf(stderr, "\nTree imbalance\n");
abort();
}
if (forward_print) {
fprintf(stderr, "\n\tforward: ");
}
assert(k + 1 == treeIterate(&tree));
if (reverse_print) {
fprintf(stderr, "\n\treverse: ");
}
assert(k + 1 == treeIterateReverse(&tree));
if (verbose) {
fprintf(stderr, "\n");
}
sNode = tree_first(&tree);
assert(sNode != NULL);
sNode = tree_last(&tree);
assert(sNode != NULL);
sNode = tree_next(&tree, &nodes[k]);
sNode = tree_prev(&tree, &nodes[k]);
}
/* Remove nodes. */
switch (i % 4) {
case 0: {
for (k = 0; k < j; k++) {
nodeRemove(&tree, &nodes[k], j - k);
}
break;
} case 1: {
for (k = j; k > 0; k--) {
nodeRemove(&tree, &nodes[k-1], k);
}
break;
} case 2: {
node_t *start;
unsigned nNodes = j;
start = NULL;
do {
start = tree_iter(&tree, start, removeIterateCb,
(void *)&nNodes);
nNodes--;
} while (start != NULL);
assert(nNodes == 0);
break;
} case 3: {
node_t *start;
unsigned nNodes = j;
start = NULL;
do {
start = tree_reverse_iter(&tree, start,
removeReverseIterateCb, (void *)&nNodes);
nNodes--;
} while (start != NULL);
assert(nNodes == 0);
break;
} default: {
assert(false);
}
}
}
}
fprintf(stderr, "Test end\n");
return 0;
}
static void _svoGNGLearn(svo_gng_t *gng, size_t step)
{
const void *input_signal;
bor_net_node_t *nn;
svo_gng_node_t *n1, *n2, *n;
bor_net_edge_t *nedge;
svo_gng_edge_t *edge;
bor_real_t dist2;
bor_list_t *list, *item, *item_tmp;
// 1. Get input signal
input_signal = OPS(gng, input_signal)(OPS_DATA(gng, input_signal));
// 2. Find two nearest nodes to input signal
OPS(gng, nearest)(input_signal, &n1, &n2, OPS_DATA(gng, nearest));
// 3. Create connection between n1 and n2 if doesn't exist and set age
// to zero
nedge = borNetNodeCommonEdge(&n1->node, &n2->node);
if (!nedge){
edge = edgeNew(gng, n1, n2);
}else{
edge = bor_container_of(nedge, svo_gng_edge_t, edge);
}
edge->age = 0;
// 4. Increase error counter of winner node
dist2 = OPS(gng, dist2)(input_signal, n1, OPS_DATA(gng, dist2));
nodeIncError(gng, n1, dist2 * gng->beta_n[gng->params.lambda - step]);
// 5. Adapt nodes to input signal using fractions eb and en
// + 6. Increment age of all edges by one
// + 7. Remove edges with age higher than age_max
OPS(gng, move_towards)(n1, input_signal, gng->params.eb,
OPS_DATA(gng, move_towards));
// adapt also direct topological neighbors of winner node
list = borNetNodeEdges(&n1->node);
BOR_LIST_FOR_EACH_SAFE(list, item, item_tmp){
nedge = borNetEdgeFromNodeList(item);
edge = bor_container_of(nedge, svo_gng_edge_t, edge);
nn = borNetEdgeOtherNode(&edge->edge, &n1->node);
n = bor_container_of(nn, svo_gng_node_t, node);
// increase age (6.)
edge->age += 1;
// remove edge if it has age higher than age_max (7.)
if (edge->age > gng->params.age_max){
edgeDel(gng, edge);
if (borNetNodeEdgesLen(nn) == 0){
// remove node if not connected into net anymore
nodeRemove(gng, n);
n = NULL;
}
}
// move node (5.)
if (n){
OPS(gng, move_towards)(n, input_signal, gng->params.en,
OPS_DATA(gng, move_towards));
}
}
