add SplayTree to docs

Author: eulerkochy

README.md

@@ -33,6 +33,7 @@ This package implements a variety of data structures, including
 -   DiBitVector (in which each element can store two bits)
 -   Red Black Tree
 -   AVL Tree
+-   Splay Tree
 
 Resources
 ---------

docs/make.jl

@@ -28,6 +28,7 @@ makedocs(
         "dibit_vector.md",
         "red_black_tree.md",
         "avl_tree.md",
+        "splay_tree.md",
     ],
     modules = [DataStructures],
     format = Documenter.HTML()

docs/src/index.md

@@ -25,6 +25,7 @@ This package implements a variety of data structures, including
 -   DiBitVector
 -   Red Black Tree
 -   AVL Tree
+-   Splay Tree
 
 ## Contents
 

src/splay_tree.jl

@@ -216,7 +216,7 @@ function Base.push!(tree::SplayTree{K}, key0) where K
 end
 
 function Base.getindex(tree::SplayTree{K}, ind) where K 
-    @boundscheck (1 <= ind <= tree.count) || throw(BoundsError("$ind should be in between 1 and $(tree.count)"))
+    @boundscheck (1 <= ind <= tree.count) || throw(KeyError("$ind should be in between 1 and $(tree.count)"))
     function traverse_tree_inorder(node::SplayTreeNode_or_null)
         if (node != nothing)
             left = traverse_tree_inorder(node.leftChild)

test/test_splay_tree.jl

@@ -105,8 +105,8 @@
         for i in 1:10
             @test t6[i] == i
         end
-        @test_throws BoundsError getindex(t6, 0)
-        @test_throws BoundsError getindex(t6, 11)
+        @test_throws KeyError getindex(t6, 0)
+        @test_throws KeyError getindex(t6, 11)
     end
 
     @testset "key conversion in push!" begin