Lines Matching refs:Value
30 typename std::iterator_traits<Iterator>::iterator_category>::value;
73 // The use of "value" in this is like std::map uses, meaning it's the thing
75 // things are looked up. In the case of a set, Key == Value. In the case of
76 // a map, the Key is a component of a Value.
79 // value for comparison purposes. It should implement:
80 // const Key& operator()(const Value&).
81 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
84 using underlying_type = std::vector<Value>;
92 using value_type = Value;
353 // Helper class for e.g. lower_bound that can compare a value on the left
493 conditional<IsTransparentCompare<key_compare>::value, K, key_type>::type;
499 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
500 flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::flat_tree() = default;
502 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
503 flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::flat_tree(
507 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
509 flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::flat_tree(
518 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
519 flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::flat_tree(
522 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
523 flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::flat_tree(
531 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
532 flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::flat_tree(
538 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
539 flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::~flat_tree() = default;
544 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
545 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::operator=(
548 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
549 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::operator=(flat_tree &&)
552 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
553 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::operator=(
563 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
564 void flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::reserve(
569 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
570 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::capacity() const
575 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
576 void flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::shrink_to_fit() {
583 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
584 void flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::clear() {
588 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
589 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::size() const
594 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
595 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::max_size() const
600 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
601 bool flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::empty() const {
608 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
609 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::begin() -> iterator {
613 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
614 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::begin() const
619 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
620 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::cbegin() const
625 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
626 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::end() -> iterator {
630 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
631 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::end() const
636 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
637 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::cend() const
642 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
643 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::rbegin()
648 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
649 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::rbegin() const
654 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
655 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::crbegin() const
660 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
661 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::rend()
666 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
667 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::rend() const
672 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
673 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::crend() const
684 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
685 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::insert(
690 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
691 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::insert(
696 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
697 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::insert(
704 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
705 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::insert(
713 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
715 void flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::insert(
777 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
779 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::emplace(Args&&... args)
784 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
786 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::emplace_hint(
795 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
796 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::erase(
801 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
802 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::erase(
807 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
809 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::erase(const K& val)
817 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
818 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::erase(
827 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
828 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::key_comp() const
833 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
834 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::value_comp() const
842 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
844 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::count(
850 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
852 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::find(const K& key)
857 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
859 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::find(
865 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
867 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::equal_range(
873 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
875 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::equal_range(
886 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
888 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::lower_bound(
893 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
895 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::lower_bound(
897 static_assert(std::is_convertible<const KeyTypeOrK<K>&, const K&>::value,
907 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
909 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::upper_bound(
914 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
916 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::upper_bound(
918 static_assert(std::is_convertible<const KeyTypeOrK<K>&, const K&>::value,
931 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
932 void flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::swap(
937 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
939 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::unsafe_emplace(
945 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
947 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::emplace_key_args(
956 template <class Key, class Value, class GetKeyFromValue, class KeyCompare>
958 auto flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::emplace_hint_key_args(
977 // For containers like sets, the key is the same as the value. This implements
991 class Value,
995 void EraseIf(base::internal::flat_tree<Key, Value, GetKeyFromValue, KeyCompare>&
