| /haiku/headers/cpp/ |
| H A D | stl_heap.h | 109 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value) argument
156 __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex, _Distance __len, _Tp __value, _Compare __comp) argument
[all...] |
| H A D | stl_tempbuf.h | 39 __get_temporary_buffer(ptrdiff_t __len, _Tp*) argument
57 inline pair<_Tp*, ptrdiff_t> get_temporary_buffer(ptrdiff_t __len) { argument
69 inline pair<_Tp*, ptrdiff_t> get_temporary_buffer(ptrdiff_t __len, _T argument
[all...] |
| H A D | stl_bvector.h | 427 size_type __len = size() ? 2 * size() : __WORD_BIT; local
481 size_type __len = size() + max(size(), __n); local
649 size_type __len = 0; local
730 size_type __len local
751 size_type __len = size() + max(size(), __n); local
771 size_type __len = size() + max(size(), __n); local
[all...] |
| H A D | stl_list.h | 605 size_type __len = 0; local
|
| H A D | stl_vector.h | 575 size_type __len = 0; local
613 const size_type __len = __old_size != 0 ? 2 * __old_size : 1; local
644 const size_type __len = __old_size != 0 ? 2 * __old_size : 1; local
688 const size_type __len = __old_size + max(__old_size, __n); local
754 const size_type __len = __old_size + max(__old_size, __n); local
804 const size_type __len = __old_size + max(__old_size, __n); local
[all...] |
| H A D | ropeimpl.h | 49 size_t __len = _S_iterator_buf_len; local
157 size_t __len local
385 _S_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter, size_t __len) argument
409 _S_destr_leaf_concat_char_iter(_RopeLeaf* __r, const _CharT* __iter, size_t __len) argument
871 size_t __len = __end - __begin; local
938 _S_flatten(_RopeRep* __r, size_t __start, size_t __len, _CharT* __buffer) argument
[all...] |
| H A D | stl_deque.h | 614 const size_type __len = size(); local
678 size_type __len = 0; local
804 const size_type __len = size(); local
|
| H A D | stl_slist.h | 777 void slist<_Tp,_Alloc>::resize(size_type __len, const _Tp& __x) argument
|
| H A D | stl_tree.h | 1278 int __len = __black_count(_M_leftmost(), _M_root()); local
|
| H A D | stl_algo.h | 1033 __inplace_stable_partition(_ForwardIter __first, _ForwardIter __last, _Predicate __pred, _Distance __len) argument
1049 __stable_partition_adaptive(_ForwardIter __first, _ForwardIter __last, _Predicate __pred, _Distance __len, _Pointer __buffer, _Distance __buffer_size) argument
1441 _Distance __len = __last - __first; local
1460 _Distance __len = __last - __first; local
1478 _Distance __len = (__last - __first + 1) / 2; local
1497 _Distance __len = (__last - __first + 1) / 2; local
1726 _Distance __len = 0; local
1757 _Distance __len = 0; local
1788 _Distance __len = 0; local
1819 _Distance __len = 0; local
1851 _Distance __len = 0; local
1889 _Distance __len = 0; local
[all...] |
| H A D | stl_rope.h | 158 void append(value_type* __s, size_t __len) argument
174 sequence_buffer& write(value_type* __s, size_t __len) argument
1619 rope(const _CharT* __s, size_t __len, const allocator_type& __a = allocator_type()) argument
1663 rope(char_producer<_CharT> *__fn, size_t __len, bool __delete_fn, const allocator_type& __a = allocator_type()) argument
1759 size_t __len = (__pos + __n > __size? __size - __pos : __n); local
1888 size_t __len = _S_char_ptr_len(__c_string); local
[all...] |