#include "di/container/allocator/allocator.h"#include "di/container/allocator/fallible_allocator.h"#include "di/container/allocator/infallible_allocator.h"#include "di/container/associative/map_interface.h"#include "di/container/concepts/prelude.h"#include "di/container/tree/rb_tree.h"#include "di/container/tree/tree_map.h"#include "di/container/view/transform.h"#include "di/function/compare.h"#include "di/platform/prelude.h"#include "di/util/deduce_create.h"#include "di/vocab/optional/prelude.h"Go to the source code of this file.
Classes | |
| class | di::container::TreeMultiMap< Key, Value, Comp, Alloc > |
| class | di::TreeMultiMap< Key, Value, Comp, Alloc > |
Namespaces | |
| namespace | di |
| namespace | di::container |
Functions | |
| template<concepts::InputContainer Con, concepts::TupleLike T = meta::ContainerValue<Con>> requires (meta::TupleSize<T> == 2) | |
| auto | di::container::tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< TreeMultiMap >, Con &&) -> TreeMultiMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 > > |
| template<concepts::InputContainer Con, concepts::TupleLike T = meta::ContainerValue<Con>, concepts::StrictWeakOrder< T > Comp> requires (meta::TupleSize<T> == 2) | |
| auto | di::container::tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< TreeMultiMap >, Con &&, Comp) -> TreeMultiMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Comp > |