Remove unnecessary data structure files and add tests

* Previously several files from DataStructures.jl were copied into this repo.
With this PR several are removed and a dependency on DataStructures.jl is
introduced.

* test/runtests.jl is created with a few tests

Author: jlapeyre

.gitignore

@@ -0,0 +1,3 @@
+.DS_Store
+/Manifest.toml
+/dev/

Manifest.toml

@@ -4,7 +4,14 @@ authors = ["Christopher Chubb <[email protected]>"]
 version = "0.1.4"
 
 [deps]
+DataStructures = "864edb3b-99cc-5e75-8d2d-829cb0a9cfe8"
 LinearAlgebra = "37e2e46d-f89d-539d-b4ee-838fcccc9c8e"
 
 [compat]
 julia = "1.4"
+
+[extras]
+Test = "8dfed614-e22c-5e08-85e1-65c5234f0b40"
+
+[targets]
+test = ["Test"]

Project.toml

@@ -6,10 +6,7 @@ module SweepContractor
 
     import Base: By, Lt, Ordering, Forward, ForwardOrdering, ReverseOrdering, lt
     include("sorted_data_structs/data_structures.jl")
-    include("sorted_data_structs/balanced_tree.jl")
     include("sorted_data_structs/avl_tree.jl")
-    include("sorted_data_structs/sorted_dict.jl")
-    include("sorted_data_structs/priorityqueue.jl")
     import LinearAlgebra
     import Base: issorted, sortperm, sort!, isless, intersect
     # Utilities to make sure networks are suitably formatted for sweep contraction

src/SweepContractor.jl

@@ -109,7 +109,7 @@ end
 function search_node(tree::AVLTree{K}, d::K) where K
     prev = nothing
     node = tree.root
-    while node != nothing && node.data != nothing && !eq(tree.ord, node.data, d)
+    while node != nothing && node.data != nothing && !DataStructures.eq(tree.ord, node.data, d)
 
         prev = node
         if lt(tree.ord, d, node.data)
@@ -125,7 +125,7 @@ end
 function Base.haskey(tree::AVLTree{K}, d::K) where K
     (tree.root == nothing) && return false
     node = search_node(tree, d)
-    return eq(tree.ord, node.data, d)
+    return DataStructures.eq(tree.ord, node.data, d)
 end
 
 Base.in(key, tree::AVLTree) = haskey(tree, key)
@@ -242,7 +242,7 @@ function sorted_rank(tree::AVLTree{K}, key::K) where K
     !haskey(tree, key) && throw(KeyError(key))
     node = tree.root
     rank = 0
-    while !eq(tree.ord, node.data, key)
+    while !DataStructures.eq(tree.ord, node.data, key)
         if lt(tree.ord, node.data, key)
             rank += (1 + get_subsize(node.leftChild))
             node = node.rightChild