On 2010 Apr 28, at 5:14 PM, Meikel Brandmeyer wrote:
If you have a map or a set looking up a key is fast. So contains? is fast (read O(1) resp. something like O(log32 N)). seq-contains? does a linear search through a sequence. That is O(N). Protocols cannot change this.
How is having an optimized version of seq-contains? for sets/maps any different from what Stuart showed in his video, where reduce can have a specialization that is faster on some types?
-Doug -- 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
