-----BEGIN PGP SIGNED MESSAGE----- Hash: SHA1 Hi! Am 16.02.12 00:28, schrieb Robert Ramey:
hmmm - I was go on the initial post which specified
1. fills the set only once, 2. just wants to drop duplicates or 3. calls set::find very often.
and I think that's what my example does.
Yes, I acknowlegde this. And I can think of more ways to compose std lib components in order to achive a one time sorted array. As software grows all the "you can see what it does" functionality hinders understanding of what the code achives in a larger picture (like inline copy&paste code), it hinders changing things because of left out generality (like half baked classes.)
In any case, I'll concede that I've failed to convince everyone that this thing is too trivial to merit a library.
Well, in fact this thing is already in a library of Boost. So already enough people had been convinced that this is worth it. I prefer a black box container that behaves like a std container and just happens to perform better in the use case at hand. Frank -----BEGIN PGP SIGNATURE----- Version: GnuPG/MacGPG2 v2.0.17 (Darwin) Comment: GPGTools - http://gpgtools.org Comment: keyserver x-hkp://pool.sks-keyservers.net iEYEARECAAYFAk88Q/gACgkQhAOUmAZhnmqczgCfel/GsWg4OyB9H8RCd4pn5bRV 3EIAoJTy/NXabpfVgi2UvQGdqqEmvPtc =SXR4 -----END PGP SIGNATURE-----