Lines Matching defs:val
218 std::pair<iterator, bool> insert(const value_type& val);
219 std::pair<iterator, bool> insert(value_type&& val);
387 // std::map::insert_or_assign(const K&, V&&). It inserts val if an equivalent
392 std::pair<iterator, bool> insert_or_assign(V&& val) {
393 auto position = lower_bound(GetKeyFromValue()(val));
395 if (position == end() || value_comp()(val, *position))
396 return {impl_.body_.emplace(position, std::forward<V>(val)), true};
398 *position = std::forward<V>(val);
404 // - In case no equivalent element is found, val is appended to the end of the
410 V&& val) {
411 auto position = std::lower_bound(first, last, val, value_comp());
413 if (position == last || value_comp()(val, *position)) {
417 impl_.body_.emplace_back(std::forward<V>(val));
421 *position = std::forward<V>(val);
427 // - In case no equivalent element is found, val is appended to the end of the
433 V&& val) {
434 auto position = std::lower_bound(first, last, val, value_comp());
436 if (position == last || value_comp()(val, *position)) {
440 impl_.body_.emplace_back(std::forward<V>(val));
686 const value_type& val) -> std::pair<iterator, bool> {
687 return emplace_key_args(GetKeyFromValue()(val), val);
692 value_type&& val) -> std::pair<iterator, bool> {
693 return emplace_key_args(GetKeyFromValue()(val), std::move(val));
699 const value_type& val) -> iterator {
700 return emplace_hint_key_args(position_hint, GetKeyFromValue()(val), val)
707 value_type&& val) -> iterator {
708 return emplace_hint_key_args(position_hint, GetKeyFromValue()(val),
709 std::move(val))
809 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::erase(const K& val)
811 auto eq_range = equal_range(val);