Home
last modified time | relevance | path

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

/external/libcxx/include/
Dbitset136 template <size_t _N_words, size_t _Size>
139 template <size_t _N_words, size_t _Size>
140 struct __has_storage_type<__bitset<_N_words, _Size> >
145 template <size_t _N_words, size_t _Size>
189 {return to_ulong(integral_constant<bool, _Size < sizeof(unsigned long) * CHAR_BIT>());}
191 … {return to_ullong(integral_constant<bool, _Size < sizeof(unsigned long long) * CHAR_BIT>());}
209 template <size_t _N_words, size_t _Size>
212 __bitset<_N_words, _Size>::__bitset() _NOEXCEPT
224 template <size_t _N_words, size_t _Size>
226 __bitset<_N_words, _Size>::__init(unsigned long long __v, false_type) _NOEXCEPT
[all …]
Darray120 template <class _Tp, size_t _Size>
137 value_type __elems_[_Size > 0 ? _Size : 1];
141 {_VSTD::fill_n(__elems_, _Size, __u);}
144 {_VSTD::swap_ranges(__elems_, __elems_ + _Size, __a.__elems_);}
152 iterator end() _NOEXCEPT {return iterator(__elems_ + _Size);}
154 const_iterator end() const _NOEXCEPT {return const_iterator(__elems_ + _Size);}
176 _LIBCPP_CONSTEXPR size_type size() const _NOEXCEPT {return _Size;}
178 _LIBCPP_CONSTEXPR size_type max_size() const _NOEXCEPT {return _Size;}
180 _LIBCPP_CONSTEXPR bool empty() const _NOEXCEPT {return _Size == 0;}
190 …_LIBCPP_INLINE_VISIBILITY reference back() {return __elems_[_Size > 0 ? _Size-1 : 0];}
[all …]
Dmemory3068 template <class _Size>
3070 _Size
3073 _Size __r;
3081 template <class _Size, size_t = sizeof(_Size)*__CHAR_BIT__>
3084 template <class _Size>
3085 struct __murmur2_or_cityhash<_Size, 32>
3087 _Size operator()(const void* __key, _Size __len);
3091 template <class _Size>
3092 _Size
3093 __murmur2_or_cityhash<_Size, 32>::operator()(const void* __key, _Size __len)
[all …]
D__tuple95 template <class _Tp, size_t _Size> struct _LIBCPP_TYPE_VIS_ONLY array;
105 template <class _Tp, size_t _Size> struct __tuple_like<array<_Tp, _Size> > : true_type {};
137 template <size_t _Ip, class _Tp, size_t _Size>
140 get(array<_Tp, _Size>&) _NOEXCEPT;
142 template <size_t _Ip, class _Tp, size_t _Size>
145 get(const array<_Tp, _Size>&) _NOEXCEPT;
147 template <size_t _Ip, class _Tp, size_t _Size>
150 get(array<_Tp, _Size>&&) _NOEXCEPT;
Dalgorithm1591 template <class _BinaryPredicate, class _ForwardIterator, class _Size, class _Tp>
1594 _Size __count, const _Tp& __value_, _BinaryPredicate __pred, forward_iterator_tag)
1611 _Size __c(0);
1628 template <class _BinaryPredicate, class _RandomAccessIterator, class _Size, class _Tp>
1631 _Size __count, const _Tp& __value_, _BinaryPredicate __pred, random_access_iterator_tag)
1635 _Size __len = static_cast<_Size>(__last - __first);
1652 _Size __c(0);
1668 template <class _ForwardIterator, class _Size, class _Tp, class _BinaryPredicate>
1672 _Size __count, const _Tp& __value_, _BinaryPredicate __pred)
1679 template <class _ForwardIterator, class _Size, class _Tp>
[all …]
Distream1677 template <class _CharT, class _Traits, size_t _Size>
1679 operator>>(basic_istream<_CharT, _Traits>& __is, bitset<_Size>& __x)
1694 while (__c < _Size)
1709 __x = bitset<_Size>(__str);
Dostream1099 template <class _CharT, class _Traits, size_t _Size>
1101 operator<<(basic_ostream<_CharT, _Traits>& __os, const bitset<_Size>& __x)
Dtype_traits1311 template <class _TypeList, size_t _Size, bool = _Size <= sizeof(typename _TypeList::_Head)> struct …
1313 template <class _Hp, class _Tp, size_t _Size>
1314 struct __find_first<__type_list<_Hp, _Tp>, _Size, true>
1319 template <class _Hp, class _Tp, size_t _Size>
1320 struct __find_first<__type_list<_Hp, _Tp>, _Size, false>
1322 typedef typename __find_first<_Tp, _Size>::type type;
/external/icu/icu4c/source/common/unicode/
Dutypes.h423 _Ret_bytecap_(_Size) in _Ret_bytecap_() argument