Changes in tests/avltree/avl-private.cfa [fd54fef:107b01a]

File:

• tests/avltree/avl-private.cfa (modified) (8 diffs)

tests/avltree/avl-private.cfa

@@ -11 +11 @@
 // an AVL tree's height is easy to compute
 // just follow path with the larger balance
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 int height(tree(K, V) * t){
   int helper(tree(K, V) * t, int ht){
@@ -27 +27 @@
 }
 
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 int calcBalance(tree(K, V) * t){
   int l = height(t->left);
@@ -36 +36 @@
 
 // re-establish the link between parent and child
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 void relinkToParent(tree(K, V) * t){
   tree(K, V) * parent = t->parent; // FIX ME!!
@@ -49 +49 @@
 
 // rotate left from t
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 tree(K, V) * rotateLeft(tree(K, V) * t){
   tree(K, V) * newRoot = t->right;
@@ -68 +68 @@
 
 // rotate right from t
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 tree(K, V) * rotateRight(tree(K, V) * t){
   tree(K, V) * newRoot = t->left;
@@ -87 +87 @@
 
 // balances a node that has balance factor -2 or 2
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 tree(K, V) * fix(tree(K, V) * t){
   // ensure that t's balance factor is one of
@@ -113 +113 @@
 
 // attempt to fix the tree, if necessary
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 tree(K, V) * tryFix(tree(K, V) * t){
   int b = calcBalance(t);
@@ -126 +126 @@
 
 // sets parent field of c to be p
-forall(K | Comparable(K), V)
+forall(otype K | Comparable(K), otype V)
 void setParent(tree(K, V) * c, tree(K, V) * p){
   if (! empty(c)){