Home
last modified time | relevance | path

Searched refs:_Size (Results 1 – 25 of 32) sorted by relevance

12

/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Dhash.h39 _Size __r; in __loadword()
47 template <class _Size, size_t = sizeof(_Size) * __CHAR_BIT__>
60 _Size __k = std::__loadword<_Size>(__data);
103 _Size __x = std::__loadword<_Size>(__s + __len - 40);
104 _Size __y = std::__loadword<_Size>(__s + __len - 16) + std::__loadword<_Size>(__s + __len - 56);
159 const _Size __a = std::__loadword<_Size>(__s);
185 const _Size __a = std::__loadword<_Size>(__s) * __k1;
186 const _Size __b = std::__loadword<_Size>(__s + 8);
196 __weak_hash_len_32_with_seeds(_Size __w, _Size __x, _Size __y, _Size __z, _Size __a, _Size __b) {
203 return pair<_Size, _Size>(__a + __z, __b + __c);
[all …]
/freebsd/contrib/llvm-project/libcxx/include/
H A Dbitset254 size_t __sz = _Size;
426 template <size_t _Size>
483 template <size_t _Size>
609 : private __bitset<_Size == 0 ? 0 : (_Size - 1) / (sizeof(size_t) * CHAR_BIT) + 1, _Size> {
779 if (__pos >= _Size)
794 if (__pos >= _Size)
816 if (__pos >= _Size)
888 if (__pos >= _Size)
922 operator&(const bitset<_Size>& __x, const bitset<_Size>& __y) _NOEXCEPT {
930 operator|(const bitset<_Size>& __x, const bitset<_Size>& __y) _NOEXCEPT {
[all …]
H A Darray167 template <class _Tp, size_t _Size>
183 _Tp __elems_[_Size];
229 return _Size == 0;
243 if (__n >= _Size)
249 if (__n >= _Size)
258 return (*this)[_Size - 1];
382 template <class _Tp, size_t _Size>
384 operator==(const array<_Tp, _Size>& __x, const array<_Tp, _Size>& __y) {
390 template <class _Tp, size_t _Size>
395 template <class _Tp, size_t _Size>
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__type_traits/
H A Dtype_list.h27 template <class _TypeList, size_t _Size, bool = _Size <= sizeof(typename _TypeList::_Head)>
30 template <class _Hp, class _Tp, size_t _Size>
31 struct __find_first<__type_list<_Hp, _Tp>, _Size, true> {
35 template <class _Hp, class _Tp, size_t _Size>
36 struct __find_first<__type_list<_Hp, _Tp>, _Size, false> {
37 typedef _LIBCPP_NODEBUG typename __find_first<_Tp, _Size>::type type;
/freebsd/contrib/llvm-project/libcxx/include/__concepts/
H A Dswappable.h58 template <class _Tp, class _Up, size_t _Size>
60 !__unqualified_swappable_with<_Tp (&)[_Size], _Up (&)[_Size]> &&
62 requires(_Tp (&__t)[_Size], _Up (&__u)[_Size], const __fn& __swap) {
82 template <class _Tp, class _Up, size_t _Size>
83 requires __swappable_arrays<_Tp, _Up, _Size>
84 _LIBCPP_HIDE_FROM_ABI constexpr void operator()(_Tp (&__t)[_Size], _Up (&__u)[_Size]) const in operator()
87 for (size_t __i = 0; __i < _Size; ++__i) { in operator()
/freebsd/contrib/llvm-project/libcxx/include/__mdspan/
H A Dextents.h76 template <class _Tp, size_t _Size>
78 _Tp __vals_[_Size];
155 template <class _Tp, size_t _Size >
156 requires(_Size == __size_dynamic_)
158 if constexpr (_Size > 0) {
185 template <class _Tp, size_t _Size>
186 requires(_Size != __size_dynamic_)
328 (_Size == __rank_ || _Size == __rank_dynamic_))
329 explicit(_Size != __rank_dynamic_)
341 (_Size == __rank_ || _Size == __rank_dynamic_))
[all …]
H A Dmdspan.h120 template <class _OtherIndexType, size_t _Size>
123 …((_Size == rank()) || (_Size == rank_dynamic())) && is_constructible_v<mapping_type, extents_type>…
125 explicit(_Size != rank_dynamic())
129 template <class _OtherIndexType, size_t _Size>
132 …((_Size == rank()) || (_Size == rank_dynamic())) && is_constructible_v<mapping_type, extents_type>…
134 explicit(_Size != rank_dynamic())
135 … _LIBCPP_HIDE_FROM_ABI constexpr mdspan(data_handle_type __p, span<_OtherIndexType, _Size> __exts) in mdspan()
283 template <class _ElementType, class _OtherIndexType, size_t _Size>
284 …span(_ElementType*, const array<_OtherIndexType, _Size>&) -> mdspan<_ElementType, dextents<size_t,…
286 template <class _ElementType, class _OtherIndexType, size_t _Size>
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/pstl_backends/cpu_backends/
H A Dtransform_reduce.h51 template <typename _Size,
55 typename _UnaryResult = invoke_result_t<_UnaryOperation, _Size>,
61 const _Size __block_size = __lane_size / sizeof(_Tp); in __simd_transform_reduce()
68 for (_Size __i = 0; __i < __block_size; ++__i) { in __simd_transform_reduce()
72 _Size __i = 2 * __block_size; in __simd_transform_reduce()
73 const _Size __last_iteration = __block_size * (__n / __block_size); in __simd_transform_reduce()
76 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce()
82 for (_Size __j = 0; __j < __n - __last_iteration; ++__j) { in __simd_transform_reduce()
86 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce()
91 for (_Size __j = 0; __j < __block_size; ++__j) { in __simd_transform_reduce()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__fwd/
H A Dget.h65 template <size_t _Ip, class _Tp, size_t _Size>
66 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp& get(array<_Tp, _Size>&) _NOEXCEPT;
68 template <size_t _Ip, class _Tp, size_t _Size>
69 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const _Tp& get(const array<_Tp, _Size>&) _NOEXC…
72 template <size_t _Ip, class _Tp, size_t _Size>
73 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 _Tp&& get(array<_Tp, _Size>&&) _NOEXCEPT;
75 template <size_t _Ip, class _Tp, size_t _Size>
76 _LIBCPP_HIDE_FROM_ABI _LIBCPP_CONSTEXPR_SINCE_CXX14 const _Tp&& get(const array<_Tp, _Size>&&) _NOE…
/freebsd/contrib/llvm-project/libcxx/include/__memory/
H A Duninitialized_algorithms.h108 template <class _InputIterator, class _Size, class _ForwardIterator>
147 template <class _ValueType, class _ForwardIterator, class _Size, class _Tp>
149 __uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) { in __uninitialized_fill_n()
166 template <class _ForwardIterator, class _Size, class _Tp>
168 uninitialized_fill_n(_ForwardIterator __first, _Size __n, const _Tp& __x) { in uninitialized_fill_n()
204 template <class _ValueType, class _ForwardIterator, class _Size>
222 template <class _ForwardIterator, class _Size>
257 template <class _ValueType, class _ForwardIterator, class _Size>
275 template <class _ForwardIterator, class _Size>
327 class _Size,
[all …]
H A Dallocation_guard.h50 using _Size = typename allocator_traits<_Alloc>::size_type; member
53 _LIBCPP_HIDE_FROM_ABI explicit __allocation_guard(_AllocT __alloc, _Size __n) in __allocation_guard()
100 _Size __n_;
/freebsd/contrib/llvm-project/libcxx/include/__algorithm/
H A Dfill_n.h24 template <class _OutputIterator, class _Size, class _Tp>
26 __fill_n(_OutputIterator __first, _Size __n, const _Tp& __value) { in __fill_n()
32 template <class _OutputIterator, class _Size, class _Tp>
34 fill_n(_OutputIterator __first, _Size __n, const _Tp& __value) { in fill_n()
H A Dcopy_n.h25 class _Size,
31 copy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) { in copy_n()
47 class _Size,
51 copy_n(_InputIterator __first, _Size __orig_n, _OutputIterator __result) { in copy_n()
H A Dpstl_for_each.h66 class _Size,
71 __for_each_n(_ExecutionPolicy&& __policy, _ForwardIterator&& __first, _Size&& __size, _Function&& _… in __for_each_n()
74 [&](_ForwardIterator __g_first, _Size __g_size, _Function __g_func) -> optional<__empty> { in __for_each_n()
90 class _Size,
95 for_each_n(_ExecutionPolicy&& __policy, _ForwardIterator __first, _Size __size, _Function __func) { in for_each_n()
H A Dpstl_generate.h76 class _Size,
81 __generate_n(_ExecutionPolicy&& __policy, _ForwardIterator&& __first, _Size&& __n, _Generator&& __g… in __generate_n()
84 [&__policy](_ForwardIterator __g_first, _Size __g_n, _Generator __g_gen) { in __generate_n()
97 class _Size,
102 generate_n(_ExecutionPolicy&& __policy, _ForwardIterator __first, _Size __n, _Generator __gen) { in generate_n()
H A Dpstl_copy.h82 class _Size,
86 …_ExecutionPolicy&& __policy, _ForwardIterator&& __first, _Size&& __n, _ForwardOutIterator&& __resu… in __copy_n()
90 …_ForwardIterator __g_first, _Size __g_n, _ForwardOutIterator __g_result) -> optional<_ForwardItera… in __copy_n()
104 class _Size,
108 copy_n(_ExecutionPolicy&& __policy, _ForwardIterator __first, _Size __n, _ForwardOutIterator __resu… in copy_n()
H A Dgenerate_n.h21 template <class _OutputIterator, class _Size, class _Generator>
23 generate_n(_OutputIterator __first, _Size __orig_n, _Generator __gen) { in generate_n()
H A Dfor_each_n.h24 template <class _InputIterator, class _Size, class _Function>
26 for_each_n(_InputIterator __first, _Size __orig_n, _Function __f) { in for_each_n()
H A Dsearch_n.h137 template <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
139 …_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value, _BinaryPredi… in search_n()
146 template <class _ForwardIterator, class _Size, class _Tp>
148 search_n(_ForwardIterator __first, _ForwardIterator __last, _Size __count, const _Tp& __value) { in search_n()
/freebsd/contrib/llvm-project/libcxx/include/__format/
H A Dbuffer.h412 using _Size = iter_difference_t<_OutIt>;
416 : __writer_(std::move(__out_it)), __max_size_(std::max(_Size(0), __max_size)) {}
419 if (_Size(__size_) <= __max_size_)
420 __writer_.__flush(__ptr, std::min(_Size(__n), __max_size_ - __size_));
429 _Size __max_size_;
430 _Size __size_{0};
442 using _Size = iter_difference_t<_OutIt>;
471 _Size __s = std::min(_Size(__n), __max_size_ - __size_);
484 _Size __max_size_;
485 _Size __size_{0};
[all …]
H A Dformatter_string.h109 template <__fmt_char_type _CharT, size_t _Size>
110 struct _LIBCPP_TEMPLATE_VIS formatter<_CharT[_Size], _CharT> : public __formatter_string<_CharT> {
115 format(const _CharT (&__str)[_Size], _FormatContext& __ctx) const {
116 return _Base::format(basic_string_view<_CharT>(__str, _Size), __ctx);
/freebsd/contrib/llvm-project/libcxx/include/__tuple/
H A Dtuple_like.h38 template <class _Tp, size_t _Size>
39 struct __tuple_like_impl<array<_Tp, _Size> > : true_type {};
H A Dtuple_like_ext.h44 template <class _Tp, size_t _Size>
45 struct __tuple_like_ext<array<_Tp, _Size> > : true_type {};
/freebsd/contrib/llvm-project/libcxx/include/__compare/
H A Dcommon_comparison_category.h40 template <size_t _Size>
42 __compute_comp_type(const _ClassifyCompCategory (&__types)[_Size]) { in __compute_comp_type() argument
/freebsd/contrib/llvm-project/libcxx/include/experimental/__simd/
H A Dutility.h93 template <class _Tp, class _Generator, std::size_t _Size>
94 …ool __can_generate_v = experimental::__can_generate<_Tp, _Generator>(make_index_sequence<_Size>());

12