This is the mail archive of the guile@cygnus.com mailing list for the guile project.
Index Nav: | [Date Index] [Subject Index] [Author Index] [Thread Index] | |
---|---|---|
Message Nav: | [Date Prev] [Date Next] | [Thread Prev] [Thread Next] |
Jay Glascoe <jglascoe@jay.giss.nasa.gov> writes: > Okay, I'm still open minded. If everyone wants "hash-table", then > I'll go with "hash-table". But I still plan on consulting some > other languages to see (a) what they call their hash tables, and (b) > whether any of them actually have a data structure named > "dictionary" that orders its entries. What's wrong with "map"? I know the STL version has various properties which imply ordering, but that doesn't mean a scheme version needs to. (I was surprised to find that the STL map has ordering; it feels overconstrained to me. Iterators are fine, but I'd expect them to traverse the keys in arbitrary order.) One could have a variety of implementations of map, some of which provide an ordered_map.