Permalink
ReplyDoes D give any guarantees for performance order-something ? What’s the current lib implementation like?
Many thanks in advance.
| Thread overview | |||||
|---|---|---|---|---|---|
|
August 14 Performance O(??) for associative array lookup | ||||
|---|---|---|---|---|
| ||||
 | ||||
August 14 Re: Performance O(??) for associative array lookup | ||||
|---|---|---|---|---|
| ||||
 Posted in reply to Cecil Ward | On Wednesday, 14 August 2024 at 07:48:58 UTC, Cecil Ward wrote: >Does D give any guarantees for performance order-something ? What’s the current lib implementation like? Many thanks in advance. See the graphs in https://dplug.org/tutorials/Dplug%20Tutorials%2018%20-%20The%20Case%20Against%20Binary%20Trees.pdf Multiple solutions for O(log(N)) insert, delete and look-up, with builtin hashmaps being pretty good. | |||
August 17 Re: Performance O(??) for associative array lookup | ||||
|---|---|---|---|---|
| ||||
 Posted in reply to Cecil Ward | On Wednesday, 14 August 2024 at 07:48:58 UTC, Cecil Ward wrote: >Does D give any guarantees for performance order-something ? What’s the current lib implementation like? It is amortized O(1), like most hash implementations. -Steve | |||
Copyright © 1999-2021 by the D Language Foundation