Home
last modified time | relevance | path

Searched refs:__e (Results 1 – 25 of 29) sorted by relevance

12

/ndk/sources/cxx-stl/llvm-libc++/libcxx/include/
Dlocale409 // Scans [__b, __e) until a match is found in the basic_strings range
420 // If on exit __b == __e, eofbit is set in __err. If __case_sensitive is false,
429 __scan_keyword(_InputIterator& __b, _InputIterator __e,
465 for (size_t __indx = 0; __b != __e && __n_might_match > 0; ++__indx)
525 if (__b == __e)
712 iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
715 return do_get(__b, __e, __iob, __err, __v);
719 iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
722 return do_get(__b, __e, __iob, __err, __v);
726 iter_type get(iter_type __b, iter_type __e, ios_base& __iob,
[all …]
Dlist1178 for (const_iterator __i = __c.begin(), __e = __c.end(); __i != __e; ++__i)
1189 for (const_iterator __i = __c.begin(), __e = __c.end(); __i != __e; ++__i)
1203 __e = __il.end(); __i != __e; ++__i)
1214 __e = __il.end(); __i != __e; ++__i)
1309 iterator __e = end();
1310 for (; __f != __l && __i != __e; ++__f, ++__i)
1312 if (__i == __e)
1313 insert(__e, __f, __l);
1315 erase(__i, __e);
1323 iterator __e = end();
[all …]
Dsystem_error423 error_condition(_Ep __e,
426 {*this = make_error_condition(__e);}
442 operator=(_Ep __e) _NOEXCEPT
443 {*this = make_error_condition(__e); return *this;}
466 make_error_condition(errc __e) _NOEXCEPT
468 return error_condition(static_cast<int>(__e), generic_category());
495 error_code(_Ep __e,
498 {*this = make_error_code(__e);}
514 operator=(_Ep __e) _NOEXCEPT
515 {*this = make_error_code(__e); return *this;}
[all …]
Dforward_list993 iterator __e = end();
994 for (; __j != __e && __f != __l; ++__i, ++__j, ++__f)
996 if (__j == __e)
999 erase_after(__i, __e);
1008 iterator __e = end();
1009 for (; __j != __e && __n > 0; --__n, ++__i, ++__j)
1011 if (__j == __e)
1014 erase_after(__i, __e);
1248 __node_pointer __e = __l.__ptr_;
1253 if (__n != __e)
[all …]
Dexception155 make_exception_ptr(_Ep __e) _NOEXCEPT
160 throw __e;
234 rethrow_if_nested(const _Ep& __e, typename enable_if<
238 const nested_exception* __nep = dynamic_cast<const nested_exception*>(&__e);
Datomic852 bool compare_exchange_weak(_Tp& __e, _Tp __d,
854 {return __c11_atomic_compare_exchange_weak(&__a_, &__e, __d, __s, __f);}
856 bool compare_exchange_weak(_Tp& __e, _Tp __d,
858 {return __c11_atomic_compare_exchange_weak(&__a_, &__e, __d, __s, __f);}
860 bool compare_exchange_strong(_Tp& __e, _Tp __d,
862 {return __c11_atomic_compare_exchange_strong(&__a_, &__e, __d, __s, __f);}
864 bool compare_exchange_strong(_Tp& __e, _Tp __d,
866 {return __c11_atomic_compare_exchange_strong(&__a_, &__e, __d, __s, __f);}
868 bool compare_exchange_weak(_Tp& __e, _Tp __d,
870 {return __c11_atomic_compare_exchange_weak(&__a_, &__e, __d, __m, __m);}
[all …]
Dvalarray659 __slice_expr(const slice& __sl, const _RmExpr& __e)
660 : __expr_(__e),
701 __shift_expr(int __n, const _RmExpr& __e)
702 : __expr_(__e),
703 __size_(__e.size()),
742 __cshift_expr(int __n, const _RmExpr& __e)
743 : __expr_(__e),
744 __size_(__e.size())
1607 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
1623 for (_Ip __i = __1d_.__begin_, __e = __1d_.__end_; __i != __e; ++__i, ++__j)
[all …]
Dregex1172 for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end();
1173 __i != __e; ++__i)
1224 for (typename string_type::const_iterator __i = __s.begin(), __e = __s.end();
1225 __i != __e; ++__i)
2236 void __add_range(string_type __b, string_type __e)
2244 for (size_t __i = 0; __i < __e.size(); ++__i)
2245 __e[__i] = __traits_.translate_nocase(__e[__i]);
2251 for (size_t __i = 0; __i < __e.size(); ++__i)
2252 __e[__i] = __traits_.translate(__e[__i]);
2256 __traits_.transform(__e.begin(), __e.end())));
[all …]
D__std_stream282 const char_type* __e;
283 __r = __cv_->out(*__st_, pbase, pptr, __e,
287 if (__e == pbase)
301 pbase = (char_type*)__e;
Ddeque1035 for (typename __map::const_iterator __i = __map_.begin(), __e = __map_.end();
1036 __i != __e; ++__i)
1106 typename __map::iterator __e = __map_.end();
1107 for (; __i != __e; ++__i)
1162 for (iterator __i = begin(), __e = end(); __i != __e; ++__i)
1590 iterator __e = __base::end();
1591 for (; __f != __l && __i != __e; ++__f, ++__i)
1902 iterator __e = __base::end();
1903 iterator __em1 = _VSTD::prev(__e);
1905 __vt = pointer_traits<const_pointer>::pointer_to(*__e);
[all …]
Dfstream419 ptrdiff_t __e = this->egptr() - this->eback();
422 (char_type*)__extbuf_min_ + __e);
427 ptrdiff_t __e = this->epptr() - this->pbase();
429 (char_type*)__extbuf_min_ + __e);
435 ptrdiff_t __e = __rhs.egptr() - __rhs.eback();
438 (char_type*)__rhs.__extbuf_min_ + __e);
443 ptrdiff_t __e = __rhs.epptr() - __rhs.pbase();
445 (char_type*)__rhs.__extbuf_min_ + __e);
698 const char_type* __e;
699 __r = __cv_->out(__st_, this->pbase(), this->pptr(), __e,
[all …]
Dcmath873 …P_INLINE_VISIBILITY float frexp(float __x, int* __e) _NOEXCEPT {return frexpf(__x, __e…
874 …INLINE_VISIBILITY long double frexp(long double __x, int* __e) _NOEXCEPT {return frexpl(__x, __e);}
880 frexp(_A1 __x, int* __e) _NOEXCEPT {return frexp((double)__x, __e);}
888 …PP_INLINE_VISIBILITY float ldexp(float __x, int __e) _NOEXCEPT {return ldexpf(__x, __e…
889 …_INLINE_VISIBILITY long double ldexp(long double __x, int __e) _NOEXCEPT {return ldexpl(__x, __e);}
895 ldexp(_A1 __x, int __e) _NOEXCEPT {return ldexp((double)__x, __e);}
Diomanip580 __quoted_output_proxy(_Iter __f, _Iter __l, _CharT __d, _CharT __e)
581 : __first(__f), __last(__l), __delim(__d), __escape(__e) {}
600 __quoted_proxy(basic_string<_CharT, _Traits, _Allocator> &__s, _CharT __d, _CharT __e)
601 : __string(__s), __delim(__d), __escape(__e) {}
Dset615 for (const_iterator __e = cend(); __f != __l; ++__f)
616 __tree_.__insert_unique(__e, *__f);
727 const_iterator __e = cend();
729 insert(__e, _VSTD::move(__s.__tree_.remove(__s.begin())->__value_));
1018 for (const_iterator __e = cend(); __f != __l; ++__f)
1019 __tree_.__insert_multi(__e, *__f);
1131 const_iterator __e = cend();
1133 insert(__e, _VSTD::move(__s.__tree_.remove(__s.begin())->__value_));
Dbitset316 const_iterator __e = __make_iter(_Size);
317 const_iterator __i = _VSTD::find(__make_iter(sizeof(unsigned long) * CHAR_BIT), __e, true);
318 if (__i != __e)
339 const_iterator __e = __make_iter(_Size);
340 const_iterator __i = _VSTD::find(__make_iter(sizeof(unsigned long long) * CHAR_BIT), __e, true);
341 if (__i != __e)
Dios403 make_error_code(io_errc __e) _NOEXCEPT
405 return error_code(static_cast<int>(__e), iostream_category());
410 make_error_condition(io_errc __e) _NOEXCEPT
412 return error_condition(static_cast<int>(__e), iostream_category());
Drandom2646 __e(__sd == 0u ? default_seed : __sd);
2648 __x_[__i] = static_cast<result_type>(__e() & _Max);
2659 __e(__sd == 0u ? default_seed : __sd);
2662 result_type __e0 = __e();
2664 (__e0 + ((uint64_t)__e() << 32)) & _Max);
2845 explicit discard_block_engine(const _Engine& __e)
2846 : __e_(__e), __n_(0) {}
2849 explicit discard_block_engine(_Engine&& __e)
2850 : __e_(_VSTD::move(__e)), __n_(0) {}
2969 _Eng __e;
[all …]
Dmap1061 for (const_iterator __e = cend(); __f != __l; ++__f)
1062 insert(__e.__i_, *__f);
1285 const_iterator __e = cend();
1287 __tree_.__insert_unique(__e.__i_,
1792 for (const_iterator __e = cend(); __f != __l; ++__f)
1793 __tree_.__insert_multi(__e.__i_, *__f);
1917 const_iterator __e = cend();
1919 __tree_.__insert_multi(__e.__i_,
D__hash_table2205 iterator __e = end();
2210 } while (__i != __e && key_eq()(*__i, __k));
2283 const_iterator __e = end();
2288 } while (__i != __e && key_eq()(*__i, __k));
2332 iterator __e = end();
2336 } while (__j != __e && key_eq()(*__j, __k));
2352 const_iterator __e = end();
2356 } while (__j != __e && key_eq()(*__j, __k));
Dfuture488 make_error_code(future_errc __e) _NOEXCEPT
490 return error_code(static_cast<int>(__e), future_category());
495 make_error_condition(future_errc __e) _NOEXCEPT
497 return error_condition(static_cast<int>(__e), future_category());
Dcomplex1162 _Tp __e = exp(__x.real());
1163 return complex<_Tp>(__e * cos(__i), __e * sin(__i));
/ndk/sources/cxx-stl/stlport/src/
Dlocale_catalog.cpp171 Category_Map::value_type __e(name, pair<void*,size_t>((void*)0,size_t(0))); in __acquire_category()
179 result = (*M)->insert_noresize(__e); in __acquire_category()
/ndk/sources/cxx-stl/stlport/stlport/stl/
D_rope.h1377 rope(const _CharT *__s, const _CharT *__e,
1379 : _M_tree_ptr(__a, _S_RopeLeaf_from_unowned_char_ptr(__s, __e - __s, __a))
1382 rope(const const_iterator& __s, const const_iterator& __e,
1385 __e._M_current_pos))
1388 rope(const iterator& __s, const iterator& __e,
1391 __e._M_current_pos))
1672 _Self& append(const _CharT* __s, const _CharT* __e) {
1673 _M_reset(_S_destr_concat_char_iter(_M_tree_ptr._M_data, __s, __e - __s));
1677 _Self& append(const_iterator __s, const_iterator __e) {
1678 _STLP_ASSERT(__s._M_root == __e._M_root)
[all …]
D_monetary.c287 typename string_type::iterator __b = __buf.begin(), __e = __buf.end(); in do_get() local
292 _STLP_PRIV __get_decimal_integer(__b, __e, __units, (_CharT*)0); in do_get()
D_vector.h665 void _M_set(pointer __s, pointer __f, pointer __e) {
668 this->_M_end_of_storage._M_data = __e;

12