Ignore:
File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/tests/avltree/avl1.c

    r2afec66 r142cf5d  
    33
    44forall(otype K | Comparable(K), otype V)
    5 void ?{}(tree(K, V) &t, K key, V value){
    6   (t.key) { key };
    7   (t.value) { value };
    8   t.parent = NULL;
    9   t.left = NULL;
    10   t.right = NULL;
    11   t.balance = 0;
     5void ?{}(tree(K, V) *t, K key, V value){
     6  (&t->key) { key };
     7  (&t->value) { value };
     8  t->parent = NULL;
     9  t->left = NULL;
     10  t->right = NULL;
     11  t->balance = 0;
    1212}
    1313
    1414forall(otype K, otype V)
    15 void ^?{}(tree(K, V) & t){
    16   delete(t.left);
    17   delete(t.right);
    18   ^(t.key){};
    19   ^(t.value){};
     15void ^?{}(tree(K, V) * t){
     16  delete(t->left);
     17  delete(t->right);
     18  ^(&t->key){};
     19  ^(&t->value){};
    2020}
    2121
     
    2424  // infinite loop trying to resolve ... t = malloc();
    2525  tree(K, V) * t = malloc(sizeof(tree(K,V)));
    26   (*t){ key, value };
     26  t { key, value };
    2727  return t;
    2828}
Note: See TracChangeset for help on using the changeset viewer.