Note that it's still pretty immature - I started writing it last
weekend. It's tested fairly thoroughly, and I spent four or five days
hunting down the best performance I could, so it should be perfectly
usable. However, if you have any problems please let me know.
Especially, if you plan to dissoc a lot, that will degrade the
performance of seq, keys, etc. - anything that traverses in sorted
order will get a bit slower every time you dissoc. You can call
(compact m) to clean up the mess, but it's not documented yet; I
wasn't planning for anyone to start using it so soon.
On Jun 25, 4:09 pm, Alan Malloy <a...@malloys.org> wrote:
> array-map turns into a hashmap after ten insertions, currently, but
> that's far from guaranteed:
>
> user> (->> {}
> (iterate #(assoc % (rand-int 1e6) 1))
> (drop-while (comp #{(class {})} class))
> (first)
> (count))
> 10
>
> My ordered-set/map are now available on clojars: depend on [ordered
> "0.3.0"]
>
> On Jun 25, 3:56 pm, Alex Baranosky <alexander.barano...@gmail.com>
> wrote:
>
>
>
>
>
>
>
> > I wonder at what point array-map becomes a hash-map? Maybe I could use it?
> > .... On second thought, I don't really want to depend on something so
> > flimsy.
>
> > Alan, is your ordered map code available on clojars?
>
> > Alex
--
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
