[erlang-questions] how are implemented lists?
Mon May 18 09:36:59 CEST 2015
Pretty sure thats just a linear search but implemented in c. sorted_set ets
would probably be better?
On May 18, 2015 9:33 AM, "Benoit Chesneau" <bchesneau@REDACTED> wrote:
> how are implemented lists? What is the algorithm behind them? Especially
> for key* functions? I am asking myself if i need to implement a skip-list
> or if the lists module would fit my needs. I indeed need a fast and
> concurrent data structure that allows me to retrieve the items in order and
> do pop/tail, while still being abble to remove them by key. Any idea?
> - benoît
> erlang-questions mailing list
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the erlang-questions