finger-trees would have solved the problem .. but unfortunately it is not part of the clojure distro yet.. :(
On Tue, May 24, 2011 at 11:53 AM, Sunil S Nandihalli < sunil.nandiha...@gmail.com> wrote: > that may be inefficient for a large-set..? I was hoping it would be > log(n).. > > > On Tue, May 24, 2011 at 11:45 AM, Michael Wood <esiot...@gmail.com> wrote: > >> On 24 May 2011 08:07, Sunil S Nandihalli <sunil.nandiha...@gmail.com> >> wrote: >> > Hello everybody, >> > is there a function to find the first element after an element in the >> > sorted-set? >> > (first-element-after 3 (sorted-set 1 2 3 4 5 6)) >> > should return 4? >> >> How about this?: >> >> (first (drop-while (partial >= 3) (sorted-set 1 2 3 4 5 6))) >> >> -- >> Michael Wood <esiot...@gmail.com> >> >> -- >> 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 > > > -- 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
