@@ -242,10 +242,8 @@ const BT = BinaryTrees
242
242
@inferred BT. insert! (tree, 3 , 30 )
243
243
@inferred Nothing BT. minnode (tree)
244
244
@inferred Nothing BT. maxnode (tree)
245
- @inferred Tuple{Union{BT. AVLNode,Nothing},Union{BT. AVLNode,Nothing}} BT. prevnext (
246
- tree,
247
- 2
248
- )
245
+ @inferred Nothing BT. prevnext (tree, 2 )[1 ]
246
+ @inferred Nothing BT. prevnext (tree, 2 )[2 ]
249
247
@inferred BT. prevnext (tree, nothing )
250
248
@inferred Nothing BT. search (tree, 2 )
251
249
@inferred Nothing BT. search (tree, 1 )
@@ -259,10 +257,10 @@ const BT = BinaryTrees
259
257
@inferred BT. insert! (tree, 3 )
260
258
@inferred Nothing BT. minnode (tree)
261
259
@inferred Nothing BT. maxnode (tree)
262
- @inferred Tuple{Union{BT . AVLNode, Nothing},Union{BT . AVLNode,Nothing}} BT. prevnext (
263
- tree,
264
- 2
265
- )
260
+ @inferred Nothing BT. prevnext (tree, 2 )[ 1 ]
261
+ @inferred Nothing BT . prevnext ( tree, 2 )[ 2 ]
262
+ @inferred BT . prevnext (tree, nothing )
263
+ @inferred Nothing BT . search (tree, 2 )
266
264
@inferred Nothing BT. search (tree, 2 )
267
265
@inferred Nothing BT. search (tree, 1 )
268
266
@inferred Nothing BT. search (tree, 3 )
@@ -275,10 +273,9 @@ const BT = BinaryTrees
275
273
@inferred BT. insert! (tree, " key3" , 3 )
276
274
@inferred Nothing BT. minnode (tree)
277
275
@inferred Nothing BT. maxnode (tree)
278
- @inferred Tuple{Union{BT. AVLNode,Nothing},Union{BT. AVLNode,Nothing}} BT. prevnext (
279
- tree,
280
- " key2"
281
- )
276
+ @inferred Nothing BT. prevnext (tree, " key2" )[1 ]
277
+ @inferred Nothing BT. prevnext (tree, " key2" )[2 ]
278
+ @inferred BT. prevnext (tree, nothing )
282
279
@inferred Nothing BT. search (tree, " key2" )
283
280
@inferred Nothing BT. search (tree, " key1" )
284
281
@inferred Nothing BT. search (tree, " key3" )
@@ -291,10 +288,9 @@ const BT = BinaryTrees
291
288
@inferred BT. insert! (tree, (1 , 0 , 0 ), 3 )
292
289
@inferred Nothing BT. minnode (tree)
293
290
@inferred Nothing BT. maxnode (tree)
294
- @inferred Tuple{Union{BT. AVLNode,Nothing},Union{BT. AVLNode,Nothing}} BT. prevnext (
295
- tree,
296
- (0 , 1 , 0 )
297
- )
291
+ @inferred Nothing BT. prevnext (tree, (0 , 1 , 0 ))[1 ]
292
+ @inferred Nothing BT. prevnext (tree, (0 , 1 , 0 ))[2 ]
293
+ @inferred BT. prevnext (tree, nothing )
298
294
@inferred Nothing BT. search (tree, (0 , 1 , 0 ))
299
295
@inferred Nothing BT. search (tree, (0 , 0 , 1 ))
300
296
@inferred Nothing BT. search (tree, (1 , 0 , 0 ))
0 commit comments