Hi, On Wed, Apr 28, 2010 at 05:06:21PM -0400, Douglas Philips wrote:
> Wait, what? Why should seq-contains? be slower than contains? Isn't > this exactly the kind of thing that protocols are supposed to be > solving? Your nice video showed that very thing, right? 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. Sincerely Meikel -- 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
