tree_spec.h

Go to the documentation of this file.

#include "../src/ceptr.h"
#include "../src/receptor.h"
#include "http_example.h"

void testCreateTreeNodes() {
    /* test the creation of trees and the various function that give access to created data elements
       and basic tree structure navigation
     */
    T *t, *t1, *t2, *t3, *t4, *t5;

    t = _t_new(0,TEST_STR_SYMBOL,"hello",6);
    spec_is_long_equal(_t_size(t),(long)6);
    spec_is_equal(_t_children(t),0);
    spec_is_str_equal((char *)_t_surface(t),"hello");
    spec_is_ptr_equal(_t_parent(t),NULL);
    spec_is_ptr_equal(_t_root(t),t);
    spec_is_ptr_equal(_t_child(t,1),NULL);
    spec_is_true(semeq(_t_symbol(t),TEST_STR_SYMBOL));

    t1 = _t_new(t,TEST_STR_SYMBOL,"t1",3);
    spec_is_ptr_equal(_t_parent(t1),t);
    spec_is_equal(_t_children(t),1);
    spec_is_ptr_equal(_t_child(t,1),t1);
    spec_is_ptr_equal(_t_root(t1),t);

    t2 = _t_new(t,TEST_STR_SYMBOL,"t2",3);
    spec_is_ptr_equal(_t_parent(t2),t);
    spec_is_equal(_t_children(t),2);
    spec_is_ptr_equal(_t_child(t,2),t2);
    spec_is_ptr_equal(_t_root(t2),t);

    Symbol s99 = {0,0,99};

    t3 = _t_newi(t,s99,101);
    spec_is_ptr_equal(_t_parent(t3),t);
    spec_is_equal(_t_children(t),3);
    spec_is_equal(*(int *)_t_surface(_t_child(t,3)),101);

    spec_is_ptr_equal(_t_next_sibling(t1),t2);
    spec_is_ptr_equal(_t_next_sibling(t),NULL);
    spec_is_ptr_equal(_t_next_sibling(t2),t3);
    spec_is_ptr_equal(_t_next_sibling(t3),NULL);

    t4 = _t_new_root(TEST_ANYTHING_SYMBOL);
    _t_add(t,t4);
    spec_is_equal(_t_children(t),4);
    spec_is_ptr_equal(_t_child(t,4),t4);

    t5 = _t_newr(t4,TEST_ANYTHING_SYMBOL2);
    spec_is_ptr_equal(_t_parent(t5),t4);
    spec_is_long_equal(_t_size(t5),(long)0);
    spec_is_symbol_equal(0,_t_symbol(t5),TEST_ANYTHING_SYMBOL2);

    _t_detach_by_ptr(t,t3);
    _t_free(t3);  // detatch doesn't free the memory of the removed node
    spec_is_equal(_t_children(t),3);
    spec_is_ptr_equal(_t_child(t,3),t4);
    spec_is_ptr_equal(_t_child(t,2),t2);

    _t_free(t);

    float f = 3.1415;
    T *tf = _t_new(0,TEST_FLOAT_SYMBOL,&f,sizeof(float));

    spec_is_str_equal(t2s(tf),"(TEST_FLOAT_SYMBOL:3.141500)");
    _t_free(tf);
}

void testTreeNewReceptor() {

    // @fixme this is really a bogus test, because why would a TEST_INT have a receptor as a child?
    // we should make this a rational test

    T *t = _t_new_root(TEST_ANYTHING_SYMBOL);
    Receptor *r = _r_new(G_sem,TEST_RECEPTOR);
    T *tr = _t_new_receptor(t,TEST_RECEPTOR,r);

    spec_is_ptr_equal(_t_surface(tr),r);
    spec_is_true(!(tr->context.flags & TFLAG_ALLOCATED));

    spec_is_str_equal(t2s(t),"(TEST_ANYTHING_SYMBOL (TEST_RECEPTOR:{(RECEPTOR_INSTANCE (INSTANCE_OF:TEST_RECEPTOR) (CONTEXT_NUM:3) (PARENT_CONTEXT_NUM:0) (RECEPTOR_STATE (FLUX (DEFAULT_ASPECT (EXPECTATIONS) (SIGNALS))) (PENDING_SIGNALS) (PENDING_RESPONSES) (CONVERSATIONS) (RECEPTOR_ELAPSED_TIME:0)))}))");

    _t_free(t); // note, no need to free the receptor explicitly, as _t_free knows about it
}

void testTreeScape() {
    Scape *s = _s_new(TEST_INT_SYMBOL,TEST_STR_SYMBOL);
    T *ts = _t_new_scape(0,TEST_ALPHABETIZE_SCAPE_SYMBOL,s);

    spec_is_true(ts->context.flags &= TFLAG_SURFACE_IS_SCAPE);
    spec_is_ptr_equal(_t_surface(ts),s);
    spec_is_str_equal(t2s(ts),"(TEST_ALPHABETIZE_SCAPE_SYMBOL:key TEST_INT_SYMBOL,data TEST_STR_SYMBOL)");

    _t_free(ts); // note, no need to free the scape explicitly, as _t_free knows about it
}

void testTreeStream() {
    FILE *stream;
    char buffer[] = "line1\nline2\n";
    stream = fmemopen(buffer, strlen (buffer), "r+");

    Stream *s = _st_new_unix_stream(stream,0);
    T *ts = _t_new_cptr(0,EDGE_STREAM,s);

    spec_is_true(ts->context.flags & TFLAG_SURFACE_IS_CPTR);
    spec_is_true(ts->context.flags & TFLAG_REFERENCE);
    spec_is_ptr_equal(_t_surface(ts),s);
    char *x = t2s(ts);
    x[12]=0; // chop off the actual address cus that changes all the time
    spec_is_str_equal(x,"(EDGE_STREAM");

    _t_free(ts);
    // note, for now we must handle all stream deallocation manually because the stream
    // is just stored in the tree as a cptr
    _st_free(s);

}

void testTreeOrthogonal() {
    T *t = _t_new_root(TEST_ANYTHING_SYMBOL);
    T *t2 = _t_newi(0,TEST_INT_SYMBOL2,99);
    T *o = _t_newt(t,TEST_TREE_SYMBOL,t2);

    spec_is_str_equal(t2s(t),"(TEST_ANYTHING_SYMBOL (TEST_TREE_SYMBOL:{(TEST_INT_SYMBOL2:99)}))");

    T *tc = _t_clone(t);
    spec_is_str_equal(t2s(tc),"(TEST_ANYTHING_SYMBOL (TEST_TREE_SYMBOL:{(TEST_INT_SYMBOL2:99)}))");

    _t_free(t);
    _t_free(tc);
}

void testTreeRealloc() {
    T *ts[12];
    T *t = _t_new(0,TEST_STR_SYMBOL,"t",2);
    char tname[3];
    int i;
    tname[0] = 't';
    tname[2] = 0;
    for (i=0;i<12;i++){
    tname[1] = 'a'+i;
    ts[i] = _t_new(t,TEST_STR_SYMBOL,tname,3);
    }
    spec_is_str_equal((char *)_t_surface(ts[11]),"tl");
    _t_free(t);
}

void testTreePathGet() {
    T *t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0

    int p0[] = {TREE_PATH_TERMINATOR};
    int p1[] = {1,TREE_PATH_TERMINATOR};
    int p2[] = {2,TREE_PATH_TERMINATOR};
    int p3[] = {3,TREE_PATH_TERMINATOR};
    int p33[] = {3,3,TREE_PATH_TERMINATOR};
    int p331[] = {3,3,1,TREE_PATH_TERMINATOR};
    int p3312[] = {3,3,1,2,TREE_PATH_TERMINATOR};
    int p33122[] = {3,3,1,2,2,TREE_PATH_TERMINATOR};
    int p311[] = {3,1,1,TREE_PATH_TERMINATOR};

    spec_is_ptr_equal(_t_get(t,p0),t);
    spec_is_symbol_equal(0,_t_symbol(_t_get(t,p1)),HTTP_REQUEST_VERSION);
    spec_is_symbol_equal(0,_t_symbol(_t_get(t,p2)),HTTP_REQUEST_METHOD);
    spec_is_symbol_equal(0,_t_symbol(_t_get(t,p3)),HTTP_REQUEST_PATH);
    spec_is_symbol_equal(0,_t_symbol(_t_get(t,p33)),HTTP_REQUEST_PATH_QUERY);
    spec_is_symbol_equal(0,_t_symbol(_t_get(t,p331)),HTTP_REQUEST_PATH_QUERY_PARAMS);
    spec_is_symbol_equal(0,_t_symbol(_t_get(t,p3312)),HTTP_REQUEST_PATH_QUERY_PARAM);
    spec_is_symbol_equal(0,_t_symbol(_t_get(t,p33122)),PARAM_VALUE);
    spec_is_symbol_equal(0,_t_symbol(_t_get(t,p311)),HTTP_REQUEST_PATH_SEGMENT);

    spec_is_str_equal(t2s(_t_getv(t,3,3,1,2,TREE_PATH_TERMINATOR)),"(HTTP_REQUEST_PATH_QUERY_PARAM (PARAM_KEY:page) (PARAM_VALUE:2))");

    //  _t_get returns null if tree doesn't have a node at the given path
    p311[2] = 3;
    spec_is_ptr_equal(_t_get(t,p311),NULL);

    _t_free(t);
}

void testTreePathGetSurface() {
    T *t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0

    int p1[] = {3,1,1,TREE_PATH_TERMINATOR};
    int p2[] = {3,1,2,TREE_PATH_TERMINATOR};
    int p3[] = {3,3,1,2,2,TREE_PATH_TERMINATOR};

    spec_is_str_equal((char *)_t_get_surface(t,p1),"groups");
    spec_is_str_equal((char *)_t_get_surface(t,p2),"5");
    spec_is_str_equal((char *)_t_get_surface(t,p3),"2");

    // make a test tree with the HTTP request tree as an orthogonal tree
    T *tt = _t_newt(0,TEST_TREE_SYMBOL,t);
    int po[] = {0,TREE_PATH_TERMINATOR};
    int po1[] = {0,3,1,1,TREE_PATH_TERMINATOR};

    // using 0 in the path should "dive"into the orthogonal tree
    T *x =_t_get(tt,po);
    spec_is_ptr_equal(x,t);
    spec_is_str_equal((char *)_t_get_surface(tt,po1),"groups");

    _t_free(tt);
}

void testTreePathGetPath() {
    T *t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0
    int p0[] = {TREE_PATH_TERMINATOR};
    int p1[] = {1,TREE_PATH_TERMINATOR};
    int p2[] = {3,1,TREE_PATH_TERMINATOR};
    int p3[] = {3,1,1,TREE_PATH_TERMINATOR};
    int *path;

    path = _t_get_path(_t_get(t,p0));
    spec_is_path_equal(path,p0);
    free(path);
    path = _t_get_path(_t_get(t,p1));
    spec_is_path_equal(path,p1);
    free(path);
    path = _t_get_path(_t_get(t,p3));
    spec_is_path_equal(path,p3);
    free(path);
    path = _t_get_path(_t_get(t,p2));
    spec_is_path_equal(path,p2);
    free(path);

    _t_free(t);
 }

void testTreePathEqual() {
    int p0[] = {TREE_PATH_TERMINATOR};
    int p1[] = {1,TREE_PATH_TERMINATOR};
    int p2[] = {2,TREE_PATH_TERMINATOR};
    int p3[] = {2,1,1,TREE_PATH_TERMINATOR};
    int p4[] = {3,0,TREE_PATH_TERMINATOR};
    int p5[] = {3,0,2,1,1,TREE_PATH_TERMINATOR};

    spec_is_true(_t_path_equal(p0,p0));
    spec_is_true(_t_path_equal(p1,p1));
    spec_is_true(_t_path_equal(p2,p2));
    spec_is_true(_t_path_equal(p3,p3));
    spec_is_true(!_t_path_equal(p0,p1));
    spec_is_true(!_t_path_equal(p2,p3));
    spec_is_true(!_t_path_equal(p4,p3));
    spec_is_true(!_t_path_equal(p0,p3));
    spec_is_true(!_t_path_equal(p4,p5));
}

void testTreePathDepth() {
    int p0[] = {TREE_PATH_TERMINATOR};
    int p1[] = {1,TREE_PATH_TERMINATOR};
    int p2[] = {3,0,TREE_PATH_TERMINATOR};
    int p3[] = {2,1,1,TREE_PATH_TERMINATOR};
    int p5[] = {3,0,2,1,1,TREE_PATH_TERMINATOR};

    spec_is_equal(_t_path_depth(p0),0);
    spec_is_equal(_t_path_depth(p1),1);
    spec_is_equal(_t_path_depth(p2),2);
    spec_is_equal(_t_path_depth(p3),3);
    spec_is_equal(_t_path_depth(p5),5);
}

void testTreePathCopy() {
    int pp[10];
    int p5[] = {3,0,2,1,1,TREE_PATH_TERMINATOR};
    _t_pathcpy(pp,p5);

    spec_is_path_equal(pp,p5);
}

void testTreePathSprint() {
    char buf[255];
    int p5[] = {3,0,2,1,1,TREE_PATH_TERMINATOR};

    spec_is_str_equal(_t_sprint_path(p5,buf),"/3/0/2/1/1");
}

void testTreePathWalk() {
    T *x,*t = _t_parse(G_sem,0,"(Root (A) (B (C (D) (E))) (F))");

    int *path = NULL;
    int len;

    x = _t_path_walk(t,&path,&len);
    spec_is_str_equal(t2s(x),"(A)");
    int p1[] = {1,TREE_PATH_TERMINATOR};
    spec_is_path_equal(path,p1);
    spec_is_equal(len,2*sizeof(int));

    x = _t_path_walk(t,&path,&len);
    spec_is_str_equal(t2s(x),"(D)");
    int p2[] = {2,1,1,TREE_PATH_TERMINATOR};
    spec_is_path_equal(path,p2);
    spec_is_equal(len,4*sizeof(int));

    x = _t_path_walk(t,&path,&len);
    spec_is_str_equal(t2s(x),"(E)");
    int p3[] = {2,1,2,TREE_PATH_TERMINATOR};
    spec_is_path_equal(path,p3);

    x = _t_path_walk(t,&path,&len);
    spec_is_str_equal(t2s(x),"(C (D) (E))");
    int p4[] = {2,1,TREE_PATH_TERMINATOR};
    spec_is_path_equal(path,p4);

    x = _t_path_walk(t,&path,&len);
    spec_is_str_equal(t2s(x),"(B (C (D) (E)))");
    int p5[] = {2,TREE_PATH_TERMINATOR};
    spec_is_path_equal(path,p5);

    x = _t_path_walk(t,&path,&len);
    spec_is_str_equal(t2s(x),"(F)");
    int p6[] = {3,TREE_PATH_TERMINATOR};
    spec_is_path_equal(path,p6);

    x = _t_path_walk(t,&path,&len);
    spec_is_str_equal(t2s(x),"(Root (A) (B (C (D) (E))) (F))");
    int p7[] = {TREE_PATH_TERMINATOR};
    spec_is_path_equal(path,p7);

    x = _t_path_walk(t,&path,&len);
    spec_is_ptr_equal(x,NULL);

    free(path);
}

void testTreeNodeIndex() {
    T *t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0
    spec_is_equal(_t_node_index(_t_child(t,1)),1);
    spec_is_equal(_t_node_index(_t_child(t,2)),2);
    spec_is_equal(_t_node_index(_t_child(t,3)),3);
    spec_is_equal(_t_node_index(t),0);

   _t_free(t);
}

void testTreeClone() {
    T *t = _makeTestHTTPRequestTree();
    T *c = _t_clone(t);

    spec_is_true(t!=c);
    spec_is_equal(_t_children(c),_t_children(t));

    char buf1[2000];
    char buf2[2000];
    __t_dump(G_sem,c,0,buf1);
    __t_dump(G_sem,t,0,buf2);

    spec_is_str_equal(buf1,buf2);

    spec_is_equal((int)_t_size(t),(int)_t_size(c)); // test cloning of 0 size items (i.e. roots)

    _t_free(t);
    _t_free(c);

}

void testTreeReplace() {
    T *t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0

    // replace the version with a new version
    T *t_version = _t_newr(0,HTTP_REQUEST_VERSION);
    _t_newi(t_version,VERSION_MAJOR,1);
    _t_newi(t_version,VERSION_MINOR,1);

    _t_replace(t,1,t_version);
    int p[] = {1,TREE_PATH_TERMINATOR};
    spec_is_str_equal(t2s(_t_get(t,p)),"(HTTP_REQUEST_VERSION (VERSION_MAJOR:1) (VERSION_MINOR:1))");

    _t_free(t);

    t = _t_build(G_sem,0,SEMANTIC_MAP,SEMANTIC_LINK,USAGE,REQUEST_TYPE,REPLACEMENT_VALUE,ACTUAL_SYMBOL,PING,NULL_SYMBOL,NULL_SYMBOL,NULL_SYMBOL);

    T *t2 = _t_build(G_sem,0,TEST_ANYTHING_SYMBOL,TEST_INT_SYMBOL,1,TEST_INT_SYMBOL,2,TEST_INT_SYMBOL,1,TEST_INT_SYMBOL,3,NULL_SYMBOL,NULL_SYMBOL);

    // test that replace_node can replace at the parent level.
    _t_replace_node(t,t2);
    spec_is_str_equal(t2s(t),"(TEST_ANYTHING_SYMBOL (TEST_INT_SYMBOL:1) (TEST_INT_SYMBOL:2) (TEST_INT_SYMBOL:1) (TEST_INT_SYMBOL:3))");
    spec_is_ptr_equal(_t_parent(t),NULL);
    spec_is_ptr_equal(_t_parent(_t_child(t,2)),t);

    // and also at the child level
    t2 = _t_newi(0,TEST_INT_SYMBOL,314);
    _t_replace_node(_t_child(t,2),t2);
    spec_is_str_equal(t2s(t),"(TEST_ANYTHING_SYMBOL (TEST_INT_SYMBOL:1) (TEST_INT_SYMBOL:314) (TEST_INT_SYMBOL:1) (TEST_INT_SYMBOL:3))");
    spec_is_ptr_equal(_t_parent(_t_child(t,2)),t);


    _t_free(t);

}

void testTreeSwap() {
    T *t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0

    // replace the version with a new version
    T *t_version = _t_newr(0,HTTP_REQUEST_VERSION);
    _t_newi(t_version,VERSION_MAJOR,1);
    _t_newi(t_version,VERSION_MINOR,2);

    spec_is_str_equal(t2s(_t_child(t,1)),"(HTTP_REQUEST_VERSION (VERSION_MAJOR:1) (VERSION_MINOR:1))");
    T *s = _t_swap(t,1,t_version);
    // swap returns the node swapped out as a root node
    spec_is_str_equal(t2s(s),"(HTTP_REQUEST_VERSION (VERSION_MAJOR:1) (VERSION_MINOR:1))");
    spec_is_ptr_equal(_t_parent(s),NULL);
    spec_is_str_equal(t2s(_t_child(t,1)),"(HTTP_REQUEST_VERSION (VERSION_MAJOR:1) (VERSION_MINOR:2))");

    _t_free(s);
    _t_free(t);
}

void testTreeInsertAt() {
    T *t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0
    int p[] = {3,1,2,TREE_PATH_TERMINATOR};
    T *c = _t_new(0,HTTP_REQUEST_PATH_SEGMENT,"a",2);
    _t_insert_at(t,p,c);
    char buf[2000];
    p[2] = TREE_PATH_TERMINATOR;
    c = _t_get(t,p);
    __t_dump(G_sem,c,0,buf);
    spec_is_str_equal(buf,"(HTTP_REQUEST_PATH_SEGMENTS (HTTP_REQUEST_PATH_SEGMENT:groups) (HTTP_REQUEST_PATH_SEGMENT:a) (HTTP_REQUEST_PATH_SEGMENT:5))");

    _t_free(t);

    t = _t_new_root(ASCII_CHARS);
    p[0] = 1;
    p[1] = TREE_PATH_TERMINATOR;
    _t_insert_at(t,p,_t_newc(0,ASCII_CHAR,'x'));

    spec_is_str_equal(t2s(t),"(ASCII_CHARS (ASCII_CHAR:'x'))");
    _t_free(t);
}

void testTreeMorph() {
    T *x = _t_newi(0,TEST_INT_SYMBOL,123);
    T *z = _t_new(0,TEST_STR_SYMBOL,"fish",5);

    _t_morph(x,z);
    spec_is_str_equal(t2s(x),"(TEST_STR_SYMBOL:fish)");

    _t_free(x);
    _t_free(z);
}

void testTreeMorphLowLevel() {
    T *x = _t_new(0,TEST_STR_SYMBOL,"fish",5);
    int i = 789;

    __t_morph(x,TEST_INT_SYMBOL,&i,sizeof(int),0);
    spec_is_str_equal(t2s(x),"(TEST_INT_SYMBOL:789)");

    _t_free(x);
}

void testTreeDetach() {
    T *t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0
    char buf[2000];
    int p1[] = {1,TREE_PATH_TERMINATOR};

    // remove the version from the tree
    spec_is_symbol_equal(0,_t_symbol(_t_get(t,p1)),HTTP_REQUEST_VERSION);
    T *t_version = _t_detach_by_idx(t,1);
    spec_is_symbol_equal(0,_t_symbol(_t_get(t,p1)),HTTP_REQUEST_METHOD);

    // detached nodes shouldn't have a parent
    spec_is_ptr_equal(_t_parent(t_version),NULL);

    _t_free(t);
    _t_free(t_version);
}

void testTreeHash() {
    T *t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0
    TreeHash h = _t_hash(G_sem,t);

    // test that changing a symbol changes the hash
    t->contents.symbol.id++;
    spec_is_true(!_t_hash_equal(h,_t_hash(G_sem,t)));
    t->contents.symbol.id--;

    // test that changing a surface changes the hash
    int p[] = {1,2,TREE_PATH_TERMINATOR};
    T *v = _t_get(t,p);
    int orig_version = *(int *)&v->contents.surface;
    *(int *)&v->contents.surface = orig_version + 1;
    spec_is_true(!_t_hash_equal(h,_t_hash(G_sem,t)));
    *(int *)&v->contents.surface = orig_version; // change value back

    // test that changing child order changes the hash
    T *t_version = _t_detach_by_idx(t,1);
    _t_add(t,t_version);
    spec_is_true(!_t_hash_equal(h,_t_hash(G_sem,t)));

    _t_free(t);
}

void testUUID() {
    spec_is_long_equal(sizeof(UUIDt),16); //128 bits
    UUIDt u = __uuid_gen();

    struct timespec c;
    clock_gettime(CLOCK_MONOTONIC, &c);
    uint64_t t = ((c.tv_sec * (1000000)) + (c.tv_nsec / 1000));

    // time should be right about now, i.e. within X ms
    spec_is_long_equal(u.time,t);

    // @todo something else for the other bits of the UUID.
}

void testTreeSerialize() {
    char buf[2000] = {0};
    char buf1[2000] = {0};
    T *t1,*t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0
    __t_dump(G_sem,t,0,buf);

    size_t l;
    void *surface,*s;

    _t_serialize(G_sem,t,&surface,&l);
    s = surface;
    t1 = _t_unserialize(G_sem,&surface,&l,0);
    __t_dump(G_sem,t1,0,buf1);

    spec_is_str_equal(buf1,buf);

    _t_free(t);
    _t_free(t1);
    free(s);

}

void testTreeJSON() {
    char buf[5000] = {0};
    T *t = _makeTestHTTPRequestTree(); // GET /groups/5/users.json?sort_by=last_name?page=2 HTTP/1.0
    _t2json(G_sem,t,INDENT,buf);

    // @todo got screwed up by removing list, too lazy to fix
    //spec_is_str_equal(buf,"{ \"symbol\":{ \"context\":255,\"id\":17 },\"type\":\"HTTP_REQUEST_V09\",\"name\":\"HTTP_REQUEST\",\"children\":[\n   { \"symbol\":{ \"context\":255,\"id\":16 },\"type\":\"VERSION\",\"name\":\"HTTP_REQUEST_VERSION\",\"children\":[\n      { \"symbol\":{ \"context\":255,\"id\":14 },\"type\":\"INTEGER\",\"name\":\"VERSION_MAJOR\",\"surface\":1},\n      { \"symbol\":{ \"context\":255,\"id\":15 },\"type\":\"INTEGER\",\"name\":\"VERSION_MINOR\",\"surface\":0}]},\n   { \"symbol\":{ \"context\":255,\"id\":2 },\"type\":\"CSTRING\",\"name\":\"HTTP_REQUEST_METHOD\",\"surface\":\"GET\"},\n   { \"symbol\":{ \"context\":255,\"id\":13 },\"type\":\"URI\",\"name\":\"HTTP_REQUEST_PATH\",\"children\":[\n      { \"symbol\":{ \"context\":255,\"id\":3 },\"type\":\"segments list\",\"name\":\"HTTP_REQUEST_PATH_SEGMENTS\",\"children\":[\n         { \"symbol\":{ \"context\":255,\"id\":4 },\"type\":\"CSTRING\",\"name\":\"HTTP_REQUEST_PATH_SEGMENT\",\"surface\":\"groups\"},\n         { \"symbol\":{ \"context\":255,\"id\":4 },\"type\":\"CSTRING\",\"name\":\"HTTP_REQUEST_PATH_SEGMENT\",\"surface\":\"5\"}]},\n      { \"symbol\":{ \"context\":255,\"id\":7 },\"type\":\"FILE_HANDLE\",\"name\":\"HTTP_REQUEST_PATH_FILE\",\"children\":[\n         { \"symbol\":{ \"context\":255,\"id\":5 },\"type\":\"CSTRING\",\"name\":\"FILE_NAME\",\"surface\":\"users\"},\n         { \"symbol\":{ \"context\":255,\"id\":6 },\"type\":\"CSTRING\",\"name\":\"FILE_EXTENSION\",\"surface\":\"json\"}]},\n      { \"symbol\":{ \"context\":255,\"id\":8 },\"type\":\"query struct\",\"name\":\"HTTP_REQUEST_PATH_QUERY\",\"children\":[\n         { \"symbol\":{ \"context\":255,\"id\":9 },\"type\":\"query param list\",\"name\":\"HTTP_REQUEST_PATH_QUERY_PARAMS\",\"children\":[\n            { \"symbol\":{ \"context\":255,\"id\":12 },\"type\":\"KEY_VALUE_PARAM\",\"name\":\"HTTP_REQUEST_PATH_QUERY_PARAM\",\"children\":[\n               { \"symbol\":{ \"context\":255,\"id\":10 },\"type\":\"CSTRING\",\"name\":\"PARAM_KEY\",\"surface\":\"sort_by\"},\n               { \"symbol\":{ \"context\":255,\"id\":11 },\"type\":\"CSTRING\",\"name\":\"PARAM_VALUE\",\"surface\":\"last_name\"}]},\n            { \"symbol\":{ \"context\":255,\"id\":12 },\"type\":\"KEY_VALUE_PARAM\",\"name\":\"HTTP_REQUEST_PATH_QUERY_PARAM\",\"children\":[\n               { \"symbol\":{ \"context\":255,\"id\":10 },\"type\":\"CSTRING\",\"name\":\"PARAM_KEY\",\"surface\":\"page\"},\n               { \"symbol\":{ \"context\":255,\"id\":11 },\"type\":\"CSTRING\",\"name\":\"PARAM_VALUE\",\"surface\":\"2\"}]}]}]}]}]}");

    wjson(G_sem,t,"httpreq",0);
    char *stxs = "/%<HTTP_REQUEST_PATH_SEGMENTS:HTTP_REQUEST_PATH_SEGMENTS,HTTP_REQUEST_PATH_FILE>";
    T *stx;
    stx = parseSemtrex(G_sem,stxs);
    wjson(G_sem,stx,"httpreq",1);

    T *r;
    if (_t_matchr(stx,t,&r)) {
    wjson(G_sem,r,"httpreq",2);
    _t_free(r);
    }

    _t_free(stx);
    _t_free(t);
}

void testProcessHTML() {
    T *t = parseHTML("<html><body><div id=\"314\" class=\"contents\">Hello world<img src=\"test.png\"/></div></body></html>");
    spec_is_str_equal(t2s(t),"(HTML_HTML (HTML_ATTRIBUTES) (HTML_CONTENT (HTML_BODY (HTML_ATTRIBUTES) (HTML_CONTENT (HTML_DIV (HTML_ATTRIBUTES (HTML_ATTRIBUTE (PARAM_KEY:id) (PARAM_VALUE:314)) (HTML_ATTRIBUTE (PARAM_KEY:class) (PARAM_VALUE:contents))) (HTML_CONTENT (HTML_TEXT:Hello world) (HTML_IMG (HTML_ATTRIBUTES (HTML_ATTRIBUTE (PARAM_KEY:src) (PARAM_VALUE:test.png))) (HTML_CONTENT))))))))");
    _t_free(t);
}

void testTreeBuild() {

    // tests basic structures plus the STRUCTURE_ANYTHING
    T *t = _t_build(G_sem,0,TEST_ANYTHING_SYMBOL,ACTION,IF,TEST_ANYTHING_SYMBOL,TEST_STR_SYMBOL,"fish",NULL_SYMBOL,TEST_INT_SYMBOL,3141,SIGNAL_REF,SignalMessageIdx,MessageHeadIdx,HeadCarrierIdx,TREE_PATH_TERMINATOR,NULL_SYMBOL);
    spec_is_str_equal(t2s(t),"(TEST_ANYTHING_SYMBOL (ACTION:IF) (TEST_ANYTHING_SYMBOL (TEST_STR_SYMBOL:fish)) (TEST_INT_SYMBOL:3141) (SIGNAL_REF:/2/1/4))");
    _t_free(t);

    // tests the STRUCTURE_SEQUENCE def
    t = _t_build(G_sem,0,SYMBOL_DEFINITION,SYMBOL_LABEL,ENGLISH_LABEL,"shoe size",NULL_SYMBOL,SYMBOL_STRUCTURE,INTEGER,NULL_SYMBOL);
    spec_is_str_equal(t2s(t),"(SYMBOL_DEFINITION (SYMBOL_LABEL (ENGLISH_LABEL:shoe size)) (SYMBOL_STRUCTURE:INTEGER))");
    _t_free(t);
    t = _t_build(G_sem,0,TODAY,YEAR,2015,MONTH,1,DAY,30,NULL_SYMBOL);
    spec_is_str_equal(t2s(t),"(TODAY (YEAR:2015) (MONTH:1) (DAY:30))");
    _t_free(t);
    // tests the STRUCTURE_OR def
    t = _t_build(G_sem,0,PATTERN,SEMTREX_SYMBOL_LITERAL,SEMTREX_SYMBOL,PING,NULL_SYMBOL);
    spec_is_str_equal(t2s(t),"(PATTERN (SEMTREX_SYMBOL_LITERAL (SEMTREX_SYMBOL:PING)))");
    _t_free(t);

    // tests building a code tree
    t = _t_build(G_sem,0,RESPOND,SIGNAL_REF,SignalMessageIdx,MessageHeadIdx,HeadCarrierIdx,TREE_PATH_TERMINATOR,YUP,NULL_SYMBOL);
    spec_is_str_equal(t2s(t),"(process:RESPOND (SIGNAL_REF:/2/1/4) (YUP))");
    _t_free(t);

    // test building floats
    t = _t_build(G_sem,0,TEST_FLOAT_SYMBOL,3.14);
    spec_is_str_equal(t2s(t),"(TEST_FLOAT_SYMBOL:3.140000)");
    _t_free(t);

    // test building chars
    t = _t_build(G_sem,0,ASCII_CHAR,'x');
    spec_is_str_equal(t2s(t),"(ASCII_CHAR:'x')");
    _t_free(t);


    // build2 tests
    t = _t_build2(G_sem,0,STX_OP,PROTOCOL_DEFINITION,STX_OP,PROTOCOL_LABEL,STX_OP,ENGLISH_LABEL,"RECOGNIZE",STX_CP,STX_CP,STX_OP,PROTOCOL_SEMANTICS,STX_CP,STX_OP,INCLUSION,STX_OP,PNAME,REQUESTING,STX_CP,STX_OP,LINKAGE,STX_OP,WHICH_ROLE,STX_OP,ROLE,REQUESTER,STX_CP,STX_OP,ROLE,RECOGNIZER,STX_CP,STX_CP,STX_CP,STX_OP,LINKAGE,STX_OP,WHICH_ROLE,STX_OP,ROLE,RESPONDER,STX_CP,STX_OP,ROLE,RECOGNIZEE,STX_CP,STX_CP,STX_CP,STX_OP,LINKAGE,STX_OP,WHICH_GOAL,STX_OP,GOAL,RESPONSE_HANDLER,STX_CP,STX_OP,GOAL,RECOGNITION,STX_CP,STX_CP,STX_CP,STX_OP,RESOLUTION,STX_OP,WHICH_SYMBOL,STX_OP,USAGE,REQUEST_TYPE,STX_CP,STX_OP,ACTUAL_SYMBOL,are_you,STX_CP,STX_CP,STX_CP,STX_OP,RESOLUTION,STX_OP,WHICH_SYMBOL,STX_OP,USAGE,RESPONSE_TYPE,STX_CP,STX_OP,ACTUAL_SYMBOL,i_am,STX_CP,STX_CP,STX_CP,STX_OP,RESOLUTION,STX_OP,WHICH_PROCESS,STX_OP,GOAL,REQUEST_HANDLER,STX_CP,STX_OP,ACTUAL_PROCESS,fill_i_am,STX_CP,STX_CP,STX_CP,STX_CP,STX_CP);
    spec_is_str_equal(t2s(t),"(PROTOCOL_DEFINITION (PROTOCOL_LABEL (ENGLISH_LABEL:RECOGNIZE)) (PROTOCOL_SEMANTICS) (INCLUSION (PNAME:REQUESTING) (LINKAGE (WHICH_ROLE (ROLE:REQUESTER) (ROLE:RECOGNIZER))) (LINKAGE (WHICH_ROLE (ROLE:RESPONDER) (ROLE:RECOGNIZEE))) (LINKAGE (WHICH_GOAL (GOAL:RESPONSE_HANDLER) (GOAL:RECOGNITION))) (RESOLUTION (WHICH_SYMBOL (USAGE:REQUEST_TYPE) (ACTUAL_SYMBOL:are_you))) (RESOLUTION (WHICH_SYMBOL (USAGE:RESPONSE_TYPE) (ACTUAL_SYMBOL:i_am))) (RESOLUTION (WHICH_PROCESS (GOAL:REQUEST_HANDLER) (ACTUAL_PROCESS:fill_i_am)))))");
    _t_free(t);

    // test building characters
    t = _t_build2(G_sem,0,STX_OP,ASCII_CHAR,'x',STX_CP);
    spec_is_str_equal(t2s(t),"(ASCII_CHAR:'x')");
    _t_free(t);


}

void testTreeTemplate() {

    // test filling a value slot
    T *template = _t_parse(G_sem,0,"(PATTERN (SEMTREX_SYMBOL_LITERAL (SLOT (USAGE:REQUEST_TYPE) (SLOT_IS_VALUE_OF:SEMTREX_SYMBOL))))");
    T *sem_map = _t_parse(G_sem,0,"(SEMANTIC_MAP (SEMANTIC_LINK (USAGE:REQUEST_TYPE) (REPLACEMENT_VALUE (ACTUAL_SYMBOL:PING))))");
    _t_fill_template(template,sem_map);
    spec_is_str_equal(t2s(template),"(PATTERN (SEMTREX_SYMBOL_LITERAL (SEMTREX_SYMBOL:PING)))");
    _t_free(template);
    _t_free(sem_map);

    // test filling a value slot of a non leaf node
    template = _t_build(G_sem,0,REQUEST,SLOT,ROLE,RESPONDER,SLOT_IS_VALUE_OF,TO_ADDRESS,NULL_SYMBOL,SLOT,USAGE,REQUEST_TYPE,NULL_SYMBOL,SLOT,USAGE,REQUEST_TYPE,NULL_SYMBOL,NULL_SYMBOL);
    spec_is_str_equal(t2s(template),"(process:REQUEST (SLOT (ROLE:RESPONDER) (SLOT_IS_VALUE_OF:TO_ADDRESS)) (SLOT (USAGE:REQUEST_TYPE)) (SLOT (USAGE:REQUEST_TYPE)))");
    sem_map = _t_parse(G_sem,0,"(SEMANTIC_MAP (SEMANTIC_LINK (USAGE:REQUEST_TYPE) (REPLACEMENT_VALUE (ACTUAL_SYMBOL:PING))) (SEMANTIC_LINK (ROLE:RESPONDER) (REPLACEMENT_VALUE (ACTUAL_RECEPTOR (RECEPTOR_ADDR:3)))))");
    _t_fill_template(template,sem_map);
    spec_is_str_equal(t2s(template),"(process:REQUEST (TO_ADDRESS (RECEPTOR_ADDR:3)) (PING) (PING))");
    _t_free(template);
    _t_free(sem_map);

    // test filling a structure slot
    template = _t_parse(G_sem,0,"(PATTERN (SEMTREX_SYMBOL_LITERAL (SLOT (USAGE:REQUEST_TYPE))))");
    sem_map = _t_parse(G_sem,0,"(SEMANTIC_MAP (SEMANTIC_LINK (USAGE:REQUEST_TYPE) (REPLACEMENT_VALUE (SEMTREX_SYMBOL:PING))))");
    _t_fill_template(template,sem_map);
    spec_is_str_equal(t2s(template),"(PATTERN (SEMTREX_SYMBOL_LITERAL (SEMTREX_SYMBOL:PING)))");

    _t_free(template);
    _t_free(sem_map);

    // test filling a slot that has specified children (which might also have SLOT)
    template = _t_parse(G_sem,0,"(SLOT (GOAL:RESPONSE_HANDLER) (SLOT_CHILDREN (TEST_INT_SYMBOL:1) (SLOT (USAGE:REQUEST_TYPE))))");
    sem_map = _t_parse(G_sem,0,"(SEMANTIC_MAP (SEMANTIC_LINK (USAGE:REQUEST_TYPE) (REPLACEMENT_VALUE (TEST_INT_SYMBOL:32))) (SEMANTIC_LINK (GOAL:RESPONSE_HANDLER) (REPLACEMENT_VALUE (ACTUAL_PROCESS:ADD_INT))))");
    _t_fill_template(template,sem_map);
    spec_is_str_equal(t2s(template),"(process:ADD_INT (TEST_INT_SYMBOL:1) (TEST_INT_SYMBOL:32))");

    _t_free(template);
    _t_free(sem_map);

    // test filling a slot with nothing
    template = _t_parse(G_sem,0,"(SLOT (GOAL:RESPONSE_HANDLER) (SLOT_CHILDREN (TEST_INT_SYMBOL:1) (SLOT (USAGE:REQUEST_TYPE)) (TEST_INT_SYMBOL:2)))");
    sem_map = _t_parse(G_sem,0,"(SEMANTIC_MAP (SEMANTIC_LINK (USAGE:REQUEST_TYPE) (REPLACEMENT_VALUE (NULL_SYMBOL))) (SEMANTIC_LINK (GOAL:RESPONSE_HANDLER) (REPLACEMENT_VALUE (ACTUAL_PROCESS:ADD_INT))))");
    _t_fill_template(template,sem_map);
    spec_is_str_equal(t2s(template),"(process:ADD_INT (TEST_INT_SYMBOL:1) (TEST_INT_SYMBOL:2))");

    _t_free(template);
    _t_free(sem_map);


}

void testTreeStreamWrite() {
    char buffer[500] = "x";
    FILE *stream;
    stream = fmemopen(buffer, 500, "r+");
    Stream *st = _st_new_unix_stream(stream,1);
    T *t = _t_new_str(0,TEST_STR_SYMBOL,"fish\n");
    spec_is_equal(_t_write(G_sem,t,st),5);
    spec_is_str_equal(buffer,"fish\n");
    _t_free(t);

    t = _t_new_str(0,LINE,"cow");
    spec_is_equal(_t_write(G_sem,t,st),4);
    spec_is_str_equal(buffer,"fish\ncow\n");
    _t_free(t);

    t = _t_new_root(LINES);
    _t_new_str(t,LINE,"thing1");
    _t_new_str(t,LINE,"thing2");
    _t_write(G_sem,t,st);
    _t_free(t);

    t = _t_newi(0,TEST_INT_SYMBOL,314);
    _t_write(G_sem,t,st);
    _t_free(t);

    char *expected_result = "fish\ncow\nthing1\nthing2\n(TEST_INT_SYMBOL:314)";
    spec_is_str_equal(buffer,expected_result);

    _st_free(st);
}

void testTreeInt64() {
    T *t = _t_newi64(0,TEST_INT64_SYMBOL,5000000001);
    spec_is_str_equal(t2s(t),"(TEST_INT64_SYMBOL:5000000001)");
    _t_free(t);
}

void testTreeFindBySymbol() {
    // many times we have symbols with structures that have optional items
    // instead of using a semtrex search, this is a simply scan by symbol type
    // find routine.  So for example expectations have optional semantic maps and
    // conversation so this can be used to find one if it exists.

    T *match = _t_newr(0,PATTERN);
    _sl(match,TEST_INT_SYMBOL);
    UUIDt cuuid = __uuid_gen();
    T *cid = __cid_new(0,&cuuid,0);

    T *t = __r_build_expectation(TEST_INT_SYMBOL,match,_t_newp(0,ACTION,NOOP),0,0,NULL,cid);

    spec_is_ptr_equal(__t_find(t,CONVERSATION_IDENT,ExpectationOptionalsIdx),cid);
    spec_is_ptr_equal(__t_find(t,SEMANTIC_MAP,ExpectationOptionalsIdx),NULL);

    _t_free(t);
}

void testTreeParse() {
    char *s = "( ) \n\t TEST_LABEL:1 1.2 .334 /) 'c'%\"string\" /1/2/3)";
    T *t = __t_tokenize(s);
    spec_is_str_equal(t2s(t),"(P_TOKENS (P_OP) (P_CP) (P_LABEL:TEST_LABEL) (P_COLON) (P_VAL_I:1) (P_VAL_F:1.200000) (P_VAL_F:0.334000) (P_VAL_PATH:/) (P_CP) (P_VAL_C:'c') (P_INTERPOLATE) (P_VAL_S:string) (P_VAL_PATH:/1/2/3) (P_CP))");

    s = "(DO (SCOPE (TEST_INT_SYMBOL:1) (TEST_CHAR_SYMBOL:'x')% (TEST_STR_SYMBOL:\"fish\") (PARAM_REF:/1/2/3) (CARRIER:backnforth)))";
    t = _t_parse(G_sem,0,s,_t_newc(0,ASCII_CHAR,'y'));
    spec_is_str_equal(t2s(t),"(process:DO (SCOPE (TEST_INT_SYMBOL:1) (TEST_CHAR_SYMBOL:'x') (ASCII_CHAR:'y') (TEST_STR_SYMBOL:fish) (PARAM_REF:/1/2/3) (CARRIER:backnforth)))");
    _t_free(t);

    s = "(SIGNATURE_SYMBOL:NULL_SYMBOL)";
    t = _t_parse(G_sem,0,s);
    spec_is_str_equal(t2s(t),s);
    _t_free(t);

    s = "(NULL_SYMBOL)";
    t = _t_parse(G_sem,0,s);
    spec_is_str_equal(t2s(t),s);
    _t_free(t);
}

void testTree() {
    testCreateTreeNodes();
    testTreeNewReceptor();
    testTreeScape();
    testTreeStream();
    testTreeOrthogonal();
    testTreeRealloc();
    testTreeNodeIndex();
    testTreePathGet();
    testTreePathGetSurface();
    testTreePathGetPath();
    testTreePathEqual();
    testTreePathDepth();
    testTreePathCopy();
    testTreePathSprint();
    testTreePathWalk();
    testTreeClone();
    testTreeReplace();
    testTreeSwap();
    testTreeInsertAt();
    testTreeMorph();
    testTreeMorphLowLevel();
    testTreeDetach();
    testTreeHash();
    testUUID();
    testTreeSerialize();
    testTreeJSON();
    testProcessHTML();
    testTreeBuild();
    testTreeTemplate();
    testTreeStreamWrite();
    testTreeInt64();
    testTreeFindBySymbol();
    testTreeParse();
}