Changes in src/tests/avltree/avl1.c [2afec66:142cf5d]
- File:
-
- 1 edited
-
src/tests/avltree/avl1.c (modified) (2 diffs)
Legend:
- Unmodified
- Added
- Removed
-
src/tests/avltree/avl1.c
r2afec66 r142cf5d 3 3 4 4 forall(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;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; 12 12 } 13 13 14 14 forall(otype K, otype V) 15 void ^?{}(tree(K, V) &t){16 delete(t .left);17 delete(t .right);18 ^( t.key){};19 ^( t.value){};15 void ^?{}(tree(K, V) * t){ 16 delete(t->left); 17 delete(t->right); 18 ^(&t->key){}; 19 ^(&t->value){}; 20 20 } 21 21 … … 24 24 // infinite loop trying to resolve ... t = malloc(); 25 25 tree(K, V) * t = malloc(sizeof(tree(K,V))); 26 (*t){ key, value };26 t { key, value }; 27 27 return t; 28 28 }
Note:
See TracChangeset
for help on using the changeset viewer.