doug-martin/leafy

2013-11-19 20:21:24
8.0
✓9.0
✓10.0
✓20.0
✓21.0
✓22.0
✓23.0
✓24.0
✓25.0
26.0
27.0
28.0
29.0
✓14.0
✓15.0
✓16.0
✓17.0
✓18.0
✓19.0
20.0
21.0
22.0
23.0
24.0
✓6.0
✓6.0
✓6.0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
idle timeout: 30 seconds with no output
2013-11-19 20:27:04
7.0
✓9.0
✓10.0
8.0
✓22.0
✓23.0
✓canary
✓15.0
✓17.0
✓nightly
5.1
5.0.1
✓11.6
✓12.0
next
11.600000000000001
1..226 1..226 1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 1 leafy.AnderssonTree: inserting strings: should find values ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string 1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 41 leafy.AnderssonTree: inserting strings: should clear ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 57 leafy.AVLTree: inserting strings: should find values ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 62 leafy.AVLTree: inserting strings: should contain those string ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 57 leafy.AVLTree: inserting strings: should find values ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 97 leafy.AVLTree: inserting strings: should clear ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 96 leafy.AVLTree: inserting strings: should delete a string ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 97 leafy.AVLTree: inserting strings: should clear ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 153 leafy.BinaryTree: inserting strings: should clear ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 209 leafy.RedBlackTree: inserting strings: should clear ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 209 leafy.RedBlackTree: inserting strings: should clear ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 225 leafy.Tree: insert: should be abstract ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0 ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
firefox/nightly
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
idle timeout: 30 seconds with no output
2013-03-16 00:47:03
✓7.0
✓8.0
✓9.0
✓10.0
✓22.0
✓23.0
✓canary
✓15.0
✓17.0
✓nightly
✓5.1
5.0.1
✓11.6
✓12.0
✓next
11.600000000000001
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
timeout waiting to hear back from safari/5.0.1
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
firefox/nightly
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract
2013-02-18 18:16:51
✓7.0
✓8.0
✓9.0
✓10.0
✓23.0
22.0
canary
✓15.0
✓nightly
17.0
✓5.1
5.0.1
12.0
✓next
11.600000000000001
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
timeout waiting to hear back from opera/12.0
firefox/nightly
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strings: filter: should throw an error if cb is not defined ok 75 leafy.AVLTree: inserting strings: filter: should in_order ok 76 leafy.AVLTree: inserting strings: filter: should pre_order ok 77 leafy.AVLTree: inserting strings: filter: should post_order ok 78 leafy.AVLTree: inserting strings: reduce: should in_order ok 79 leafy.AVLTree: inserting strings: reduce: should pre_order ok 80 leafy.AVLTree: inserting strings: reduce: should post_order ok 81 leafy.AVLTree: inserting strings: reduce: should in_order-accumulator ok 82 leafy.AVLTree: inserting strings: reduce: should pre_order-accumulator ok 83 leafy.AVLTree: inserting strings: reduce: should post_order-accumulator ok 84 leafy.AVLTree: inserting strings: reduceRight: should in_order ok 85 leafy.AVLTree: inserting strings: reduceRight: should pre_order ok 86 leafy.AVLTree: inserting strings: reduceRight: should post_order ok 87 leafy.AVLTree: inserting strings: every: should throw an error if no cb is supplied ok 88 leafy.AVLTree: inserting strings: every: should in_order ok 89 leafy.AVLTree: inserting strings: every: should pre_order ok 90 leafy.AVLTree: inserting strings: every: should post_order ok 91 leafy.AVLTree: inserting strings: some: should throw an error if no cb is supplied ok 92 leafy.AVLTree: inserting strings: some: should in_order ok 93 leafy.AVLTree: inserting strings: some: should pre_order ok 94 leafy.AVLTree: inserting strings: some: should post_order ok 95 leafy.AVLTree: inserting strings: should print the tree correctly ok 96 leafy.AVLTree: inserting strings: should delete a string ok 97 leafy.AVLTree: inserting strings: should clear ok 98 leafy.AVLTree: inserting objects with comparator: should contain those objects ok 99 leafy.AVLTree: inserting objects with comparator: toArray: should in_order ok 100 leafy.AVLTree: inserting objects with comparator: toArray: should pre_order ok 101 leafy.AVLTree: inserting objects with comparator: toArray: should post_order ok 102 leafy.AVLTree: inserting objects with comparator: forEach: should in_order ok 103 leafy.AVLTree: inserting objects with comparator: forEach: should pre_order ok 104 leafy.AVLTree: inserting objects with comparator: forEach: should post_order ok 105 leafy.AVLTree: inserting objects with comparator: map: should in_order ok 106 leafy.AVLTree: inserting objects with comparator: map: should pre_order ok 107 leafy.AVLTree: inserting objects with comparator: map: should post_order ok 108 leafy.AVLTree: inserting objects with comparator: reduce: should in_order ok 109 leafy.AVLTree: inserting objects with comparator: reduce: should pre_order ok 110 leafy.AVLTree: inserting objects with comparator: reduce: should post_order ok 111 leafy.AVLTree: inserting objects with comparator: should every ok 112 leafy.AVLTree: inserting objects with comparator: should some ok 113 leafy.BinaryTree: inserting strings: should find values ok 114 leafy.BinaryTree: inserting strings: should find values less than the value ok 115 leafy.BinaryTree: inserting strings: should find values less or equal to the value ok 116 leafy.BinaryTree: inserting strings: should find values greater than equal to the value ok 117 leafy.BinaryTree: inserting strings: should find values greater than the value ok 118 leafy.BinaryTree: inserting strings: should contain those string ok 119 leafy.BinaryTree: inserting strings: toArray: should in_order ok 120 leafy.BinaryTree: inserting strings: toArray: should pre_order ok 121 leafy.BinaryTree: inserting strings: toArray: should post_order ok 122 leafy.BinaryTree: inserting strings: forEach: should throw an error if cb is not defined ok 123 leafy.BinaryTree: inserting strings: forEach: should in_order ok 124 leafy.BinaryTree: inserting strings: forEach: should pre_order ok 125 leafy.BinaryTree: inserting strings: forEach: should post_order ok 126 leafy.BinaryTree: inserting strings: map: should throw an error if cb is not defined ok 127 leafy.BinaryTree: inserting strings: map: should in_order ok 128 leafy.BinaryTree: inserting strings: map: should pre_order ok 129 leafy.BinaryTree: inserting strings: map: should post_order ok 130 leafy.BinaryTree: inserting strings: filter: should throw an error if cb is not defined ok 131 leafy.BinaryTree: inserting strings: filter: should in_order ok 132 leafy.BinaryTree: inserting strings: filter: should pre_order ok 133 leafy.BinaryTree: inserting strings: filter: should post_order ok 134 leafy.BinaryTree: inserting strings: reduce: should in_order ok 135 leafy.BinaryTree: inserting strings: reduce: should pre_order ok 136 leafy.BinaryTree: inserting strings: reduce: should post_order ok 137 leafy.BinaryTree: inserting strings: reduce: should in_order-accumulator ok 138 leafy.BinaryTree: inserting strings: reduce: should pre_order-accumulator ok 139 leafy.BinaryTree: inserting strings: reduce: should post_order-accumulator ok 140 leafy.BinaryTree: inserting strings: reduceRight: should in_order ok 141 leafy.BinaryTree: inserting strings: reduceRight: should pre_order ok 142 leafy.BinaryTree: inserting strings: reduceRight: should post_order ok 143 leafy.BinaryTree: inserting strings: every: should throw an error if no cb is supplied ok 144 leafy.BinaryTree: inserting strings: every: should in_order ok 145 leafy.BinaryTree: inserting strings: every: should pre_order ok 146 leafy.BinaryTree: inserting strings: every: should post_order ok 147 leafy.BinaryTree: inserting strings: some: should throw an error if no cb is supplied ok 148 leafy.BinaryTree: inserting strings: some: should in_order ok 149 leafy.BinaryTree: inserting strings: some: should pre_order ok 150 leafy.BinaryTree: inserting strings: some: should post_order ok 151 leafy.BinaryTree: inserting strings: should print the tree correctly ok 152 leafy.BinaryTree: inserting strings: should delete a string ok 153 leafy.BinaryTree: inserting strings: should clear ok 154 leafy.BinaryTree: inserting objects with comparator: should contain those objects ok 155 leafy.BinaryTree: inserting objects with comparator: toArray: should in_order ok 156 leafy.BinaryTree: inserting objects with comparator: toArray: should pre_order ok 157 leafy.BinaryTree: inserting objects with comparator: toArray: should post_order ok 158 leafy.BinaryTree: inserting objects with comparator: forEach: should in_order ok 159 leafy.BinaryTree: inserting objects with comparator: forEach: should pre_order ok 160 leafy.BinaryTree: inserting objects with comparator: forEach: should post_order ok 161 leafy.BinaryTree: inserting objects with comparator: map: should in_order ok 162 leafy.BinaryTree: inserting objects with comparator: map: should pre_order ok 163 leafy.BinaryTree: inserting objects with comparator: map: should post_order ok 164 leafy.BinaryTree: inserting objects with comparator: reduce: should in_order ok 165 leafy.BinaryTree: inserting objects with comparator: reduce: should pre_order ok 166 leafy.BinaryTree: inserting objects with comparator: reduce: should post_order ok 167 leafy.BinaryTree: inserting objects with comparator: should every ok 168 leafy.BinaryTree: inserting objects with comparator: should some ok 169 leafy.RedBlackTree: inserting strings: should find values ok 170 leafy.RedBlackTree: inserting strings: should find values less than the value ok 171 leafy.RedBlackTree: inserting strings: should find values less or equal to the value ok 172 leafy.RedBlackTree: inserting strings: should find values greater than equal to the value ok 173 leafy.RedBlackTree: inserting strings: should find values greater than the value ok 174 leafy.RedBlackTree: inserting strings: should contain those string ok 175 leafy.RedBlackTree: inserting strings: toArray: should in_order ok 176 leafy.RedBlackTree: inserting strings: toArray: should pre_order ok 177 leafy.RedBlackTree: inserting strings: toArray: should post_order ok 178 leafy.RedBlackTree: inserting strings: forEach: should throw an error if cb is not defined ok 179 leafy.RedBlackTree: inserting strings: forEach: should in_order ok 180 leafy.RedBlackTree: inserting strings: forEach: should pre_order ok 181 leafy.RedBlackTree: inserting strings: forEach: should post_order ok 182 leafy.RedBlackTree: inserting strings: map: should throw an error if cb is not defined ok 183 leafy.RedBlackTree: inserting strings: map: should in_order ok 184 leafy.RedBlackTree: inserting strings: map: should pre_order ok 185 leafy.RedBlackTree: inserting strings: map: should post_order ok 186 leafy.RedBlackTree: inserting strings: filter: should throw an error if cb is not defined ok 187 leafy.RedBlackTree: inserting strings: filter: should in_order ok 188 leafy.RedBlackTree: inserting strings: filter: should pre_order ok 189 leafy.RedBlackTree: inserting strings: filter: should post_order ok 190 leafy.RedBlackTree: inserting strings: reduce: should in_order ok 191 leafy.RedBlackTree: inserting strings: reduce: should pre_order ok 192 leafy.RedBlackTree: inserting strings: reduce: should post_order ok 193 leafy.RedBlackTree: inserting strings: reduce: should in_order-accumulator ok 194 leafy.RedBlackTree: inserting strings: reduce: should pre_order-accumulator ok 195 leafy.RedBlackTree: inserting strings: reduce: should post_order-accumulator ok 196 leafy.RedBlackTree: inserting strings: reduceRight: should in_order ok 197 leafy.RedBlackTree: inserting strings: reduceRight: should pre_order ok 198 leafy.RedBlackTree: inserting strings: reduceRight: should post_order ok 199 leafy.RedBlackTree: inserting strings: every: should throw an error if no cb is supplied ok 200 leafy.RedBlackTree: inserting strings: every: should in_order ok 201 leafy.RedBlackTree: inserting strings: every: should pre_order ok 202 leafy.RedBlackTree: inserting strings: every: should post_order ok 203 leafy.RedBlackTree: inserting strings: some: should throw an error if no cb is supplied ok 204 leafy.RedBlackTree: inserting strings: some: should in_order ok 205 leafy.RedBlackTree: inserting strings: some: should pre_order ok 206 leafy.RedBlackTree: inserting strings: some: should post_order ok 207 leafy.RedBlackTree: inserting strings: should print the tree correctly ok 208 leafy.RedBlackTree: inserting strings: should delete a string ok 209 leafy.RedBlackTree: inserting strings: should clear ok 210 leafy.RedBlackTree: inserting objects with comparator: should contain those objects ok 211 leafy.RedBlackTree: inserting objects with comparator: toArray: should in_order ok 212 leafy.RedBlackTree: inserting objects with comparator: toArray: should pre_order ok 213 leafy.RedBlackTree: inserting objects with comparator: toArray: should post_order ok 214 leafy.RedBlackTree: inserting objects with comparator: forEach: should in_order ok 215 leafy.RedBlackTree: inserting objects with comparator: forEach: should pre_order ok 216 leafy.RedBlackTree: inserting objects with comparator: forEach: should post_order ok 217 leafy.RedBlackTree: inserting objects with comparator: map: should in_order ok 218 leafy.RedBlackTree: inserting objects with comparator: map: should pre_order ok 219 leafy.RedBlackTree: inserting objects with comparator: map: should post_order ok 220 leafy.RedBlackTree: inserting objects with comparator: reduce: should in_order ok 221 leafy.RedBlackTree: inserting objects with comparator: reduce: should pre_order ok 222 leafy.RedBlackTree: inserting objects with comparator: reduce: should post_order ok 223 leafy.RedBlackTree: inserting objects with comparator: should every ok 224 leafy.RedBlackTree: inserting objects with comparator: should some ok 225 leafy.Tree: insert: should be abstract ok 226 leafy.Tree: remove: should be abstract # tests 226 # pass 226 # fail 0
1..226 ok 1 leafy.AnderssonTree: inserting strings: should find values ok 2 leafy.AnderssonTree: inserting strings: should find values less than the value ok 3 leafy.AnderssonTree: inserting strings: should find values less or equal to the value ok 4 leafy.AnderssonTree: inserting strings: should find values greater than equal to the value ok 5 leafy.AnderssonTree: inserting strings: should find values greater than the value ok 6 leafy.AnderssonTree: inserting strings: should contain those string ok 7 leafy.AnderssonTree: inserting strings: toArray: should in_order ok 8 leafy.AnderssonTree: inserting strings: toArray: should pre_order ok 9 leafy.AnderssonTree: inserting strings: toArray: should post_order ok 10 leafy.AnderssonTree: inserting strings: forEach: should throw an error if cb is not defined ok 11 leafy.AnderssonTree: inserting strings: forEach: should in_order ok 12 leafy.AnderssonTree: inserting strings: forEach: should pre_order ok 13 leafy.AnderssonTree: inserting strings: forEach: should post_order ok 14 leafy.AnderssonTree: inserting strings: map: should throw an error if cb is not defined ok 15 leafy.AnderssonTree: inserting strings: map: should in_order ok 16 leafy.AnderssonTree: inserting strings: map: should pre_order ok 17 leafy.AnderssonTree: inserting strings: map: should post_order ok 18 leafy.AnderssonTree: inserting strings: filter: should throw an error if cb is not defined ok 19 leafy.AnderssonTree: inserting strings: filter: should in_order ok 20 leafy.AnderssonTree: inserting strings: filter: should pre_order ok 21 leafy.AnderssonTree: inserting strings: filter: should post_order ok 22 leafy.AnderssonTree: inserting strings: reduce: should in_order ok 23 leafy.AnderssonTree: inserting strings: reduce: should pre_order ok 24 leafy.AnderssonTree: inserting strings: reduce: should post_order ok 25 leafy.AnderssonTree: inserting strings: reduce: should in_order-accumulator ok 26 leafy.AnderssonTree: inserting strings: reduce: should pre_order-accumulator ok 27 leafy.AnderssonTree: inserting strings: reduce: should post_order-accumulator ok 28 leafy.AnderssonTree: inserting strings: reduceRight: should in_order ok 29 leafy.AnderssonTree: inserting strings: reduceRight: should pre_order ok 30 leafy.AnderssonTree: inserting strings: reduceRight: should post_order ok 31 leafy.AnderssonTree: inserting strings: every: should throw an error if no cb is supplied ok 32 leafy.AnderssonTree: inserting strings: every: should in_order ok 33 leafy.AnderssonTree: inserting strings: every: should pre_order ok 34 leafy.AnderssonTree: inserting strings: every: should post_order ok 35 leafy.AnderssonTree: inserting strings: some: should throw an error if no cb is supplied ok 36 leafy.AnderssonTree: inserting strings: some: should in_order ok 37 leafy.AnderssonTree: inserting strings: some: should pre_order ok 38 leafy.AnderssonTree: inserting strings: some: should post_order ok 39 leafy.AnderssonTree: inserting strings: should print the tree correctly ok 40 leafy.AnderssonTree: inserting strings: should delete a string ok 41 leafy.AnderssonTree: inserting strings: should clear ok 42 leafy.AnderssonTree: inserting objects with comparator: should contain those objects ok 43 leafy.AnderssonTree: inserting objects with comparator: toArray: should in_order ok 44 leafy.AnderssonTree: inserting objects with comparator: toArray: should pre_order ok 45 leafy.AnderssonTree: inserting objects with comparator: toArray: should post_order ok 46 leafy.AnderssonTree: inserting objects with comparator: forEach: should in_order ok 47 leafy.AnderssonTree: inserting objects with comparator: forEach: should pre_order ok 48 leafy.AnderssonTree: inserting objects with comparator: forEach: should post_order ok 49 leafy.AnderssonTree: inserting objects with comparator: map: should in_order ok 50 leafy.AnderssonTree: inserting objects with comparator: map: should pre_order ok 51 leafy.AnderssonTree: inserting objects with comparator: map: should post_order ok 52 leafy.AnderssonTree: inserting objects with comparator: reduce: should in_order ok 53 leafy.AnderssonTree: inserting objects with comparator: reduce: should pre_order ok 54 leafy.AnderssonTree: inserting objects with comparator: reduce: should post_order ok 55 leafy.AnderssonTree: inserting objects with comparator: should every ok 56 leafy.AnderssonTree: inserting objects with comparator: should some ok 57 leafy.AVLTree: inserting strings: should find values ok 58 leafy.AVLTree: inserting strings: should find values less than the value ok 59 leafy.AVLTree: inserting strings: should find values less or equal to the value ok 60 leafy.AVLTree: inserting strings: should find values greater than equal to the value ok 61 leafy.AVLTree: inserting strings: should find values greater than the value ok 62 leafy.AVLTree: inserting strings: should contain those string ok 63 leafy.AVLTree: inserting strings: toArray: should in_order ok 64 leafy.AVLTree: inserting strings: toArray: should pre_order ok 65 leafy.AVLTree: inserting strings: toArray: should post_order ok 66 leafy.AVLTree: inserting strings: forEach: should throw an error if cb is not defined ok 67 leafy.AVLTree: inserting strings: forEach: should in_order ok 68 leafy.AVLTree: inserting strings: forEach: should pre_order ok 69 leafy.AVLTree: inserting strings: forEach: should post_order ok 70 leafy.AVLTree: inserting strings: map: should throw an error if cb is not defined ok 71 leafy.AVLTree: inserting strings: map: should in_order ok 72 leafy.AVLTree: inserting strings: map: should pre_order ok 73 leafy.AVLTree: inserting strings: map: should post_order ok 74 leafy.AVLTree: inserting strin