About a year and a half ago, there was some discussion about having a function that would enable some kind of bounded search on a sorted map:
http://groups.google.com/group/clojure/browse_thread/thread/949cae6c085d3d39/65b4082085c19a60?q= Does this exist, currently? I haven't looked at the gory details of PersistentTreeMap, so I don't know how difficult this would be to do. Intuitively though, since we have the keys are in a sorted tree, I thought that it would be possible to have a bounded search in something like O(log n). Rob p.s. I asked a related question on stackoverflow: http://stackoverflow.com/questions/1981859/finding-keys-closest-to-a-given-value-for-clojure-sorted-maps -- 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
