Sorted dict 1

Pull request for SortedDict and BalancedTree23 taking into account Kevin Squire's feedback from the past 12 days.
Kevin,

Is there a code-coverage tool, i.e., a way to make sure that every 
if-then-else branch has all of its branches executed at least once in a 
test suite?  Earlier I confirmed this by hand (i.e., with lots of println 
statements) for insert! and delete!, but I keep changing the code and I 
want to make sure I still have complete coverage.

Thanks,
Steve


On Tue, 23 Sep 2014, Kevin Squire wrote:

> 
> In test/test_balancedTree.jl:
> 
> > @@ -0,0 +1,942 @@
> > +using DataStructures
> 
> Tests should use Base.Test. This is a pretty simple framework--basically, @assert becomes @test,
> and you also have access to @test_throws <Exception> <code>, @test_approx_eq, and
> @test_approx_eq_eps (the last two of which you probably don't need here).
> 
> —
> Reply to this email directly or view it onGitHub.[7881863__eyJzY29wZSI6Ik5ld3NpZXM6QmVhY29uIiwiZXhwaXJlcyI6MTcyNzEwMTMwNSwiZGF0YSI6eyJpZCI6N
> DE3MzQ5Mjl9fQ==--3454b2575ce4297d85d25d0e997896c638b67957.gif]
> 
> 
>