Changes in tests/avltree/avl3.cfa [fd54fef:107b01a]

File:

• tests/avltree/avl3.cfa (modified) (6 diffs)

tests/avltree/avl3.cfa

@@ -4 +4 @@
 
 // swaps the data within two tree nodes
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 void node_swap(tree(K, V) * t, tree(K, V) * t2){
         swap( t->key,  t2->key);
@@ -11 +11 @@
 
 // go left as deep as possible from within the right subtree
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 tree(K, V) * find_successor(tree(K, V) * t){
         tree(K, V) * find_successor_helper(tree(K, V) * t){
@@ -25 +25 @@
 
 // cleanup - don't want to deep delete, so set children to NULL first.
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 void deleteSingleNode(tree(K, V) * t) {
         t->left = NULL;
@@ -33 +33 @@
 
 // does the actual remove operation once we've found the node in question
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 tree(K, V) * remove_node(tree(K, V) * t){
         // is the node a leaf?
@@ -85 +85 @@
 
 // finds the node that needs to be removed
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 tree(K, V) * remove_helper(tree(K, V) * t, K key, int * worked){
         if (empty(t)){
@@ -106 +106 @@
 }
 
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 int remove(tree(K, V) ** t, K key){
         int worked = 0;