[erlang-questions] cost of operations in ordered_set tables

Yariv Sadan <>
Sun Jun 15 09:27:19 CEST 2008


Hi,

What are the costs of insert() and delete() in ordered_set ets tables?
Are they O(log n)? Also, what kind of tree is used to store the keys?
Is it a balanced tree (e.g. red-black tree)?

Thanks,
Yariv



More information about the erlang-questions mailing list