|
1 | 1 | using TreeDataStructures
|
| 2 | +using AbstractTrees |
2 | 3 | using Test
|
3 | 4 |
|
4 | 5 | @testset "TreeDataStructures.jl" begin
|
5 | 6 | @testset "AVLTree" begin
|
6 | 7 | tree = AVLTree{Int,Int}()
|
7 |
| - tree[1] = 10 |
8 | 8 | tree[2] = 20
|
| 9 | + tree[1] = 10 |
9 | 10 | tree[3] = 30
|
10 |
| - @test tree[1] == 10 |
11 | 11 | @test tree[2] == 20
|
| 12 | + @test tree[1] == 10 |
12 | 13 | @test tree[3] == 30
|
13 | 14 |
|
14 | 15 | # value conversion
|
15 | 16 | tree = AVLTree{Int,Float64}()
|
16 |
| - tree[1] = 10 |
17 | 17 | tree[2] = 20
|
| 18 | + tree[1] = 10 |
18 | 19 | tree[3] = 30
|
19 |
| - @test tree[1] isa Float64 |
20 |
| - @test tree[1] == 10.0 |
21 | 20 | @test tree[2] isa Float64
|
22 | 21 | @test tree[2] == 20.0
|
| 22 | + @test tree[1] isa Float64 |
| 23 | + @test tree[1] == 10.0 |
23 | 24 | @test tree[3] isa Float64
|
24 | 25 | @test tree[3] == 30.0
|
25 | 26 |
|
26 | 27 | # tree that accept any types
|
27 | 28 | tree = AVLTree()
|
28 |
| - tree[1] = 1.1 |
29 | 29 | tree[2] = 'A'
|
| 30 | + tree[1] = 1.1 |
30 | 31 | tree[3] = "test"
|
31 |
| - @test tree[1] == 1.1 |
32 | 32 | @test tree[2] == 'A'
|
| 33 | + @test tree[1] == 1.1 |
33 | 34 | @test tree[3] == "test"
|
34 | 35 |
|
35 |
| - # show |
| 36 | + # AbstractTrees interface |
| 37 | + tree = AVLTree{Int,Int}() |
| 38 | + tree[3] = 30 |
| 39 | + tree[2] = 20 |
| 40 | + tree[4] = 40 |
| 41 | + tree[1] = 10 |
| 42 | + tree[5] = 50 |
| 43 | + root = tree.root |
| 44 | + @test children(root) === (root.left, root.right) |
| 45 | + @test children(root.left) === (root.left.left,) |
| 46 | + @test children(root.right) === (root.right.right,) |
| 47 | + @test children(root.left.left) === () |
| 48 | + @test children(root.right.right) === () |
| 49 | + @test nodevalue(root) == 30 |
| 50 | + @test nodevalue(root.left) == 20 |
| 51 | + @test nodevalue(root.right) == 40 |
| 52 | + @test nodevalue(root.left.left) == 10 |
| 53 | + @test nodevalue(root.right.right) == 50 |
| 54 | + @test NodeType(root) === HasNodeType() |
| 55 | + @test nodetype(root) === typeof(root) |
| 56 | + |
| 57 | + # left rotate |
36 | 58 | tree = AVLTree{Int,Int}()
|
37 |
| - @test sprint(show, MIME("text/plain"), tree) == "AVLTree()" |
38 | 59 | tree[1] = 10
|
39 | 60 | tree[2] = 20
|
40 | 61 | tree[3] = 30
|
| 62 | + @test tree.root.key == 2 |
| 63 | + @test tree.root.left.key == 1 |
| 64 | + @test tree.root.right.key == 3 |
| 65 | + |
| 66 | + # right rotate |
| 67 | + tree = AVLTree{Int,Int}() |
| 68 | + tree[3] = 30 |
| 69 | + tree[2] = 20 |
| 70 | + tree[1] = 10 |
| 71 | + @test tree.root.key == 2 |
| 72 | + @test tree.root.left.key == 1 |
| 73 | + @test tree.root.right.key == 3 |
| 74 | + |
| 75 | + # left-right rotate |
| 76 | + tree = AVLTree{Int,Int}() |
| 77 | + tree[3] = 30 |
| 78 | + tree[1] = 10 |
| 79 | + tree[2] = 20 |
| 80 | + @test tree.root.key == 2 |
| 81 | + @test tree.root.left.key == 1 |
| 82 | + @test tree.root.right.key == 3 |
| 83 | + |
| 84 | + # right-left rotate |
| 85 | + tree = AVLTree{Int,Int}() |
| 86 | + tree[1] = 10 |
| 87 | + tree[3] = 30 |
| 88 | + tree[2] = 20 |
| 89 | + @test tree.root.key == 2 |
| 90 | + @test tree.root.left.key == 1 |
| 91 | + @test tree.root.right.key == 3 |
| 92 | + |
| 93 | + # show |
| 94 | + tree = AVLTree{Int,Int}() |
| 95 | + @test sprint(show, MIME("text/plain"), tree) == "AVLTree()" |
| 96 | + tree[3] = 30 |
| 97 | + tree[2] = 20 |
| 98 | + tree[4] = 40 |
| 99 | + tree[1] = 10 |
| 100 | + tree[5] = 50 |
41 | 101 | @test sprint(show, MIME("text/plain"), tree) == """
|
42 | 102 | AVLTree
|
43 |
| - 2 => 20 |
44 |
| - ├─ 1 => 10 |
45 |
| - └─ 3 => 30""" |
| 103 | + 3 => 30 |
| 104 | + ├─ 2 => 20 |
| 105 | + │ └─ 1 => 10 |
| 106 | + └─ 4 => 40 |
| 107 | + └─ 5 => 50""" |
46 | 108 | end
|
47 | 109 | end
|
0 commit comments