QtBase
v6.3.1
|
Go to the source code of this file.
Classes | |
struct | hb_iter_t< iter_t, Item > |
struct | hb_iter_fallback_mixin_t< iter_t, item_t > |
struct | hb_iter_with_fallback_t< iter_t, item_t > |
struct | hb_is_iterator_of< Iter, Item > |
struct | hb_is_iterable< T > |
struct | hb_is_source_of< Iter, Item > |
struct | hb_is_sink_of< Iter, Item > |
struct | hb_map_iter_t< Lhs, Rhs, > |
struct | hb_map_iter_factory_t< Proj, Sorted > |
struct | hb_filter_iter_t< Iter, Pred, Proj, > |
struct | hb_filter_iter_factory_t< Pred, Proj > |
struct | hb_reduce_t< Redu, InitT > |
struct | hb_zip_iter_t< A, B > |
struct | hb_concat_iter_t< A, B > |
struct | hb_apply_t< Appl > |
struct | hb_range_iter_t< T, S > |
struct | hb_iota_iter_t< T, S > |
struct | hb_repeat_iter_t< T > |
struct | hb_sink_t< Sink > |
struct | hb_unzip_t< Sink1, Sink2 > |
Macros | |
#define | HB_ITER_USING(Name) |
#define | hb_is_iterator_of(Iter, Item) hb_is_iterator_of<Iter, Item>::value |
#define | hb_is_iterator(Iter) hb_is_iterator_of (Iter, typename Iter::item_t) |
#define | hb_is_iterable(Iterable) hb_is_iterable<Iterable>::value |
#define | hb_is_source_of(Iter, Item) hb_is_source_of<Iter, Item>::value |
#define | hb_is_sink_of(Iter, Item) hb_is_sink_of<Iter, Item>::value |
#define | hb_is_sorted_source_of(Iter, Item) (hb_is_source_of(Iter, Item) && Iter::is_sorted_iterator) |
Typedefs | |
template<typename Iterable > | |
using | hb_iter_type = decltype(hb_deref(hb_declval(Iterable)).iter()) |
template<typename Iterable > | |
using | hb_item_type = decltype(*hb_deref(hb_declval(Iterable)).iter()) |
Functions | |
struct { | |
} | HB_FUNCOBJ (hb_iter) |
template<typename T > | |
hb_iter_type< T > | operator() (T &&c) const |
template<typename Type > | |
hb_array_t< Type > | operator() (Type *array, unsigned int length) const |
template<typename Type , unsigned int length> | |
hb_array_t< Type > | operator() (Type(&array)[length]) const |
struct { | |
} | HB_FUNCOBJ (hb_len) |
template<typename T > | |
unsigned | operator() (T &&c) const |
static auto | hb_requires (hb_is_iterable(Iterable))> static inline auto end(Iterable &&iterable) HB_AUTO_RETURN(hb_iter(iterable).end()) namespace OT |
struct { | |
} | HB_FUNCOBJ (hb_map) |
template<typename Proj > | |
hb_map_iter_factory_t< Proj, hb_function_sortedness_t::NOT_SORTED > | operator() (Proj &&f) const |
struct { | |
} | HB_FUNCOBJ (hb_map_retains_sorting) |
template<typename Proj > | |
hb_map_iter_factory_t< Proj, hb_function_sortedness_t::RETAINS_SORTING > | operator() (Proj &&f) const |
struct { | |
} | HB_FUNCOBJ (hb_map_sorted) |
template<typename Proj > | |
hb_map_iter_factory_t< Proj, hb_function_sortedness_t::SORTED > | operator() (Proj &&f) const |
struct { | |
} | HB_FUNCOBJ (hb_filter) |
template<typename Pred = decltype ((hb_identity)), typename Proj = decltype ((hb_identity))> | |
hb_filter_iter_factory_t< Pred, Proj > | operator() (Pred &&p=hb_identity, Proj &&f=hb_identity) const |
struct { | |
} | HB_FUNCOBJ (hb_reduce) |
template<typename Redu , typename InitT > | |
hb_reduce_t< Redu, InitT > | operator() (Redu &&r, InitT init_value) const |
struct { | |
} | HB_FUNCOBJ (hb_zip) |
HB_PARTIALIZE (2) | |
template<typename A , typename B , hb_requires(hb_is_iterable(A) &&hb_is_iterable(B)) > | |
hb_zip_iter_t< hb_iter_type< A >, hb_iter_type< B > > | operator() (A &&a, B &&b) const |
struct { | |
} | HB_FUNCOBJ (hb_concat) |
template<typename A , typename B , hb_requires(hb_is_iterable(A) &&hb_is_iterable(B)) > | |
hb_concat_iter_t< hb_iter_type< A >, hb_iter_type< B > > | operator() (A &&a, B &&b) const |
struct { | |
} | HB_FUNCOBJ (hb_apply) |
template<typename Appl > | |
hb_apply_t< Appl > | operator() (Appl &&a) const |
template<typename Appl > | |
hb_apply_t< Appl & > | operator() (Appl *a) const |
struct { | |
} | HB_FUNCOBJ (hb_range) |
template<typename T = unsigned> | |
hb_range_iter_t< T, unsigned > | operator() (T end=(unsigned) -1) const |
template<typename T , typename S = unsigned> | |
hb_range_iter_t< T, S > | operator() (T start, T end, S step=1u) const |
struct { | |
} | HB_FUNCOBJ (hb_iota) |
template<typename T = unsigned, typename S = unsigned> | |
hb_iota_iter_t< T, S > | operator() (T start=0u, S step=1u) const |
struct { | |
} | HB_FUNCOBJ (hb_repeat) |
template<typename T > | |
hb_repeat_iter_t< T > | operator() (T value) const |
struct { | |
} | HB_FUNCOBJ (hb_enumerate) |
template<typename Iterable , typename Index = unsigned, hb_requires(hb_is_iterable(Iterable)) > | |
auto | operator() (Iterable &&it, Index start=0u) const HB_AUTO_RETURN(hb_zip(hb_iota(start) |
struct { | |
auto it unsigned count const { return array.sub_array (0, count) | |
} | HB_FUNCOBJ (hb_take) |
template<typename Iterable , hb_requires(hb_is_iterable(Iterable)) > | |
auto | operator() (Iterable &&it, unsigned count) const HB_AUTO_RETURN(hb_zip(hb_range(count) |
auto it | hb_map (hb_second)) template< typename Type > inline hb_array_t< Type > operator()(hb_array_t< Type > array |
template<typename Type > | |
hb_sorted_array_t< Type > | operator() (hb_sorted_array_t< Type > array, unsigned count) const |
struct { | |
} | HB_FUNCOBJ (hb_chop) |
template<typename Iter , hb_requires(hb_is_iterator(Iter)) > | |
auto | operator() (Iter it, unsigned count) const HB_AUTO_RETURN(+hb_iota(it |
struct { | |
} | HB_FUNCOBJ (hb_sink) |
template<typename Sink > | |
hb_sink_t< Sink > | operator() (Sink &&s) const |
template<typename Sink > | |
hb_sink_t< Sink & > | operator() (Sink *s) const |
struct { | |
} | HB_FUNCOBJ (hb_drain) |
template<typename Iter , hb_requires(hb_is_iterator(Iter)) > | |
void | operator() (Iter it) const |
struct { | |
} | HB_FUNCOBJ (hb_unzip) |
template<typename Sink1 , typename Sink2 > | |
hb_unzip_t< Sink1, Sink2 > | operator() (Sink1 &&s1, Sink2 &&s2) const |
template<typename Sink1 , typename Sink2 > | |
hb_unzip_t< Sink1 &, Sink2 & > | operator() (Sink1 *s1, Sink2 *s2) const |
struct { | |
} | HB_FUNCOBJ (hb_all) |
template<typename Iterable , typename Pred = decltype ((hb_identity)), typename Proj = decltype ((hb_identity)), hb_requires(hb_is_iterable(Iterable)) > | |
bool | operator() (Iterable &&c, Pred &&p=hb_identity, Proj &&f=hb_identity) const |
struct { | |
} | HB_FUNCOBJ (hb_any) |
struct { | |
} | HB_FUNCOBJ (hb_none) |
template<typename C , typename V , hb_requires(hb_is_iterable(C)) > | |
void | hb_fill (C &&c, const V &v) |
template<typename S , typename D > | |
void | hb_copy (S &&is, D &&id) |
Variables | |
struct hb_iter_fallback_mixin_t | HB_FUNCOBJ |
#define hb_is_iterable | ( | Iterable | ) | hb_is_iterable<Iterable>::value |
Definition at line 283 of file hb-iter.hh.
#define hb_is_iterator | ( | Iter | ) | hb_is_iterator_of (Iter, typename Iter::item_t) |
Definition at line 265 of file hb-iter.hh.
#define hb_is_iterator_of | ( | Iter, | |
Item | |||
) | hb_is_iterator_of<Iter, Item>::value |
Definition at line 264 of file hb-iter.hh.
#define hb_is_sink_of | ( | Iter, | |
Item | |||
) | hb_is_sink_of<Iter, Item>::value |
Definition at line 317 of file hb-iter.hh.
#define hb_is_sorted_source_of | ( | Iter, | |
Item | |||
) | (hb_is_source_of(Iter, Item) && Iter::is_sorted_iterator) |
Definition at line 320 of file hb-iter.hh.
#define hb_is_source_of | ( | Iter, | |
Item | |||
) | hb_is_source_of<Iter, Item>::value |
Definition at line 301 of file hb-iter.hh.
#define HB_ITER_USING | ( | Name | ) |
Definition at line 129 of file hb-iter.hh.
using hb_item_type = decltype (*hb_deref (hb_declval (Iterable)).iter ()) |
Definition at line 155 of file hb-iter.hh.
using hb_iter_type = decltype (hb_deref (hb_declval (Iterable)).iter ()) |
Definition at line 153 of file hb-iter.hh.
struct @137 HB_FUNCOBJ | ( | hb_all | ) |
struct @138 HB_FUNCOBJ | ( | hb_any | ) |
struct @127 HB_FUNCOBJ | ( | hb_apply | ) |
struct @133 HB_FUNCOBJ | ( | hb_chop | ) |
struct @126 HB_FUNCOBJ | ( | hb_concat | ) |
struct @135 HB_FUNCOBJ | ( | hb_drain | ) |
struct @131 HB_FUNCOBJ | ( | hb_enumerate | ) |
struct @123 HB_FUNCOBJ | ( | hb_filter | ) |
struct @129 HB_FUNCOBJ | ( | hb_iota | ) |
struct @118 HB_FUNCOBJ | ( | hb_iter | ) |
struct @119 HB_FUNCOBJ | ( | hb_len | ) |
struct @120 HB_FUNCOBJ | ( | hb_map | ) |
struct @121 HB_FUNCOBJ | ( | hb_map_retains_sorting | ) |
struct @122 HB_FUNCOBJ | ( | hb_map_sorted | ) |
struct @139 HB_FUNCOBJ | ( | hb_none | ) |
struct @128 HB_FUNCOBJ | ( | hb_range | ) |
struct @124 HB_FUNCOBJ | ( | hb_reduce | ) |
struct @130 HB_FUNCOBJ | ( | hb_repeat | ) |
struct @134 HB_FUNCOBJ | ( | hb_sink | ) |
struct @132 HB_FUNCOBJ | ( | hb_take | ) |
struct @136 HB_FUNCOBJ | ( | hb_unzip | ) |
struct @125 HB_FUNCOBJ | ( | hb_zip | ) |
HB_FUNCOBJ::HB_PARTIALIZE | ( | 2 | ) |
static auto hb_requires | ( | hb_is_iterable(Iterable) | ) | && |
hb_zip_iter_t<hb_iter_type<A>, hb_iter_type<B> > HB_FUNCOBJ::operator() | ( | A && | a, |
B && | b | ||
) | const |
Definition at line 3 of file hb-iter.hh.
hb_concat_iter_t<hb_iter_type<A>, hb_iter_type<B> > HB_FUNCOBJ::operator() | ( | A && | a, |
B && | b | ||
) | const |
Definition at line 3 of file hb-iter.hh.
hb_apply_t<Appl> HB_FUNCOBJ::operator() | ( | Appl && | a | ) | const |
Definition at line 1 of file hb-iter.hh.
hb_apply_t<Appl&> HB_FUNCOBJ::operator() | ( | Appl * | a | ) | const |
Definition at line 5 of file hb-iter.hh.
|
inline |
Definition at line 12 of file hb-iter.hh.
void HB_FUNCOBJ::operator() | ( | Iter | it | ) | const |
Definition at line 2 of file hb-iter.hh.
auto HB_FUNCOBJ::operator() | ( | Iter | it, |
unsigned | count | ||
) | const |
bool operator() | ( | Iterable && | c, |
Pred && | p = hb_identity , |
||
Proj && | f = hb_identity |
||
) | const |
Definition at line 4 of file hb-iter.hh.
auto HB_FUNCOBJ::operator() | ( | Iterable && | it, |
Index | start = 0u |
||
) | const |
auto HB_FUNCOBJ::operator() | ( | Iterable && | it, |
unsigned | count | ||
) | const |
hb_filter_iter_factory_t<Pred, Proj> HB_FUNCOBJ::operator() | ( | Pred && | p = hb_identity , |
Proj && | f = hb_identity |
||
) | const |
Definition at line 3 of file hb-iter.hh.
hb_map_iter_factory_t<Proj, hb_function_sortedness_t::SORTED> HB_FUNCOBJ::operator() | ( | Proj && | f | ) | const |
Definition at line 2 of file hb-iter.hh.
hb_map_iter_factory_t<Proj, hb_function_sortedness_t::RETAINS_SORTING> HB_FUNCOBJ::operator() | ( | Proj && | f | ) | const |
Definition at line 2 of file hb-iter.hh.
hb_map_iter_factory_t<Proj, hb_function_sortedness_t::NOT_SORTED> HB_FUNCOBJ::operator() | ( | Proj && | f | ) | const |
Definition at line 2 of file hb-iter.hh.
hb_reduce_t<Redu, InitT> HB_FUNCOBJ::operator() | ( | Redu && | r, |
InitT | init_value | ||
) | const |
Definition at line 2 of file hb-iter.hh.
hb_sink_t<Sink> HB_FUNCOBJ::operator() | ( | Sink && | s | ) | const |
Definition at line 1 of file hb-iter.hh.
hb_sink_t<Sink&> HB_FUNCOBJ::operator() | ( | Sink * | s | ) | const |
Definition at line 5 of file hb-iter.hh.
hb_unzip_t<Sink1, Sink2> HB_FUNCOBJ::operator() | ( | Sink1 && | s1, |
Sink2 && | s2 | ||
) | const |
Definition at line 1 of file hb-iter.hh.
hb_unzip_t<Sink1&, Sink2&> HB_FUNCOBJ::operator() | ( | Sink1 * | s1, |
Sink2 * | s2 | ||
) | const |
Definition at line 5 of file hb-iter.hh.
hb_iter_type<T> HB_FUNCOBJ::operator() | ( | T && | c | ) | const |
Definition at line 1 of file hb-iter.hh.
unsigned HB_FUNCOBJ::operator() | ( | T && | c | ) | const |
Definition at line 1 of file hb-iter.hh.
hb_range_iter_t<T, unsigned> HB_FUNCOBJ::operator() | ( | T | end = (unsigned) -1 | ) | const |
Definition at line 1 of file hb-iter.hh.
hb_range_iter_t<T, S> HB_FUNCOBJ::operator() | ( | T | start, |
T | end, | ||
S | step = 1u |
||
) | const |
Definition at line 5 of file hb-iter.hh.
hb_iota_iter_t<T, S> HB_FUNCOBJ::operator() | ( | T | start = 0u , |
S | step = 1u |
||
) | const |
Definition at line 1 of file hb-iter.hh.
hb_repeat_iter_t<T> HB_FUNCOBJ::operator() | ( | T | value | ) | const |
Definition at line 1 of file hb-iter.hh.
|
inline |
Definition at line 7 of file hb-iter.hh.
hb_array_t<Type> HB_FUNCOBJ::operator() | ( | Type(&) | array[length] | ) | const |
Definition at line 11 of file hb-iter.hh.
Definition at line 847 of file hb-iter.hh.
struct hb_unzip_t HB_FUNCOBJ |