On Wed, Mar 4, 2009 at 7:53 AM, <rdmurray at bitdance.com> wrote:
> I actually like StableDict best. When I hear that I think, "ah, the
> key order is stable in the face of insertions, unlike a regular dict".
> Nor can I at the moment think of an alternative explanation of what a
> "StableDict" might be.
Hmm, perhaps a better explanation than a hasty +1:
"stabledict" makes me think of merge sort, being a stable sort. In
the same way that merge sort doesn't needlessly swap elements while
sorting, stabledict might be thought to not "needlessly" swap elements
while {inserting, deleting}. I also can't think of an alternative
explanation, so thus far, it's resistant to false positive semantics.
--
Cheers,
Leif
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4