Subject: Re: [boost] [flat_set] When to sort?
From: degski (degski_at_[hidden])
Date: 2017-03-27 21:41:57
On 27 March 2017 at 15:29, Tim Keitt via Boost <boost_at_[hidden]>
wrote:
> Is it not a better solution to create an
> algorithm library that operates on sorted ranges (ordered_insert,
> binary_search, etc)?
You're in luck, it's already done, a library a.k.a STL
<http://en.cppreference.com/w/cpp/algorithm>.