| /external/stlport/stlport/stl/ |
| D | _uninitialized.h | 159 template <class _InputIter, class _Size, class _ForwardIter>
162 __ucopy_n(_InputIter __first, _Size __count, _ForwardIter __result, in __ucopy_n()
175 template <class _InputIter, class _Size, class _ForwardIterator>
177 __ucopy_n(_InputIter __first, _Size __count, in __ucopy_n()
182 template <class _InputIter, class _Size, class _ForwardIterator>
184 __ucopy_n(_InputIter __first, _Size __count, in __ucopy_n()
190 template <class _RandomAccessIter, class _Size, class _ForwardIter>
192 __ucopy_n(_RandomAccessIter __first, _Size __count, _ForwardIter __result, in __ucopy_n()
199 template <class _InputIter, class _Size, class _ForwardIter>
201 __ucopy_n(_InputIter __first, _Size __count, _ForwardIter __result) in __ucopy_n()
[all …]
|
| D | _algobase.h | 375 template <class _InputIter, class _Size, class _OutputIter> in _STLP_DECLARE_COPY_TRIVIAL()
377 __copy_n(_InputIter __first, _Size __count, _OutputIter __result, in _STLP_DECLARE_COPY_TRIVIAL()
387 template <class _RAIter, class _Size, class _OutputIter>
389 __copy_n(_RAIter __first, _Size __count, _OutputIter __result, in __copy_n()
397 template <class _InputIter, class _Size, class _OutputIter>
399 copy_n(_InputIter __first, _Size __count, _OutputIter __result) { in copy_n()
476 template <class _OutputIter, class _Size, class _Tp>
478 _OutputIter __fill_n(_OutputIter __first, _Size __n, const _Tp& __val) { in __fill_n()
486 template <class _Size>
487 inline unsigned char* __fill_n(unsigned char* __first, _Size __n, in __fill_n()
[all …]
|
| D | _algo.h | 104 template <class _InputIter, class _Tp, class _Size>
106 count(_InputIter __first, _InputIter __last, const _Tp& __val, _Size& __n) { in count()
113 template <class _InputIter, class _Predicate, class _Size>
115 count_if(_InputIter __first, _InputIter __last, _Predicate __pred, _Size& __n) { in count_if()
228 template <class _OutputIter, class _Size, class _Generator>
230 generate_n(_OutputIter __first, _Size __n, _Generator __gen) { in generate_n()
408 template <class _Size>
409 inline _Size __lg(_Size __n) { in __lg()
410 _Size __k; in __lg()
|
| D | _valarray.c | 66 template <class _Size>
67 bool _Gslice_Iter_tmpl<_Size>::_M_incr() { in _M_incr()
|
| D | _string_sum.h | 48 _CStr(__cstr), _Size(__size) {} in __cstr_wrapper()
52 size_t size() const { return _Size; } in size()
58 size_t _Size; member
|
| D | _valarray.h | 1236 template <class _Size>
1282 template <class _Size>
1294 _Size _M_step;
1295 _Size _M_1d_idx;
1297 valarray<_Size> _M_indices;
|
| D | _algo.c | 969 template <class _RandomAccessIter, class _Tp, class _Size, class _Compare>
972 _Size __depth_limit, _Compare __comp) { in __introsort_loop()
|
| /external/srec/portable/src/ |
| D | pmalloc.c | 247 passert(SIZE_CELL <= p->_Size); in _OK_Cell()
278 total_free += q->_Size; in _OK_Altab()
282 passert(_PTR_NORM((char *)q + q->_Size) <= in _OK_Altab()
305 if (size <= (*qb)->_Size) in findmem()
311 if (size <= (*qb)->_Size) in findmem()
316 if (size <= (*qb)->_Size) in findmem()
332 q->_Size = bs; in findmem()
333 _UPD_Altab(q->_Size, q->_Size, 0); /* heap=alloc+free */ in findmem()
361 if (q->_Size - SIZE_CELL < size)
413 (*qb)->_Size = q->_Size - size;
[all …]
|
| /external/srec/portable/include/ |
| D | pmalloc.h | 61 psize_t _Size; /* CELL_OFF <= SIZE_CELL <= _Size */ member
|
| /external/chromium/third_party/icu/public/common/unicode/ |
| D | utypes.h | 536 _Ret_bytecap_(_Size) in _Ret_bytecap_() argument
|
| /external/icu4c/common/unicode/ |
| D | utypes.h | 562 _Ret_bytecap_(_Size) in _Ret_bytecap_() argument
|
| /external/stlport/stlport/ |
| D | type_traits | 471 template <class _Tp, std::size_t _Size>
472 struct remove_all_extents<_Tp[_Size]>
|