+ Container&& container,
+ const Compare& comp = Compare())
+ : sorted_vector_map(
+ unsafe,
+ detail::as_sorted(std::move(container), value_compare(comp)),
+ comp) {}
+
+ // Construct a sorted_vector_map by stealing the storage of a prefilled
+ // container. The container must be sorted, as unsafe_t hints. This supports
+ // bulk construction of sorted_vector_map with zero allocations, not counting
+ // those performed by the caller. (The iterator range constructor performs at
+ // least one allocation).
+ //
+ // Note that `sorted_vector_map(unsafe_t, const Container& container)` is not
+ // provided, since the purpose of this constructor is to avoid an unnecessary
+ // copy.
+ sorted_vector_map(
+ unsafe_t,