/haiku/src/libs/stdc++/legacy/ |
H A D | valarray.cc | 21 __gslice_to_index(size_t __o, const valarray<size_t>& __l, const valarray<size_t>& __s, valarray<size_t>& __i) argument
|
/haiku/headers/cpp/std/ |
H A D | gslice_array.h | 96 gslice_array(_Array<_Tp> __a, const valarray<size_t>& __i) argument
|
H A D | indirect_array.h | 101 indirect_array(_Array<_Tp> __a, size_t __s, _Array<size_t> __i) argument
|
H A D | valarray_array.h | 60 __valarray_fill(_Tp* __restrict__ __a, const size_t* __restrict__ __i, argument 88 __valarray_copy(const _Tp* __restrict__ __a, const size_t* __restrict__ __i, _Tp* __restrict__ __b, size_t __n) argument 96 __valarray_copy(const _Tp* __restrict__ __a, size_t __n, _Tp* __restrict__ __b, const size_t* __restrict__ __i) argument 131 __valarray_fill(_Array<_Tp> __a, _Array<size_t> __i, size_t __n, const _Tp& __t) argument 152 __valarray_copy(_Array<_Tp> __a, _Array<size_t> __i, _Array<_Tp> __b, size_t __n) argument 158 __valarray_copy(_Array<_Tp> __a, size_t __n, _Array<_Tp> __b, _Array<size_t> __i) argument [all...] |
H A D | std_valarray.h | 270 valarray<_Tp>::operator[] (size_t __i) argument 463 operator [](const valarray<size_t>& __i) argument [all...] |
H A D | valarray_meta.h | 554 _GBase(const _Dom& __e, const valarray<size_t>& __i) argument 569 _GBase(_Array<_Tp> __a, const valarray<size_t>& __i) argument 584 _GClos(const _Dom& __e, const valarray<size_t>& __i) argument 593 _GClos(_Array<_Tp> __a, const valarray<size_t>& __i) argument 605 _IBase(const _Dom& __e, const valarray<size_t>& __i) argument 620 _IClos(const _Dom& __e, const valarray<size_t>& __i) argument 629 _IClos(const valarray<_Tp>& __a, const valarray<size_t>& __i) argument [all...] |
/haiku/headers/cpp/ |
H A D | stl_map.h | 151 iterator __i = lower_bound(__k); local
|
H A D | stl_iterator.h | 160 iterator_category(const _Iter& __i) { return __iterator_category(__i); } argument 165 distance_type(const _Iter& __i) { return __distance_type(__i); } argument 169 value_type(const _Iter& __i) { return __value_type(__i); } argument 314 __advance(_InputIter& __i, _Distance __n, input_iterator_tag) argument 323 __advance(_BidirectionalIterator& __i, _Distance __n, bidirectional_iterator_tag) argument 336 __advance(_RandomAccessIterator& __i, _Distance __n, random_access_iterator_tag) argument 342 advance(_InputIterator& __i, _Distance __n) argument 437 insert_iterator(_Container& __x, typename _Container::iterator __i) argument 463 inserter(_Container& __x, _Iterator __i) argument [all...] |
H A D | stl_alloc.h | 496 size_t __i; local 540 int __i; local 638 int __i; local [all...] |
H A D | stl_bvector.h | 117 iterator& operator+=(difference_type __i) { argument 128 iterator& operator-=(difference_type __i) { argument 143 reference operator[](difference_type __i) { return *(*this + __i); } argument 204 operator +=(difference_type __i) argument 215 operator -=(difference_type __i) argument 230 operator [](difference_type __i) argument 429 iterator __i = copy(begin(), __position, iterator(__q, 0)); local 483 iterator __i = copy(begin(), __position, iterator(__q, 0)); local 732 iterator __i = copy(begin(), __position, iterator(__q, 0)); local 753 iterator __i = copy(begin(), __position, iterator(__q, 0)); local 773 iterator __i = copy(begin(), __position, iterator(__q, 0)); local [all...] |
H A D | stl_function.h | 443 size_t __i; local [all...] |
H A D | stl_list.h | 488 void splice(iterator __position, list&, iterator __i) { argument 604 iterator __i = begin(); local 634 iterator __i local 736 int __i = 0; local 812 int __i = 0; local [all...] |
H A D | stl_vector.h | 414 iterator __i = copy(__last, _M_finish, __first); local 531 iterator __i = copy(__x.begin(), __x.end(), begin()); local
|
H A D | ropeimpl.h | 136 int __i = -1; local 197 int __i; local 776 size_t __i; local 805 size_t __i; local 814 size_t __i; local 894 size_t __i; local 1084 int __i; local 1138 int __i; // forest[0..__i-1] is empty local 1184 _S_fetch(_RopeRep* __r, size_type __i) argument 1229 _S_fetch_ptr(_RopeRep* __r, size_type __i) argument [all...] |
H A D | stl_deque.h | 1581 size_type __i; local 1602 size_type __i; local [all...] |
H A D | stl_slist.h | 642 void splice(iterator __pos, slist& __x, iterator __i) { argument 842 int __i = 0; local 915 int __i = 0; local [all...] |
H A D | stl_algo.h | 385 _ForwardIter __i = __first; local 414 _ForwardIter __i = __first; local 544 _ForwardIter __i = __first; local 553 _ForwardIter __i = __first; local 1926 _ForwardIter __i = lower_bound(__first, __last, __val); local 1934 _ForwardIter __i = lower_bound(__first, __last, __val, __comp); local [all...] |
H A D | stl_rope.h | 161 size_t __i = _M_buf_count; local 1989 void insert(size_t __p, const _CharT* __i, size_t __n) { argument 2012 void insert(size_t __p, const _CharT* __i, const _CharT* __j) { argument 2017 insert(size_t __p, const const_iterator& __i, const const_iterator& __j) argument 2023 insert(size_t __p, const iterator& __i, const iterator& __j) argument 2038 replace(size_t __p, size_t __n, const _CharT* __i, size_t __i_len) argument 2054 replace(size_t __p, size_t __n, const _CharT* __i, const _CharT* __j) argument 2060 replace(size_t __p, size_t __n, const const_iterator& __i, const const_iterator& __j) argument 2066 replace(size_t __p, size_t __n, const iterator& __i, const iterator& __j) argument 2082 replace(size_t __p, const _CharT* __i, size_t __i_len) argument 2090 replace(size_t __p, const _CharT* __i, const _CharT* __j) argument 2094 replace(size_t __p, const const_iterator& __i, const const_iterator& __j) argument 2099 replace(size_t __p, const iterator& __i, const iterator& __j) argument 2127 insert(const iterator& __p, const _CharT* __i, size_t __n) argument 2129 insert(const iterator& __p, const _CharT* __i, const _CharT* __j) argument 2132 insert(const iterator& __p, const const_iterator& __i, const const_iterator& __j) argument 2135 insert(const iterator& __p, const iterator& __i, const iterator& __j) argument 2148 replace(const iterator& __p, const iterator& __q, const _CharT* __i, size_t __n) argument 2151 replace(const iterator& __p, const iterator& __q, const _CharT* __i, const _CharT* __j) argument 2154 replace(const iterator& __p, const iterator& __q, const const_iterator& __i, const const_iterator& __j) argument 2157 replace(const iterator& __p, const iterator& __q, const iterator& __i, const iterator& __j) argument 2168 replace(const iterator& __p, const _CharT* __i, size_t __n) argument 2170 replace(const iterator& __p, const _CharT* __i, const _CharT* __j) argument 2172 replace(const iterator& __p, const_iterator __i, const_iterator __j) argument 2175 replace(const iterator& __p, iterator __i, iterator __j) argument 2481 __mutable_reference_at(crope& __c, size_t __i) argument 2486 __mutable_reference_at(wrope& __c, size_t __i) argument [all...] |