I really feel sorted-set should have something to achieve what I want .. but don't seem to find it..
On Thu, Sep 1, 2011 at 3:53 PM, Sunil S Nandihalli < sunil.nandiha...@gmail.com> wrote: > I seem to miss the c++ stl library where it would be trivial to do this! > Sunil. > > > On Thu, Sep 1, 2011 at 3:43 PM, Sunil S Nandihalli < > sunil.nandiha...@gmail.com> wrote: > >> Hi Everybody, >> I would like to create a sorted-data-structure which would enable me to >> efficiently >> >> 1. insert new elements into it maintaining the sorted-nature of the data >> structure. >> 2. query as to which element is immediately before and after a value that >> I present. one can assume that the value that I present is guaranteed to be >> present in the data-structure. >> >> How can I do it? what should I be using to achieve this? I tried to see if >> finger-trees could help with my limited understanding with no success. This >> might be pretty basic .. but some how I seem to be missing something. >> >> Thanks in advance. >> Sunil. >> > > -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
