HNGlance

Top Best New Show

Persistent Vector Performance, summarised

http://hypirion.com/musings/persistent-vector-performance-summarised?hnrepost=true

by michaelsbradley • 11 years ago

38 3 11 years ago

HY

Related Stories

Loading related stories...

Comments

3

rawnlq• 11 years ago

I didn't read the whole blog series, but this data structure seems like it could support O(log(n)) insert/remove in middle or front. The equivalent operation in an ArrayList would take O(n).

Why not show off this performance advantage in the benchmark?

deliminator• 11 years ago

Clojure's built in PersistentVector does not support O(log(n)) inserts/removes from the middle/front, but there is another implementation that shares a lot of it's implementation with some extensions that does: https://github.com/clojure/core.rrb-vector/

fulafel• 11 years ago

Nit: most common cache line size is probably 32 bytes, due to smaller processors outnumbering desktop chips.

Source preview

hypirion.com

HNGlance

© 2024-2026 HN Glance. Story content belongs to its original sources.

Privacy
Terms