Sorted Containers

Added sorted containers to DataStructures, testing, and documentation.
Replaced README.md with README.rst
Kevin,

Are you saying that "insert!" would be a more logical name for this 
function than "ind_insert!"?  Or are you saying that the documented 
behavior of this function matches up with "insert!" from some other 
context (e.g., maybe there is a Base.insert! or something).

-- Steve


On Mon, 25 Aug 2014, Kevin Squire wrote:

> 
> In README.rst:
> 
> > +  `k`` is an element of the key type.  This routine returns the index
> > +  of the first item in the container whose key is greater 
> > +  than ``k``.  If there is no such key, then the past-end 
> > +  index  is returned.
> > +  Time: O(log *n*)
> > +
> > +
> > +--------------------------------------------
> > +Inserting & Deleting for sorted containers
> > +--------------------------------------------
> > +
> > +``empty!(m)``
> > +    Argument ``m`` is a SortedDict, MultiMap or SortedSet.  This
> > +    empties the container.  Time: O(1).
> > +
> > +``ind_insert!(m,k,v)``
> 
> From the documentation, it sounds like this should just be insert!.
> 
> —
> Reply to this email directly or view it onGitHub.[7881863__eyJzY29wZSI6Ik5ld3NpZXM6QmVhY29uIiwiZXhwaXJlcyI6MTcyNDY1MDQ5OSwiZGF0YSI6eyJpZCI6
> NDA1Mjk5MDR9fQ==--5759f00374e4949198d9a9eb9f70b548344b2fd8.gif]
> 
> 
>