Home
last modified time | relevance | path

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

/reactos/sdk/include/c++/stlport/stl/
H A D_hash_map.h107 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
111 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
116 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
122 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
129 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
184 { _M_ht.insert_unique(__f,__l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
187 { _M_ht.insert_unique(__f,__l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
189 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
220 void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
379 _M_ht.insert_equal(__f,__l); in _STLP_CREATE_HASH_ITERATOR_TRAITS()
[all …]
H A D_hash_set.h109 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
113 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
118 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
124 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
188 {_M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
191 { _M_ht.insert_unique(__f,__l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
214 void erase(iterator __f, iterator __l) { _M_ht.erase(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
367 { _M_ht.insert_equal(__f,__l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
370 { _M_ht.insert_equal(__f,__l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
372 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
[all …]
H A D_string_workaround.h86 _M_initialize_dispatch(__f, __l, _Integral()); in basic_string()
93 _M_initialize_dispatch(__f, __l, _Integral()); in basic_string()
118 _M_appendT(__f, __l, __tag); in _M_range_initialize()
144 _M_range_initializeT(__f, __l); in _M_initialize_dispatch()
200 _Base::append(__f, __l); in append()
290 if (__f == __l) in _M_assign_dispatch()
313 _Base::assign(__f, __l); in assign()
364 _M_insert(__p, __f, __l, this->_M_inside(__f)); in insert()
371 _Base::_M_insert(__p, __f, __l, __self_ref); in _M_insert()
450 _Base::_M_copy(__f, __l, __res); in _M_copyT()
[all …]
H A D_unordered_set.h94 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
101 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
108 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
136 {_M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
139 { _M_ht.insert_unique(__f,__l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
158 void erase(const_iterator __f, const_iterator __l) { _M_ht.erase(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
244 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
251 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
258 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
286 { _M_ht.insert_equal(__f,__l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
[all …]
H A D_unordered_map.h100 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
107 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
114 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
142 { _M_ht.insert_unique(__f,__l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
145 { _M_ht.insert_unique(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
172 void erase(const_iterator __f, const_iterator __l) { _M_ht.erase(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
268 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
275 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
282 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
310 { _M_ht.insert_equal(__f,__l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
[all …]
H A D_string.h281 _M_range_initialize(__f, __l); in basic_string()
287 _M_range_initialize(__f, __l); in basic_string()
317 _M_appendT(__f, __l, __tag); in _M_range_initialize()
343 _M_range_initializeT(__f, __l); in _M_initialize_dispatch()
378 ptrdiff_t __n = __l - __f; in _M_range_initialize()
584 if (__f == __l) in _M_assign_dispatch()
603 return _M_assign(__f, __l); in assign()
678 _Traits::copy(__res, __f, __l - __f); in _M_copy()
683 _Traits::move(__res, __f, __l - __f); in _M_move()
765 _Traits::copy(__res, __f, __l - __f); in _M_copyT()
[all …]
H A D_hashtable.h425 void insert_unique(_InputIterator __f, _InputIterator __l)
429 void insert_equal(_InputIterator __f, _InputIterator __l)
435 for ( ; __f != __l; ++__f)
440 void insert_equal(_InputIterator __f, _InputIterator __l,
442 for ( ; __f != __l; ++__f)
449 size_type __n = _STLP_STD::distance(__f, __l);
458 size_type __n = _STLP_STD::distance(__f, __l);
466 size_type __n = __l - __f;
473 size_type __n = __l - __f;
480 size_type __n = _STLP_STD::distance(__f, __l);
[all …]
H A D_rope.c818 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, __r); in _S_apply_to_pieces() local
931 _RopeLeaf* __l = __STATIC_CAST(_RopeLeaf*, __r); in _S_flatten() local
932 return _STLP_PRIV __ucopy_n(__l->_M_data, __l->_M_size._M_data, __buffer).second; in _S_flatten()
1147 _RopeLeaf* __l = (_RopeLeaf*)__r; in _S_fetch() local
1148 return __l->_M_data[__i]; in _S_fetch()
1199 _RopeLeaf* __l = (_RopeLeaf*)__r; in _S_fetch_ptr() local
1200 if (__l->_M_c_string != __l->_M_data && __l->_M_c_string != 0) in _S_fetch_ptr()
1201 __clrstack[__csptr++] = __l; in _S_fetch_ptr()
1208 return __l->_M_data + __i; in _S_fetch_ptr()
1240 return _STLP_PRIV __lexicographical_compare_3way(__l->_M_data, __l->_M_data + __left_len, in _S_compare()
[all …]
H A D_string.c64 _Not_within_traits(const _CharT* __f, const _CharT* __l) in _Not_within_traits()
65 : _M_first(__f), _M_last(__l) {} in _Not_within_traits()
243 ptrdiff_t __n = __l - __f; in _M_assign()
250 _M_append(__f + size(), __l); in _M_assign()
392 const ptrdiff_t __n = __l - __f; in _M_replace()
395 if (!__self_ref || __l < __first || __f >= __last) in _M_replace()
396 _M_copy(__f, __l, __first); in _M_replace()
398 _M_move(__f, __l, __first); in _M_replace()
403 _M_insert(__last, __m, __l, __self_ref ); in _M_replace()
409 _M_insert(__last, __m, __l, true); in _M_replace()
[all …]
H A D_threads.h66 # define __add_and_fetch(__l,__v) add_then_test((unsigned long*)__l,__v) argument
67 # define __test_and_set(__l,__v) test_and_set(__l,__v) argument
H A D_rope.h503 _Rope_RopeConcatenation(_RopeRep* __l, _RopeRep* __r, allocator_type __a)
505 (max)(__l->_M_depth, __r->_M_depth) + 1, false,
506 … __l->_M_size._M_data + __r->_M_size._M_data, __a), _M_left(__l), _M_right(__r)
601 _Rope_RopeSubstring(_RopeRep* __b, size_t __s, size_t __l, allocator_type __a)
602 : _Rope_RopeFunction<_CharT,_Alloc>(this, __l, false, __a),
604 _STLP_ASSERT(__l > 0)
605 _STLP_ASSERT(__s + __l <= __b->_M_size._M_data)
1222 size_t __l, allocator_type __a) {
1225 return new(__space) _RopeSubstring(__b, __s, __l, __a);
H A D_algo.c450 _Distance __l = __n - __k; in __rotate_aux() local
456 if (__k == __l) { in __rotate_aux()
467 if (__k < __l) { in __rotate_aux()
468 for (_Distance __j = 0; __j < __l/__d; __j++) { in __rotate_aux()
469 if (__p > __first + __l) { in __rotate_aux()
470 *__p = *(__p - __l); in __rotate_aux()
471 __p -= __l; in __rotate_aux()
486 *__p = * (__p - __l); in __rotate_aux()
487 __p -= __l; in __rotate_aux()
/reactos/sdk/include/c++/stlport/stl/debug/
H A D_debug.c417 __f, __l, _Message_table[__error_ind], __f, __l, __expr); in _VerboseAssert()
452 _STLP_ACQUIRE_LOCK(__l->_M_lock); in _Invalidate_all()
453 _Stamp_all(__l, 0); in _Invalidate_all()
454 __l->_M_node._M_next =0; in _Invalidate_all()
455 _STLP_RELEASE_LOCK(__l->_M_lock); in _Invalidate_all()
463 if (__l->_M_node._M_owner) { in _Stamp_all()
475 _STLP_ACQUIRE_LOCK(__l->_M_lock); in _Verify()
476 if (__l) { in _Verify()
535 if (__l != 0) { in _M_detach()
559 if (__l ==0) { in _M_attach()
[all …]
H A D_string.h133 basic_string(const _CharT* __f, const _CharT* __l,
135 : _ConstructCheck(__f, __l), in _ConstructCheck() argument
138 basic_string(const_iterator __f, const_iterator __l,
140 : _ConstructCheck(__f, __l), in _ConstructCheck() argument
147 : _ConstructCheck(__f, __l), in basic_string()
153 : _ConstructCheck(__f, __l), in basic_string()
259 _M_non_dbg_impl.append(__f, __l); in append()
377 _M_non_dbg_impl.assign(__f, __l); in assign()
504 iterator erase(iterator __f, iterator __l) { in erase() argument
594 _InputIter __f, _InputIter __l) { in replace() argument
[all …]
H A D_hashtable.h227 void insert_unique(_InputIterator __f, _InputIterator __l) { in insert_unique() argument
228 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__f, __l)) in insert_unique()
233 void insert_equal(_InputIterator __f, _InputIterator __l){ in insert_equal() argument
234 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__f, __l)) in insert_equal()
240 _STLP_DEBUG_CHECK(_STLP_PRIV __check_ptr_range(__f, __l)) in insert_unique()
241 _M_non_dbg_impl.insert_unique(__f, __l); in insert_unique()
245 _STLP_DEBUG_CHECK(_STLP_PRIV __check_ptr_range(__f, __l)) in insert_equal()
246 _M_non_dbg_impl.insert_equal(__f, __l); in insert_equal()
250 _STLP_DEBUG_CHECK(_STLP_PRIV __check_range(__f, __l)) in insert_unique()
254 void insert_equal(const_iterator __f, const_iterator __l) { in insert_equal() argument
[all …]
H A D_iterator.h388 __construct_checker(const _InputIter& __f, const _InputIter& __l) { in __construct_checker() argument
390 _M_check_dispatch(__f, __l, _Integral()); in __construct_checker()
397 …void _M_check_dispatch(const _InputIter& __f, const _InputIter& __l, const __false_type& /*IsInteg… in _M_check_dispatch() argument
398 _STLP_DEBUG_CHECK(__check_range(__f,__l)) in _M_check_dispatch()
403 __construct_checker(const value_type* __f, const value_type* __l) { in __construct_checker() argument
404 _STLP_DEBUG_CHECK(__check_ptr_range(__f,__l)) in __construct_checker()
408 __construct_checker(const _IteType& __f, const _IteType& __l) { in __construct_checker() argument
409 _STLP_DEBUG_CHECK(__check_range(__f,__l)) in __construct_checker()
H A D_debug.h99 static void _STLP_CALL _IndexedError(int __ind, const char* __f, int __l);
104 static void _STLP_CALL _Assert(const char* __expr, const char* __f, int __l);
107 …tic void _STLP_CALL _VerboseAssert(const char* __expr, int __error_ind, const char* __f, int __l);
/reactos/sdk/lib/fslib/vfatlib/check/
H A Dbyteswap1.h122 unsigned long int __l[2]; } __w, __r; \
128 __r.__l[0] = __bswap_32 (__w.__l[1]); \
129 __r.__l[1] = __bswap_32 (__w.__l[0]); \
/reactos/sdk/include/ucrt/
H A Dtgmath.h108 inline _Lcomplex __cpowl_lc_l(_Lcomplex const __lc, long double const __l) in __cpowl_lc_l() argument
110 return cpowl(__lc, _LCbuild(__l, 0.0)); in __cpowl_lc_l()
113 inline _Lcomplex __cpowl_l_lc(long double const __l, _Lcomplex const __lc) in __cpowl_l_lc() argument
115 return cpowl(_LCbuild(__l, 0.0), __lc); in __cpowl_l_lc()
138 inline _Lcomplex __cpowl_dc_l(_Dcomplex const __dc, long double const __l) in __cpowl_dc_l() argument
140 return cpowl(_LCbuild(__dc._Val[0], __dc._Val[1]), _LCbuild(__l, 0.0)); in __cpowl_dc_l()
143 inline _Lcomplex __cpowl_l_dc(long double const __l, _Dcomplex const __dc) in __cpowl_l_dc() argument
145 return cpowl(_LCbuild(__l, 0.0), _LCbuild(__dc._Val[0], __dc._Val[1])); in __cpowl_l_dc()
148 inline _Lcomplex __cpowl_fc_l(_Fcomplex const __fc, long double const __l) in __cpowl_fc_l() argument
150 return cpowl(_LCbuild(__fc._Val[0], __fc._Val[1]), _LCbuild(__l, 0.0)); in __cpowl_fc_l()
[all …]
/reactos/sdk/lib/3rdparty/stlport/build/test/unit/
H A DSTATUS824 … ../../stlport/stl/debug/_debug.c(518): STL assertion failure : __next && __next->_Owner() == __l