Home
last modified time | relevance | path

Searched refs:__first_ (Results 1 – 20 of 20) sorted by relevance

/freebsd/contrib/llvm-project/libcxx/include/__format/
H A Dunicode.h130 : __first_(__first), __last_(__last) {} in __code_point_view()
132 _LIBCPP_HIDE_FROM_ABI constexpr bool __at_end() const noexcept { return __first_ == __last_; } in __at_end()
133 _LIBCPP_HIDE_FROM_ABI constexpr _Iterator __position() const noexcept { return __first_; } in __position()
158 _LIBCPP_ASSERT_INTERNAL(__first_ != __last_, "can't move beyond the end of input"); in __consume()
163 switch (std::countl_one(static_cast<unsigned char>(*__first_))) { in __consume()
165 return {static_cast<unsigned char>(*__first_++)}; in __consume()
168 if (__last_ - __first_ < 2 || !__unicode::__is_continuation(__first_ + 1, 1)) [[unlikely]] in __consume()
171 char32_t __value = static_cast<unsigned char>(*__first_++) & 0x1f; in __consume()
173 __value |= static_cast<unsigned char>(*__first_++) & 0x3f; in __consume()
183 if (__last_ - __first_ < 3 || !__unicode::__is_continuation(__first_ + 1, 2)) [[unlikely]] in __consume()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/
H A D__split_buffer50 // It has uninitialized memory in the ranges [__first_, __begin_) and [__end_, __end_cap_.first())…
78 pointer __first_;
90 …: __first_(nullptr), __begin_(nullptr), __end_(nullptr), __end_cap_(nullptr, __default_init_tag())…
93 : __first_(nullptr), __begin_(nullptr), __end_(nullptr), __end_cap_(nullptr, __a) {}
96 : __first_(nullptr), __begin_(nullptr), __end_(nullptr), __end_cap_(nullptr, __a) {}
126 …HIDE_FROM_ABI size_type capacity() const { return static_cast<size_type>(__end_cap() - __first_); }
128 …DE_FROM_ABI size_type __front_spare() const { return static_cast<size_type>(__begin_ - __first_); }
208 if (__first_ == nullptr) {
216 if (__begin_ < __first_)
265 size_type __old_cap = __end_cap() - __first_;
[all …]
H A Dbitset185 __storage_type __first_[_N_words];
196 …return reference(__first_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word);
199 …return const_reference(__first_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per…
202 return iterator(__first_ + __pos / __bits_per_word, __pos % __bits_per_word);
205 return const_iterator(__first_ + __pos / __bits_per_word, __pos % __bits_per_word);
237 std::fill_n(__first_, _N_words, __storage_type(0));
250 std::copy(__t, __t + sizeof(__t) / sizeof(__t[0]), __first_);
252 …__first_ + sizeof(__t) / sizeof(__t[0]), __first_ + sizeof(__first_) / sizeof(__first_[0]), __stor…
257 __first_[0] = __v;
259 __first_[0] &= (1ULL << _Size) - 1;
[all …]
H A Diomanip458 const _CharT* __first_;
464 : __first_(__f), __last_(__l), __delim_(__d), __escape_(__e) {}
469 return std::__quoted_output(__os, __p.__first_, __p.__last_, __p.__delim_, __p.__escape_);
H A Dregex1312 const _CharT* __first_;
1323 __first_(nullptr),
1371 __node<_CharT>* __first_;
1374 _LIBCPP_HIDE_FROM_ABI explicit __has_one_state(__node<_CharT>* __s) : __first_(__s) {}
1376 _LIBCPP_HIDE_FROM_ABI __node<_CharT>* first() const { return __first_; }
1377 _LIBCPP_HIDE_FROM_ABI __node<_CharT>*& first() { return __first_; }
1791 if (__s.__first_ != __s.__last_) {
1797 …} else if (__s.__current_ == __s.__first_ && !(__s.__flags_ & regex_constants::match_prev_avail)) {
1843 …if (__s.__at_first_ && __s.__current_ == __s.__first_ && !(__s.__flags_ & regex_constants::match_n…
2683 __s.__at_first_ && __s.__current_ == __s.__first_);
[all …]
H A Ddeque1623 std::swap(__map_.__first_, __buf.__first_);
1700 std::swap(__map_.__first_, __buf.__first_);
1746 std::swap(__map_.__first_, __buf.__first_);
1825 std::swap(__map_.__first_, __buf.__first_);
H A Dvector855 __v.__first_ = __v.__begin_;
885 __v.__first_ = __v.__begin_;
/freebsd/contrib/llvm-project/libcxx/include/
H A D__split_buffer49 // It has uninitialized memory in the ranges [__first_, __begin_) and [__end_, __cap_). That allows
81 pointer __first_;
91 : __first_(nullptr), __begin_(nullptr), __end_(nullptr), __cap_(nullptr) {}
94 : __first_(nullptr), __begin_(nullptr), __end_(nullptr), __cap_(nullptr), __alloc_(__a) {}
97 : __first_(nullptr), __begin_(nullptr), __end_(nullptr), __cap_(nullptr), __alloc_(__a) {}
129 return static_cast<size_type>(__cap_ - __first_);
133 return static_cast<size_type>(__begin_ - __first_);
216 if (__first_ == nullptr) {
224 if (__begin_ < __first_)
269 size_type __old_cap = __cap_ - __first_;
[all …]
H A Dbitset200 __storage_type __first_[_N_words];
211 …return reference(__first_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_per_word);
214 …return __const_reference(__first_ + __pos / __bits_per_word, __storage_type(1) << __pos % __bits_p…
217 return __iterator(__first_ + __pos / __bits_per_word, __pos % __bits_per_word);
220 return __const_iterator(__first_ + __pos / __bits_per_word, __pos % __bits_per_word);
239 return static_cast<unsigned long>(__first_[0]);
254 return static_cast<unsigned long long>(__first_[0]);
259 unsigned long long __r = static_cast<unsigned long long>(__first_[0]);
261 __r |= static_cast<unsigned long long>(__first_[__i]) << (__bits_per_word * __i);
277 __storage_type __word = std::__invert_if<!_Sparse>(__first_[__i]);
[all …]
H A Diomanip469 const _CharT* __first_;
475 : __first_(__f), __last_(__l), __delim_(__d), __escape_(__e) {}
480 return std::__quoted_output(__os, __p.__first_, __p.__last_, __p.__delim_, __p.__escape_);
H A Dregex1332 const _CharT* __first_;
1343 __first_(nullptr),
1391 __node<_CharT>* __first_;
1394 _LIBCPP_HIDE_FROM_ABI explicit __has_one_state(__node<_CharT>* __s) : __first_(__s) {}
1396 _LIBCPP_HIDE_FROM_ABI __node<_CharT>* first() const { return __first_; }
1397 _LIBCPP_HIDE_FROM_ABI __node<_CharT>*& first() { return __first_; }
1811 if (__s.__first_ != __s.__last_) {
1817 …} else if (__s.__current_ == __s.__first_ && !(__s.__flags_ & regex_constants::match_prev_avail)) {
1863 …if (__s.__at_first_ && __s.__current_ == __s.__first_ && !(__s.__flags_ & regex_constants::match_n…
2731 __s.__at_first_ && __s.__current_ == __s.__first_);
[all …]
H A Ddeque2084 std::swap(__map_.__first_, __buf.__first_);
2161 std::swap(__map_.__first_, __buf.__first_);
2207 std::swap(__map_.__first_, __buf.__first_);
2286 std::swap(__map_.__first_, __buf.__first_);
/freebsd/contrib/llvm-project/libcxx/src/
H A Dmemory_resource.cpp153 while (__first_ != nullptr) { in __release_ptr()
154 __chunk_footer* next = __first_->__next_; in __release_ptr()
155 upstream->deallocate(__first_->__start_, __first_->__allocation_size(), __first_->__align_); in __release_ptr()
156 __first_ = next; in __release_ptr()
172 h->__next_ = __first_; in __do_allocate()
175 __first_ = h; in __do_allocate()
181 …_LIBCPP_ASSERT_NON_NULL(__first_ != nullptr, "deallocating a block that was not allocated with thi… in __do_deallocate()
182 if (__first_->__start_ == p) { in __do_deallocate()
183 __chunk_footer* next = __first_->__next_; in __do_deallocate()
184 upstream->deallocate(p, __first_->__allocation_size(), __first_->__align_); in __do_deallocate()
[all …]
/freebsd/contrib/llvm-project/libcxx/include/__functional/
H A Dboyer_moore_searcher.h107 : __first_(__first), in __first_() function
120 __build_suffix_table(__first_, __last_, __pred_); in __first_()
131 if (__first_ == __last_) in operator()
140 _RandomAccessIterator1 __first_;
156 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
238 : __first_(__first), in __first_() function
262 if (__first_ == __last_) in operator()
272 _RandomAccessIterator1 __first_;
287 while (__pred_(__first_[__j - 1], __current[__j - 1])) { in __search()
H A Ddefault_searcher.h34 : __first_(__f), __last_(__l), __pred_(__p) {} in __first_() function
40 return std::__search_impl(__f, __l, __first_, __last_, __pred_, __proj, __proj); in operator()
44 _ForwardIterator __first_;
/freebsd/contrib/llvm-project/libcxx/include/experimental/
H A Diterator91 : __output_iter_(std::addressof(__os)), __delim_(std::move(__d)), __first_(true) {}
94 : __output_iter_(std::addressof(__os)), __delim_(__d), __first_(true) {}
98 if (!__first_)
100 __first_ = false;
112 bool __first_;
/freebsd/contrib/llvm-project/libcxx/include/__memory_resource/
H A Dunsynchronized_pool_resource.h35 __chunk_footer* __first_; variable
38 _LIBCPP_HIDE_FROM_ABI explicit __adhoc_pool() : __first_(nullptr) {} in __adhoc_pool()
/freebsd/contrib/llvm-project/libcxx/include/__cxx03/__memory/
H A Duninitialized_algorithms.h183 : __alloc_(__alloc), __first_(__first), __last_(__last) {} in _AllocatorDestroyRangeReverse()
186 …r_destroy(__alloc_, std::reverse_iterator<_Iter>(__last_), std::reverse_iterator<_Iter>(__first_)); in operator()
191 _Iter& __first_; variable
/freebsd/contrib/llvm-project/libcxx/include/__memory/
H A Duninitialized_algorithms.h520 : __alloc_(__alloc), __first_(__first), __last_(__last) {} in _AllocatorDestroyRangeReverse()
523 …r_destroy(__alloc_, std::reverse_iterator<_Iter>(__last_), std::reverse_iterator<_Iter>(__first_)); in operator()
528 _Iter& __first_; variable
/freebsd/contrib/llvm-project/libcxx/include/__vector/
H A Dvector.h852 __v.__first_ = __v.__begin_; in __swap_out_circular_buffer()
882 __v.__first_ = __v.__begin_; in __swap_out_circular_buffer()