Searched refs:flat_tree (Results 1 - 3 of 3) sorted by relevance
| /third_party/gn/src/base/containers/ |
| H A D | flat_tree.h | 82 class flat_tree { class
133 flat_tree();
134 explicit flat_tree(const key_compare& comp);
137 flat_tree(InputIterator first,
142 flat_tree(const flat_tree&);
143 flat_tree(flat_tree&&) noexcept = default;
145 flat_tree(std::vector<value_type> items,
149 flat_tree(st
503 flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::flat_tree( flat_tree() function in base::internal::flat_tree
509 flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::flat_tree( flat_tree() function in base::internal::flat_tree
523 flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::flat_tree( flat_tree() function in base::internal::flat_tree
532 flat_tree<Key, Value, GetKeyFromValue, KeyCompare>::flat_tree( flat_tree() function in base::internal::flat_tree
546 const flat_tree&) -> flat_tree& = default; global() member
550 -> flat_tree& = default; global() member
[all...] |
| H A D | flat_set.h | 10 #include "base/containers/flat_tree.h"
43 // Most of the core functionality is inherited from flat_tree. Please see
44 // flat_tree.h for more details for most of these functions. As a quick
133 using flat_set = typename ::base::internal::flat_tree<
|
| H A D | flat_map.h | 12 #include "base/containers/flat_tree.h"
20 // An implementation of the flat_tree GetKeyFromValue template parameter that
57 // Most of the core functionality is inherited from flat_tree. Please see
58 // flat_tree.h for more details for most of these functions. As a quick
152 class flat_map : public ::base::internal::flat_tree<
158 using tree = typename ::base::internal::flat_tree<
209 // Normal insert() functions are inherited from flat_tree.
|
Completed in 2 milliseconds