Home
last modified time | relevance | path

Searched refs:__it (Results 1 – 12 of 12) sorted by relevance

/freebsd-13.1/contrib/llvm-project/libcxx/include/__format/
H A Dformat_parse_context.h61 _LIBCPP_HIDE_FROM_ABI constexpr void advance_to(const_iterator __it) { in advance_to() argument
62 __begin_ = __it; in advance_to()
/freebsd-13.1/contrib/llvm-project/libcxx/include/__iterator/
H A Dconcepts.h132 requires (_Ip __it, _Tp&& __t) { in requires() argument
133 *__it++ = _VSTD::forward<_Tp>(__t); // not required to be equality-preserving in requires()
/freebsd-13.1/contrib/llvm-project/libcxx/include/experimental/
H A Dfunctional170 auto __it = __table.find (__key);
171 return __it == __table.end() ? __default_value_ : __it->second;
/freebsd-13.1/contrib/llvm-project/libcxx/include/
H A D__bit_reference1123 __bit_iterator(const __bit_iterator<_Cp, false>& __it) _NOEXCEPT
1124 : __seg_(__it.__seg_), __ctz_(__it.__ctz_) {}
1132 __bit_iterator& operator=(const _If<_IsConst, struct __private_nat, __bit_iterator>& __it) {
1133 __seg_ = __it.__seg_;
1134 __ctz_ = __it.__ctz_;
1211 …friend __bit_iterator operator+(difference_type __n, const __bit_iterator& __it) {return __it + __…
H A D__hash_table1184 _NodeHandle __node_handle_extract(const_iterator __it);
2236 for (typename _Table::iterator __it = __source.begin();
2237 __it != __source.end();)
2239 __node_pointer __src_ptr = __it.__node_->__upcast();
2243 auto __prev_iter = __it++;
2290 for (typename _Table::iterator __it = __source.begin();
2291 __it != __source.end();)
2293 __node_pointer __src_ptr = __it.__node_->__upcast();
2297 (void)__source.remove(__it++).release();
H A Dset734 node_type extract(const_iterator __it)
736 return __tree_.template __node_handle_extract<node_type>(__it);
1264 node_type extract(const_iterator __it)
1266 return __tree_.template __node_handle_extract<node_type>(__it);
H A Dmap1361 node_type extract(const_iterator __it)
1363 return __tree_.template __node_handle_extract<node_type>(__it.__i_);
2036 node_type extract(const_iterator __it)
2039 __it.__i_);
H A Ddeque320 __deque_iterator(const __deque_iterator<value_type, _Pp, _Rp, _MP, difference_type, _BS>& __it,
322 : __m_iter_(__it.__m_iter_), __ptr_(__it.__ptr_) {}
402 friend __deque_iterator operator+(difference_type __n, const __deque_iterator& __it)
403 {return __it + __n;}
H A Dfilesystem1635 iterator __it(*this);
1637 return __it;
1651 iterator __it(*this);
1653 return __it;
H A Dunordered_map1302 node_type extract(const_iterator __it)
1305 __it.__i_);
2114 node_type extract(const_iterator __it)
2117 __it.__i_);
H A D__tree2316 iterator __it = find(__key);
2317 if (__it == end())
2319 return __node_handle_extract<_NodeHandle>(__it);
H A Dunordered_set656 node_type extract(const_iterator __it)
658 return __table_.template __node_handle_extract<node_type>(__it);