Hi,
On Dec 2, 10:24 pm, ataggart <[email protected]> wrote: > My guess is that String and array, while not implementing the > IAssociative interface, all have the O(1) lookup performance > guarantees of associative data structures, um, no? According to the bit-partition implementation of vector and the slightly more complex implementation of maps they are O(log_{32} (N)), which of course given the size of Integer doesn't get too large. So I wouldn't think, the Big-O was the reason. But lists, as others, have O(1) lookup for count, so at least the index-based contains? which is used for vectors, Strings and arrays should be usable. Actually it may be usable for every class extending Counted. Best regards, Stefan -- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to [email protected] Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/clojure?hl=en
