News for hackers. Stuff that matters.
Re:Finger Trees: A Simple General-Purpose Data Structure (2006) by wyager on Tuesday December 27, 2016 @01:04PM (#13264736)
Sure, if you need to do hundreds of millions of insertions per second. In the vast majority of real-world use cases, most of your time is going to be spent elsewhere. Spending a microsecond waiting on memory lookups for a cold finger tree isn't going to do much.

Drop to using less convenient array-backed structures in the few places you need really fast operations, and use slightly slower (constant-wise) data structures where it's more convenient.

Re:Finger Trees: A Simple General-Purpose Data Structure (2006) by gpderetta on Tuesday December 27, 2016 @04:42PM (#13266444)
> Spending a microsecond waiting on memory

that's an eternity!

Re:Finger Trees: A Simple General-Purpose Data Structure (2006) by wyager on Tuesday December 27, 2016 @08:14PM (#13267715)
Not if you're writing UI code, networking code, most IO-related code, etc. A microsecond is very small compared to the time penalty you are likely to incur doing any sort of syscall. For the vast majority of code, it's negligible.

For tight, fast, repetitive code it is far too slow.