Re: Performance O(??) for associative array lookup

[Steven Schveighoffer via Digitalmars-d-learn]

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