Performance O(??) for associative array lookup

Steven Schveighoffer schveiguy at gmail.com
Sat Aug 17 01:04:49 UTC 2024


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


More information about the Digitalmars-d-learn mailing list