On: Hashmaps in Factor are faster than in Zig

[otabdeveloper4]

Linked lists are necessary when you have structures that can't be moved. Very important in a highly concurrent or lockfree environment.

[iudqnolq → otabdeveloper4]

How could you use the Rust standard library's linked list for that?

[KerrAvon → otabdeveloper4]

A deque will usually work just as well in that environment and it will always have better general performance characteristics. There are very few legitimate uses of linked lists.

[otabdeveloper4 → KerrAvon]

A deque is a doubly-linked list under the hood.

[adgjlsfhk1 → otabdeveloper4]

Array based deques are very common (and usually much faster). Doubly linked lists are absolutely awful for memory locality.

[boxed → otabdeveloper4]

Can't you have a list of pointers instead?

[xgstation → boxed]

Resizing/deleting items in list in most implementations are either not lock free or not threadsafe

[chmod775 → xgstation]

Yeah, but what if you just use smaller lists and point to the next/previous list?

Hold on...

[boxed → xgstation]

Linked lists aren't either so....?