id,summary,reporter,owner,description,type,status,milestone,component,version,severity,resolution,keywords,cc 12117,flat_set constructor with ordered_unique_range,dariomt@…,Ion Gaztañaga,"I would expect that the constructors taking a ordered_unique_range_t would assert that the passed range indeed is sorted and unique according to the sorting criteria of the flat_set. e.g. I'd expect the following code to assert, but instead it prints 0 {{{ #include #include using namespace std; using namespace boost::container; int main() { auto l = {3, 2, 1}; flat_set s (ordered_unique_range, l); cout << s.count(1) << endl; } }}} I think the constructor should use std::is_sorted (or the Boost equivalent) to assert that the passed range indeed meets the specified ordered_unique_range. std::is_sorted has complexity Linear in N, so with this change these constructors would keep their current complexity (which is also Linear in N) even when NDEBUG is not #defined.",Feature Requests,closed,To Be Determined,container,Boost 1.61.0,Not Applicable,fixed,,igaztanaga@…