4 ms·
There are arrays - https://www.erlang.org/doc/apps/stdlib/array.html https://www.erlang.org/doc/apps/stdlib/array.html Just not used across the language
by out_of_protocol 2y ago
There are arrays - https://www.erlang.org/doc/apps/stdlib/array.html https://www.erlang.org/doc/apps/stdlib/array.html
Just not used across the language
- mikhailfranco 2y agoThey are trees, so not O(1) access or update, more like O(logn), with some memory fragmentation for every update, insertion or deletion. Tuples and binaries give O(1) read access, so depending on your use case, they may be better. Also look at zippers, finger trees and ropes for more dynamic use, especially local operations (cursors).