30 lines
790 B
Plaintext
30 lines
790 B
Plaintext
From: tim_one at email.msn.com (Tim Peters)
|
|
Date: Sat, 24 Apr 1999 02:31:01 -0400
|
|
Subject: Time complexity of dictionary insertions
|
|
In-Reply-To: <8DB21A313Me@news.rdc1.ct.home.com>
|
|
Message-ID: <000c01be8e1c$05a9dfc0$f09e2299@tim>
|
|
X-UID: 498
|
|
|
|
> This attempt at one-ups-man-ship would be a lot cuter if the STL had any
|
|
> kind of hashed containers, associative or otherwise, whose performance
|
|
> could be quoted! <tentative wink>
|
|
>
|
|
> ...
|
|
>
|
|
> Argumentatively y'rs - dan.
|
|
|
|
I specifically had in mind
|
|
|
|
http://www.sgi.com/Technology/STL/HashedAssociativeContainer.html
|
|
|
|
and its derivatives. I understand that this goes beyond the officially
|
|
blessed C++ STL, even to the point of being useful <0.9 wink>.
|
|
|
|
no-guts-no-glory-ly y'rs - tim
|
|
|
|
|
|
|
|
|
|
|
|
|