If that is the case, it could be implemented using transients for a
performance increase.
On Oct 30, 10:53 am, Alex Osborne <a...@meshy.org> wrote:
> Chouser wrote:
> > On Fri, Oct 30, 2009 at 11:30 AM, Alex Osborne <a...@meshy.org> wrote:
> >> John Harrop wrote:
> >>> Was something wrong with this?:
>
> >>> (defn my-zipmap
> >>> "Returns a map with the keys mapped to the corresponding vals."
> >>> [keys vals]
> >>> (into {} (map vec (partition 2 (interleave keys vals)))))
>
> >>> :)
> >> One reason might be that the original zipmap is 5-10 times faster for
> >> large numbers of entries as it doesn't create all the temporary seqs.
>
> > Another might be that into, partition and interleave don't exist
> > yet when zipmap is defined.
>
> Yep, although nothing else in core uses zipmap, so it could be moved
> after them.
--~--~---------~--~----~------------~-------~--~----~
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
-~----------~----~----~----~------~----~------~--~---
