Subject: Re: [boost] Offering sorted_vector for Boost, any interest?
From: Frank Birbacher (bloodymir.crap_at_[hidden])
Date: 2012-02-15 18:47:04
-----BEGIN PGP SIGNED MESSAGE-----
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.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG/MacGPG2 v2.0.17 (Darwin)
Comment: GPGTools - http://gpgtools.org
Comment: keyserver x-hkp://pool.sks-keyservers.net
-----END PGP SIGNATURE-----
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk