On Sat, 25 Dec 2010 11:08:17 -0500 bearophile <bearophileh...@lycos.com> wrote:
> > Well the built-in AAs are unordered sets. > > Built-in AAs are not sets because they force you to keep a value associated > with each key (so they use more memory than a set) and their syntax requires > a value for each key, and they don't support the normal set operations you > expect from a set (intersection, union, and so on. See the operations done by > the Python built-in sets). See https://bitbucket.org/denispir/denispir-d/src/b543fb352803/collections.d for a prototype Set type based on D AAs (just like python's). Denis -- -- -- -- -- -- -- vit esse estrany ☣ spir.wikidot.com
