di 0.1.0
|
Namespaces | |
namespace | erase_ns |
namespace | ring |
namespace | string |
namespace | vector |
namespace | view |
Functions | |
template<typename Out, concepts::InputContainer Con, typename... Args> requires (!concepts::View<Out> && concepts::Expected<meta::ContainerValue<Con>>) | |
constexpr auto | sequence_to (Con &&container, Args &&... args) |
template<template< typename... > typename Template, concepts::InputContainer Con, typename... Args, typename UnwrappedContainer = EmptyView<meta::ExpectedValue<meta::ContainerValue<Con>>>> requires (concepts::CreateDeducible<Template, UnwrappedContainer, Args...> || concepts::CreateDeducible<Template, FromContainer, UnwrappedContainer, Args...>) | |
constexpr auto | sequence_to (Con &&container, Args &&... args) |
template<typename Out, typename... Args> requires (!concepts::View<Out>) | |
constexpr auto | sequence_to (Args &&... args) |
template<template< typename... > typename Template, typename... Args> | |
constexpr auto | sequence_to (Args &&... args) |
template<typename Out, concepts::InputContainer Con, typename... Args> requires (!concepts::View<Out>) | |
constexpr auto | to (Con &&container, Args &&... args) |
template<template< typename... > typename Template, concepts::InputContainer Con, typename... Args> requires (concepts::CreateDeducible<Template, Con, Args...> || concepts::CreateDeducible<Template, FromContainer, Con, Args...>) | |
constexpr auto | to (Con &&container, Args &&... args) |
template<typename Out, typename... Args> requires (!concepts::View<Out>) | |
constexpr auto | to (Args &&... args) |
template<template< typename... > typename Template, typename... Args> | |
constexpr auto | to (Args &&... args) |
template<concepts::InputContainer Con, concepts::TupleLike T = meta::ContainerValue<Con>> requires (meta::TupleSize<T> == 2) | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashMap >, Con &&) -> NodeHashMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 > > |
template<concepts::InputContainer Con, concepts::TupleLike T = meta::ContainerValue<Con>, typename Eq> requires (meta::TupleSize<T> == 2) | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashMap >, Con &&, Eq) -> NodeHashMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Eq > |
template<concepts::InputContainer Con, concepts::TupleLike T = meta::ContainerValue<Con>, typename Eq, typename Hasher> requires (meta::TupleSize<T> == 2) | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashMap >, Con &&, Eq, Hasher) -> NodeHashMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Eq, Hasher > |
template<concepts::InputContainer Con, concepts::TupleLike T = meta::ContainerValue<Con>> requires (meta::TupleSize<T> == 2) | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashMultiMap >, Con &&) -> NodeHashMultiMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 > > |
template<concepts::InputContainer Con, concepts::TupleLike T = meta::ContainerValue<Con>, typename Eq> requires (meta::TupleSize<T> == 2) | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashMultiMap >, Con &&, Eq) -> NodeHashMultiMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Eq > |
template<concepts::InputContainer Con, concepts::TupleLike T = meta::ContainerValue<Con>, typename Eq, typename Hasher> requires (meta::TupleSize<T> == 2) | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashMultiMap >, Con &&, Eq, Hasher) -> NodeHashMultiMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Eq, Hasher > |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashMultiSet >, Con &&) -> NodeHashMultiSet< T > |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>, typename Eq> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashMultiSet >, Con &&, Eq) -> NodeHashMultiSet< T, Eq > |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>, typename Eq, typename Hasher> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashMultiSet >, Con &&, Eq, Hasher) -> NodeHashMultiSet< T, Eq, Hasher > |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashSet >, Con &&) -> NodeHashSet< T > |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>, typename Eq> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashSet >, Con &&, Eq) -> NodeHashSet< T, Eq > |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>, typename Eq, typename Hasher> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< NodeHashSet >, Con &&, Eq, Hasher) -> NodeHashSet< T, Eq, Hasher > |
template<typename Iter, concepts::EqualityComparableWith< Iter > U> | |
constexpr auto | operator== (MoveIterator< Iter > const &a, MoveIterator< U > const &b) -> bool |
template<typename Iter, concepts::ThreeWayComparableWith< Iter > U> | |
constexpr auto | operator<=> (MoveIterator< Iter > const &a, MoveIterator< U > const &b) |
template<typename Iter, typename U> | |
constexpr auto | operator- (MoveIterator< Iter > const &a, MoveIterator< U > const &b) -> decltype(a.base() - b.base()) |
template<concepts::InputIterator Iter> | |
constexpr auto | make_move_iterator (Iter iterator) |
template<typename Iter, concepts::EqualityComparableWith< Iter > U> | |
constexpr auto | operator== (ReverseIterator< Iter > const &a, ReverseIterator< U > const &b) -> bool |
template<typename Iter, concepts::ThreeWayComparableWith< Iter > U> | |
constexpr auto | operator<=> (ReverseIterator< Iter > const &a, ReverseIterator< U > const &b) |
template<typename Iter, typename U> | |
constexpr auto | operator- (ReverseIterator< Iter > const &a, ReverseIterator< U > const &b) -> decltype(b.base() - a.base()) |
template<concepts::BidirectionalIterator Iter> | |
constexpr auto | make_reverse_iterator (Iter iter) |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< LinkedList >, Con &&) -> LinkedList< T > |
template<concepts::Container Con, typename T = meta::ContainerValue<Con>, concepts::StrictWeakOrder< T > Comp> requires (detail::PriorityQueueCompatible<Con, T>) | |
PriorityQueue (Comp, Con) -> PriorityQueue< T, Con, Comp > | |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< PriorityQueue >, Con &&) -> PriorityQueue< T > |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>, concepts::StrictWeakOrder< T > Comp> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< PriorityQueue >, Con &&, Comp) -> PriorityQueue< T, container::Vector< T >, Comp > |
template<concepts::Container Con, typename T = meta::ContainerValue<Con>> requires (detail::QueueCompatible<Con, T>) | |
Queue (Con) -> Queue< T, Con > | |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< Queue >, Con &&) -> Queue< T > |
template<concepts::Container Con, typename T = meta::ContainerValue<Con>> requires (detail::StackCompatible<Con, T>) | |
Stack (Con) -> Stack< T, Con > | |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< Stack >, Con &&) -> Stack< T > |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< Ring >, Con &&) -> Ring< T > |
template<types::size_t size> | |
FixedString (char const (&)[size]) -> FixedString< size - 1 > | |
template<concepts::InputContainer Con, concepts::TupleLike T = meta::ContainerValue<Con>> requires (meta::TupleSize<T> == 2) | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< TreeMap >, Con &&) -> TreeMap< 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 | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< TreeMap >, Con &&, Comp) -> TreeMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Comp > |
template<concepts::InputContainer Con, concepts::TupleLike T = meta::ContainerValue<Con>> requires (meta::TupleSize<T> == 2) | |
auto | 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 | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< TreeMultiMap >, Con &&, Comp) -> TreeMultiMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Comp > |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< TreeMultiSet >, Con &&) -> TreeMultiSet< T > |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>, concepts::StrictWeakOrder< T > Comp> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< TreeMultiSet >, Con &&, Comp) -> TreeMultiSet< T, Comp > |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< TreeSet >, Con &&) -> TreeSet< T > |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>, concepts::StrictWeakOrder< T > Comp> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< TreeSet >, Con &&, Comp) -> TreeSet< T, Comp > |
template<concepts::InputContainer Con, typename T = meta::ContainerValue<Con>> | |
auto | tag_invoke (types::Tag< util::deduce_create >, InPlaceTemplate< Vector >, Con &&) -> Vector< T > |
template<typename Con> | |
AsConstView (Con &&) -> AsConstView< meta::AsView< Con > > | |
template<typename Con> | |
AsRValueView (Con &&) -> AsRValueView< meta::AsView< Con > > | |
template<typename... Cons> | |
CartesianProductView (Cons &&...) -> CartesianProductView< meta::AsView< Cons >... > | |
template<typename Con, typename Pred> | |
ChunkByView (Con &&, Pred) -> ChunkByView< meta::AsView< Con >, Pred > | |
template<typename Con> | |
ChunkView (Con &&, meta::ContainerSSizeType< Con >) -> ChunkView< meta::AsView< Con > > | |
template<typename Con> | |
CommonView (Con &&) -> CommonView< meta::AsView< Con > > | |
template<typename... Cons> | |
ConcatView (Cons &&...) -> ConcatView< meta::AsView< Cons >... > | |
template<typename Con> | |
CycleView (Con &&) -> CycleView< meta::AsView< Con > > | |
template<typename Con> | |
DropView (Con &&, meta::ContainerSSizeType< Con >) -> DropView< meta::AsView< Con > > | |
template<typename Con, typename Pred> | |
DropWhileView (Con &&, Pred) -> DropWhileView< meta::AsView< Con >, Pred > | |
template<typename Con> | |
EnumerateView (Con &&) -> EnumerateView< meta::AsView< Con > > | |
template<typename Con, typename Pred> | |
FilterView (Con &&, Pred) -> FilterView< meta::AsView< Con >, Pred > | |
template<typename T, typename Bound> requires (!concepts::Integer<T> || !concepts::Integer<Bound> || concepts::SignedInteger<T> == concepts::SignedInteger<Bound>) | |
IotaView (T, Bound) -> IotaView< T, Bound > | |
template<typename Con> | |
JoinView (Con &&) -> JoinView< meta::AsView< Con > > | |
template<typename Con, typename Pattern> | |
JoinWithView (Con &&, Pattern &&) -> JoinWithView< meta::AsView< Con >, meta::AsView< Pattern > > | |
template<concepts::InputContainer Con> | |
JoinWithView (Con &&, meta::ContainerValue< meta::ContainerReference< Con > >) -> JoinWithView< meta::AsView< Con >, SingleView< meta::ContainerValue< meta::ContainerReference< Con > > > > | |
template<typename Cont> | |
RefView (Cont &) -> RefView< Cont > | |
template<typename T, typename Bound> | |
RepeatView (T, Bound) -> RepeatView< T, Bound > | |
template<typename Con> | |
ReverseView (Con &&) -> ReverseView< meta::AsView< Con > > | |
template<typename T> | |
SingleView (T) -> SingleView< T > | |
template<typename Con> | |
SlideView (Con &&, meta::ContainerSSizeType< Con >) -> SlideView< meta::AsView< Con > > | |
template<typename Con, typename Pattern> | |
SplitView (Con &&, Pattern &&) -> SplitView< meta::AsView< Con >, meta::AsView< Pattern > > | |
template<concepts::InputContainer Con> | |
SplitView (Con &&, meta::ContainerValue< Con >) -> SplitView< meta::AsView< Con >, SingleView< meta::ContainerValue< Con > > > | |
template<typename Con> | |
StrideView (Con &&, meta::ContainerSSizeType< Con >) -> StrideView< meta::AsView< Con > > | |
template<typename Con> | |
TakeView (Con &&, meta::ContainerSSizeType< Con >) -> TakeView< meta::AsView< Con > > | |
template<typename Con, typename Pred> | |
TakeWhileView (Con &&, Pred) -> TakeWhileView< meta::AsView< Con >, Pred > | |
template<typename Con, typename F> | |
TransformView (Con &&, F) -> TransformView< meta::AsView< Con >, F > | |
template<concepts::Iterator Iter, concepts::SentinelFor< Iter > Sent> | |
View (Iter, Sent) -> View< Iter, Sent > | |
template<concepts::Iterator Iter, concepts::SentinelFor< Iter > Sent> | |
View (Iter, Sent, meta::IteratorSizeType< Iter >) -> View< Iter, Sent, true > | |
template<concepts::BorrowedContainer Cont> | |
View (Cont &&) -> View< meta::ContainerIterator< Cont >, meta::ContainerSentinel< Cont >, concepts::SizedContainer< Cont >||concepts::SizedSentinelFor< meta::ContainerSentinel< Cont >, meta::ContainerIterator< Cont > > > | |
template<concepts::BorrowedContainer Cont> | |
View (Cont &&, meta::ContainerSizeType< Cont >) -> View< meta::ContainerIterator< Cont >, meta::ContainerSentinel< Cont >, true > | |
template<class F, class... Cons> | |
ZipTransformView (F, Cons &&...) -> ZipTransformView< F, meta::AsView< Cons >... > | |
template<typename... Cons> | |
ZipView (Cons &&...) -> ZipView< meta::AsView< Cons >... > | |
Variables | |
constexpr auto | sequence = function::curry_back(detail::SequenceFunction {}, meta::c_<2ZU>) |
constexpr auto | adjacent_find = detail::AdjacentFindFunction {} |
constexpr auto | all_of = detail::AllOfFunction {} |
constexpr auto | any_of = detail::AnyOfFunction {} |
constexpr auto | binary_search = detail::BinarySearchFunction {} |
constexpr auto | compare = detail::CompareFunction {} |
constexpr auto | contains = detail::ContainsFunction {} |
constexpr auto | contains_subrange = detail::ContainsSubrangeFunction {} |
constexpr auto | copy = detail::CopyFunction {} |
constexpr auto | copy_backward = detail::CopyBackwardFunction {} |
constexpr auto | copy_if = detail::CopyIfFunction {} |
constexpr auto | copy_n = detail::CopyNFunction {} |
constexpr auto | count = detail::CountFunction {} |
constexpr auto | count_if = detail::CountIfFunction {} |
constexpr auto | destroy = detail::DestroyFunction {} |
constexpr auto | destroy_n = detail::DestroyNFunction {} |
constexpr auto | ends_with = detail::EndsWithFunction {} |
constexpr auto | equal = detail::EqualFunction {} |
constexpr auto | equal_range = detail::EqualRangeFunction {} |
constexpr auto | fill = detail::FillFunction {} |
constexpr auto | fill_n = detail::FillNFunction {} |
constexpr auto | find = detail::FindFunction {} |
constexpr auto | find_end = detail::FindEndFunction {} |
constexpr auto | find_first_not_of = detail::FindFirstNotOfFunction {} |
constexpr auto | find_first_of = detail::FindFirstOfFunction {} |
constexpr auto | find_if = detail::FindIfFunction {} |
constexpr auto | find_if_not = detail::FindIfNotFunction {} |
constexpr auto | find_last = detail::FindLastFunction {} |
constexpr auto | find_last_if = detail::FindLastIfFunction {} |
constexpr auto | find_last_if_not = detail::FindLastIfNotFunction {} |
constexpr auto | find_last_not_of = detail::FindLastNotOfFunction {} |
constexpr auto | find_last_of = detail::FindLastOfFunction {} |
constexpr auto | fold_left = function::curry_back(detail::FoldLeftFunction {}, meta::c_<3ZU>) |
constexpr auto | fold_left_first = function::curry_back(detail::FoldLeftFirstFunction {}, meta::c_<2ZU>) |
constexpr auto | fold_left_first_with_iter = detail::FoldLeftFirstWithIterFunction {} |
constexpr auto | fold_left_with_iter = detail::FoldLeftWithIterFunction {} |
constexpr auto | fold_right = detail::FoldRightFunction {} |
constexpr auto | fold_right_last = detail::FoldRightLastFunction {} |
constexpr auto | for_each = detail::ForEachFunction {} |
constexpr auto | for_each_n = detail::ForEachNFunction {} |
constexpr auto | generate = detail::GenerateFunction {} |
constexpr auto | generate_n = detail::GenerateNFunction {} |
constexpr auto | includes = detail::IncludesFunction {} |
constexpr auto | iota = detail::IotaFunction {} |
constexpr auto | is_heap = detail::IsHeapFunction {} |
constexpr auto | is_heap_until = detail::IsHeapUntilFunction {} |
constexpr auto | is_partitioned = detail::IsPartitionedFunction {} |
constexpr auto | is_permutation = detail::IsPermutationFunction {} |
constexpr auto | is_sorted = detail::IsSortedFunction {} |
constexpr auto | is_sorted_until = detail::IsSortedUntilFunction {} |
constexpr auto | lower_bound = detail::LowerBoundFunction {} |
constexpr auto | make_heap = detail::MakeHeapFunction {} |
constexpr auto | max = detail::MaxFunction {} |
constexpr auto | max_element = detail::MaxElementFunction {} |
constexpr auto | merge = detail::MergeFunction {} |
constexpr auto | min = detail::MinFunction {} |
constexpr auto | min_element = detail::MinElementFunction {} |
constexpr auto | minmax = detail::MinMaxFunction {} |
constexpr auto | minmax_element = detail::MinMaxElementFunction {} |
constexpr auto | mismatch = detail::MismatchFunction {} |
constexpr auto | move = detail::MoveFunction {} |
constexpr auto | move_backward = detail::MoveBackwardFunction {} |
constexpr auto | next_permutation = detail::NextPermutationFunction {} |
constexpr auto | none_of = detail::NoneOfFunction {} |
constexpr auto | partition = detail::PartitionFunction {} |
constexpr auto | partition_copy = detail::PartitionCopyFunction {} |
constexpr auto | partition_point = detail::PartitionPointFunction {} |
constexpr auto | pop_heap = detail::PopHeapFunction {} |
constexpr auto | prev_permutation = detail::PrevPermutationFunction {} |
constexpr auto | product = detail::ProductFunction {} |
constexpr auto | push_heap = detail::PushHeapFunction {} |
constexpr auto | remove = detail::RemoveFunction {} |
constexpr auto | remove_copy = detail::RemoveCopyFunction {} |
constexpr auto | remove_copy_if = detail::RemoveCopyIfFunction {} |
constexpr auto | remove_if = detail::RemoveIfFunction {} |
constexpr auto | replace = detail::ReplaceFunction {} |
constexpr auto | replace_copy = detail::ReplaceCopyFunction {} |
constexpr auto | replace_copy_if = detail::ReplaceCopyIfFunction {} |
constexpr auto | replace_if = detail::ReplaceIfFunction {} |
constexpr auto | reverse = detail::ReverseFunction {} |
constexpr auto | reverse_copy = detail::ReverseCopyFunction {} |
constexpr auto | rotate = detail::RotateFunction {} |
constexpr auto | rotate_copy = detail::RotateCopyFunction {} |
constexpr auto | sample = detail::SampleFunction {} |
constexpr auto | search = detail::SearchFunction {} |
constexpr auto | search_n = detail::SearchNFunction {} |
constexpr auto | set_difference = detail::SetDifferenceFunction {} |
constexpr auto | set_intersection = detail::SetIntersectionFunction {} |
constexpr auto | set_symmetric_difference = detail::SetSymmetricDifferenceFunction {} |
constexpr auto | set_union = detail::SetUnionFunction {} |
constexpr auto | shift_left = detail::ShiftLeftFunction {} |
constexpr auto | shift_right = detail::ShiftRightFunction {} |
constexpr auto | shuffle = detail::ShuffleFunction {} |
constexpr auto | sort = detail::SortFunction {} |
constexpr auto | sort_heap = detail::SortHeapFunction {} |
constexpr auto | stable_partition = detail::StablePartitionFunction {} |
constexpr auto | starts_with = detail::StartsWithFunction {} |
constexpr auto | sum = detail::SumFunction {} |
constexpr auto | swap_ranges = detail::SwapRanges {} |
constexpr auto | transform = detail::TransformFunction {} |
constexpr auto | uninitialized_copy = detail::UninitializedCopyFunction {} |
constexpr auto | uninitialized_copy_n = detail::UninitializedCopyNFunction {} |
constexpr auto | uninitialized_default_construct = detail::UninitializedDefaultConstructFunction {} |
constexpr auto | uninitialized_default_construct_n = detail::UninitializedDefaultConstructNFunction {} |
constexpr auto | uninitialized_fill = detail::UninitializedFillFunction {} |
constexpr auto | uninitialized_fill_n = detail::UninitializedFillNFunction {} |
constexpr auto | uninitialized_move = detail::UninitializedMoveFunction {} |
constexpr auto | uninitialized_move_n = detail::UninitializedMoveNFunction {} |
constexpr auto | uninitialized_relocate = detail::UninitializedRelocateFunction {} |
constexpr auto | uninitialized_relocate_backwards = detail::UninitializedRelocateBackwardsFunction {} |
constexpr auto | uninitialized_value_construct = detail::UninitializedValueConstructFunction {} |
constexpr auto | uninitialized_value_construct_n = detail::UninitializedValueConstructNFunction {} |
constexpr auto | unique = detail::UniqueFunction {} |
constexpr auto | unique_copy = detail::UniqueCopyFunction {} |
constexpr auto | upper_bound = detail::UpperBoundFunction {} |
constexpr auto | allocate = detail::AllocateFunction {} |
template<typename T> | |
constexpr auto | allocate_many = detail::AllocateManyFunction<T> {} |
template<typename T> | |
constexpr auto | allocate_one = detail::AllocateOneFunction<T> {} |
constexpr auto | deallocate = detail::DeallocateFunction {} |
template<typename T> | |
constexpr auto | deallocate_many = detail::DeallocateManyFunction<T> {} |
template<typename T> | |
constexpr auto | deallocate_one = detail::DeallocateOneFunction<T> {} |
constexpr auto | fail_allocator = FailAllocator {} |
constexpr auto | hash = detail::HashFunction {} |
constexpr auto | hash_same = detail::HashSameFunction {} |
constexpr auto | hash_write = detail::HashWriteFunction {} |
constexpr auto | front = detail::FrontFunction {} |
constexpr auto | back = detail::BackFunction {} |
constexpr auto | at = di::curry_back(detail::AtFunction {}, c_<2ZU>) |
constexpr auto | front_unchecked = detail::FrontUncheckedFunction {} |
constexpr auto | back_unchecked = detail::BackUncheckedFunction {} |
constexpr auto | at_unchecked = di::curry_back(detail::AtUncheckedFunction {}, c_<2ZU>) |
constexpr auto | begin = BeginFunction {} |
constexpr auto | cbegin = CBeginFunction {} |
constexpr auto | cdata = CDataFunction {} |
constexpr auto | cend = CEndFunction {} |
constexpr auto | crbegin = CRBeginFunction {} |
constexpr auto | crend = CREndFunction {} |
constexpr auto | data = DataFunction {} |
constexpr auto | empty = EmptyFunction {} |
constexpr struct di::container::EnableBorrowedContainer | enable_borrowed_container |
constexpr struct di::container::EnableViewFunction | enable_view |
constexpr auto | end = EndFunction {} |
constexpr auto | erase = erase_ns::EraseFunction {} |
constexpr auto | erase_if = erase_ns::EraseIfFunction {} |
constexpr auto | rbegin = RBeginFunction {} |
constexpr auto | reconstruct = ReconstructFunction {} |
constexpr auto | rend = REndFunction {} |
constexpr auto | size = SizeFunction {} |
constexpr auto | ssize = SSizeFunction {} |
constexpr auto | advance = AdvanceFunction {} |
constexpr auto | default_sentinel = DefaultSentinel {} |
constexpr auto | distance = detail::DistanceFunction {} |
constexpr struct di::container::IteratorCategoryFunction | iterator_category |
constexpr auto | iterator_move = detail::IteratorMoveFunction {} |
constexpr struct di::container::IteratorSSizeTypeFunction | iterator_ssize_type |
constexpr auto | iterator_swap = detail::IteratorSwapFunction {} |
constexpr struct di::container::IteratorValueFunction | iterator_value |
constexpr auto | next = NextFunction {} |
constexpr auto | prev = PrevFunction {} |
constexpr auto | unreachable_sentinel = UnreachableSentinel {} |
constexpr auto | into_erased_string = detail::IntoErasedStringFunction {} |
constexpr auto | fixed_string_concat = detail::FixedStringConcat {} |
template<FixedString literal> | |
constexpr auto | fixed_string_to_utf8_string_view = detail::FixedStringToUtf8StringViewFunction<literal> {} |
using di::container::IntrusiveHashSetNode = HashNode<Tag> |
using di::container::IntrusiveTreeSetNode = RBTreeNode<Tag> |
using di::container::KeysView = ElementsView<Con, 0> |
using di::container::MoveBackwardResult = InOutResult<In, Out> |
using di::container::MoveResult = InOutResult<In, Out> |
using di::container::Path = PathImpl<TransparentString> |
using di::container::StdAllocator = std::allocator<T> |
using di::container::UninitializedRelocateBackwardsResult = container::InOutResult<In, Out> |
using di::container::UninitializedRelocateResult = container::InOutResult<In, Out> |
using di::container::Utf8Path = PathImpl<String> |
using di::container::ValuesView = ElementsView<Con, 1> |
using di::container::ZC16CString = ZStringImpl<c16 const> |
using di::container::ZC16String = ZStringImpl<c16> |
using di::container::ZC32CString = ZStringImpl<c32 const> |
using di::container::ZC32String = ZStringImpl<c32> |
using di::container::ZC8CString = ZStringImpl<c8 const> |
using di::container::ZC8String = ZStringImpl<c8> |
using di::container::ZCString = ZStringImpl<char const> |
using di::container::ZCUString = ZStringImpl<unsigned char const> |
using di::container::ZCWString = ZStringImpl<wchar_t const> |
using di::container::ZString = ZStringImpl<char> |
using di::container::ZUString = ZStringImpl<unsigned char> |
using di::container::ZWString = ZStringImpl<wchar_t> |
di::container::AsConstView | ( | Con && | ) | -> AsConstView< meta::AsView< Con > > |
di::container::AsRValueView | ( | Con && | ) | -> AsRValueView< meta::AsView< Con > > |
di::container::CartesianProductView | ( | Cons && | ... | ) | -> CartesianProductView< meta::AsView< Cons >... > |
di::container::ChunkByView | ( | Con && | , |
Pred | ) -> ChunkByView< meta::AsView< Con >, Pred > |
di::container::ChunkView | ( | Con && | , |
meta::ContainerSSizeType< Con > | ) -> ChunkView< meta::AsView< Con > > |
di::container::CommonView | ( | Con && | ) | -> CommonView< meta::AsView< Con > > |
di::container::ConcatView | ( | Cons && | ... | ) | -> ConcatView< meta::AsView< Cons >... > |
di::container::CycleView | ( | Con && | ) | -> CycleView< meta::AsView< Con > > |
di::container::DropView | ( | Con && | , |
meta::ContainerSSizeType< Con > | ) -> DropView< meta::AsView< Con > > |
di::container::DropWhileView | ( | Con && | , |
Pred | ) -> DropWhileView< meta::AsView< Con >, Pred > |
di::container::EnumerateView | ( | Con && | ) | -> EnumerateView< meta::AsView< Con > > |
di::container::FilterView | ( | Con && | , |
Pred | ) -> FilterView< meta::AsView< Con >, Pred > |
di::container::FixedString | ( | char | const(&)[size] | ) | -> FixedString< size - 1 > |
di::container::IotaView | ( | T | , |
Bound | ) -> IotaView< T, Bound > |
|
explicit |
di::container::JoinWithView | ( | Con && | , |
meta::ContainerValue< meta::ContainerReference< Con > > | ) -> JoinWithView< meta::AsView< Con >, SingleView< meta::ContainerValue< meta::ContainerReference< Con > > > > |
di::container::JoinWithView | ( | Con && | , |
Pattern && | ) -> JoinWithView< meta::AsView< Con >, meta::AsView< Pattern > > |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
di::container::PriorityQueue | ( | Comp | , |
Con | ) -> PriorityQueue< T, Con, Comp > |
di::container::Queue | ( | Con | ) | -> Queue< T, Con > |
di::container::RefView | ( | Cont & | ) | -> RefView< Cont > |
di::container::RepeatView | ( | T | , |
Bound | ) -> RepeatView< T, Bound > |
di::container::ReverseView | ( | Con && | ) | -> ReverseView< meta::AsView< Con > > |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
di::container::SingleView | ( | T | ) | -> SingleView< T > |
di::container::SlideView | ( | Con && | , |
meta::ContainerSSizeType< Con > | ) -> SlideView< meta::AsView< Con > > |
di::container::SplitView | ( | Con && | , |
meta::ContainerValue< Con > | ) -> SplitView< meta::AsView< Con >, SingleView< meta::ContainerValue< Con > > > |
di::container::SplitView | ( | Con && | , |
Pattern && | ) -> SplitView< meta::AsView< Con >, meta::AsView< Pattern > > |
di::container::Stack | ( | Con | ) | -> Stack< T, Con > |
di::container::StrideView | ( | Con && | , |
meta::ContainerSSizeType< Con > | ) -> StrideView< meta::AsView< Con > > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< LinkedList > | , | ||
Con && | ) -> LinkedList< T > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< NodeHashMap > | , | ||
Con && | ) -> NodeHashMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 > > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< NodeHashMap > | , | ||
Con && | , | ||
Eq | ) -> NodeHashMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Eq > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< NodeHashMap > | , | ||
Con && | , | ||
Eq | , | ||
Hasher | ) -> NodeHashMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Eq, Hasher > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< NodeHashMultiMap > | , | ||
Con && | ) -> NodeHashMultiMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 > > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< NodeHashMultiMap > | , | ||
Con && | , | ||
Eq | ) -> NodeHashMultiMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Eq > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< NodeHashMultiMap > | , | ||
Con && | , | ||
Eq | , | ||
Hasher | ) -> NodeHashMultiMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Eq, Hasher > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< NodeHashMultiSet > | , | ||
Con && | ) -> NodeHashMultiSet< T > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< NodeHashMultiSet > | , | ||
Con && | , | ||
Eq | ) -> NodeHashMultiSet< T, Eq > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< NodeHashMultiSet > | , | ||
Con && | , | ||
Eq | , | ||
Hasher | ) -> NodeHashMultiSet< T, Eq, Hasher > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< NodeHashSet > | , | ||
Con && | ) -> NodeHashSet< T > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< NodeHashSet > | , | ||
Con && | , | ||
Eq | ) -> NodeHashSet< T, Eq > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< NodeHashSet > | , | ||
Con && | , | ||
Eq | , | ||
Hasher | ) -> NodeHashSet< T, Eq, Hasher > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< PriorityQueue > | , | ||
Con && | ) -> PriorityQueue< T > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< PriorityQueue > | , | ||
Con && | , | ||
Comp | ) -> PriorityQueue< T, container::Vector< T >, Comp > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< Queue > | , | ||
Con && | ) -> Queue< T > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< Ring > | , | ||
Con && | ) -> Ring< T > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< Stack > | , | ||
Con && | ) -> Stack< T > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< TreeMap > | , | ||
Con && | ) -> TreeMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 > > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< TreeMap > | , | ||
Con && | , | ||
Comp | ) -> TreeMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Comp > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< TreeMultiMap > | , | ||
Con && | ) -> TreeMultiMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 > > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< TreeMultiMap > | , | ||
Con && | , | ||
Comp | ) -> TreeMultiMap< meta::TupleElement< T, 0 >, meta::TupleElement< T, 1 >, Comp > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< TreeMultiSet > | , | ||
Con && | ) -> TreeMultiSet< T > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< TreeMultiSet > | , | ||
Con && | , | ||
Comp | ) -> TreeMultiSet< T, Comp > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< TreeSet > | , | ||
Con && | ) -> TreeSet< T > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< TreeSet > | , | ||
Con && | , | ||
Comp | ) -> TreeSet< T, Comp > |
auto di::container::tag_invoke | ( | types::Tag< util::deduce_create > | , |
InPlaceTemplate< Vector > | , | ||
Con && | ) -> Vector< T > |
di::container::TakeView | ( | Con && | , |
meta::ContainerSSizeType< Con > | ) -> TakeView< meta::AsView< Con > > |
di::container::TakeWhileView | ( | Con && | , |
Pred | ) -> TakeWhileView< meta::AsView< Con >, Pred > |
|
constexpr |
|
constexpr |
|
constexpr |
|
constexpr |
di::container::TransformView | ( | Con && | , |
F | ) -> TransformView< meta::AsView< Con >, F > |
di::container::View | ( | Cont && | ) | -> View< meta::ContainerIterator< Cont >, meta::ContainerSentinel< Cont >, concepts::SizedContainer< Cont >||concepts::SizedSentinelFor< meta::ContainerSentinel< Cont >, meta::ContainerIterator< Cont > > > |
di::container::View | ( | Cont && | , |
meta::ContainerSizeType< Cont > | ) -> View< meta::ContainerIterator< Cont >, meta::ContainerSentinel< Cont >, true > |
di::container::View | ( | Iter | , |
Sent | ) -> View< Iter, Sent > |
di::container::View | ( | Iter | , |
Sent | , | ||
meta::IteratorSizeType< Iter > | ) -> View< Iter, Sent, true > |
di::container::ZipTransformView | ( | F | , |
Cons && | ... ) -> ZipTransformView< F, meta::AsView< Cons >... > |
di::container::ZipView | ( | Cons && | ... | ) | -> ZipView< meta::AsView< Cons >... > |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
struct di::container::EnableBorrowedContainer di::container::enable_borrowed_container |
struct di::container::EnableViewFunction di::container::enable_view |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
struct di::container::IteratorCategoryFunction di::container::iterator_category |
|
inlineconstexpr |
struct di::container::IteratorSSizeTypeFunction di::container::iterator_ssize_type |
|
inlineconstexpr |
struct di::container::IteratorValueFunction di::container::iterator_value |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |
|
inlineconstexpr |