Home
last modified time | relevance | path

Searched refs:__tmp (Results 1 – 19 of 19) sorted by relevance

/haiku/headers/cpp/
H A Dstl_hashtable.h583 iterator __tmp = *this;
585 return __tmp;
608 const_iterator __tmp = *this;
610 return __tmp;
709 _Node* __tmp = _M_new_node(__obj);
710 __tmp->_M_next = __first;
711 _M_buckets[__n] = __tmp;
713 return pair<iterator, bool>(iterator(__tmp, this), true);
726 _Node* __tmp = _M_new_node(__obj);
727 __tmp->_M_next = __cur->_M_next;
[all …]
H A Dstl_bvector.h70 bool __tmp = __x; in swap() local
72 __y = __tmp; in swap()
104 iterator __tmp = *this; member
106 return __tmp;
113 iterator __tmp = *this; member
115 return __tmp;
133 iterator __tmp = *this; member
134 return __tmp += __i;
137 iterator __tmp = *this; member
138 return __tmp -= __i;
[all …]
H A Dstl_iterator.h493 _BidirectionalIterator __tmp = current;
494 return *--__tmp;
504 _Self __tmp = *this;
506 return __tmp;
513 _Self __tmp = *this;
515 return __tmp;
602 _Iterator __tmp = current;
603 return *--__tmp;
614 _Self __tmp = *this;
616 return __tmp;
[all …]
H A Dstl_numeric.h130 _Tp __tmp = *__first; in __adjacent_difference() local
131 *++__result = __tmp - __value; in __adjacent_difference()
132 __value = __tmp; in __adjacent_difference()
156 _Tp __tmp = *__first; in __adjacent_difference() local
157 *++__result = __binary_op(__tmp, __value); in __adjacent_difference()
158 __value = __tmp; in __adjacent_difference()
H A Dstl_raw_storage_iter.h58 raw_storage_iterator<_ForwardIterator, _Tp> __tmp = *this; variable
60 return __tmp;
H A Dstl_tempbuf.h45 _Tp* __tmp = (_Tp*) malloc((size_t)__len * sizeof(_Tp)); in __get_temporary_buffer() local
46 if (__tmp != 0) in __get_temporary_buffer()
47 return pair<_Tp*, ptrdiff_t>(__tmp, __len); in __get_temporary_buffer()
H A Dstl_list.h82 _Self __tmp = *this; member
84 return __tmp;
91 _Self __tmp = *this; member
93 return __tmp;
237 _List_node<_Tp>* __tmp = __cur; in clear() local
239 destroy(&__tmp->_M_data); in clear()
240 _M_put_node(__tmp); in clear()
344 _Node* __tmp = _M_create_node(__x); in insert() local
345 __tmp->_M_next = __position._M_node; in insert()
346 __tmp->_M_prev = __position._M_node->_M_prev; in insert()
[all …]
H A Dstl_vector.h286 iterator __tmp = _M_allocate_and_copy(__n, _M_start, _M_finish); in reserve() local
289 _M_start = __tmp; in reserve()
290 _M_finish = __tmp + __old_size; in reserve()
524 iterator __tmp = _M_allocate_and_copy(__xlen, __x.begin(), __x.end()); variable
527 _M_start = __tmp;
546 vector<_Tp, _Alloc> __tmp(__n, __val, get_allocator()); in assign()
547 __tmp.swap(*this); in assign()
579 iterator __tmp = _M_allocate_and_copy(__len, __first, __last); in _M_assign_aux() local
582 _M_start = __tmp; in _M_assign_aux()
H A Dstl_deque.h155 _Self __tmp = *this; member
157 return __tmp;
169 _Self __tmp = *this; member
171 return __tmp;
192 _Self __tmp = *this; member
193 return __tmp += __n;
199 _Self __tmp = *this; member
200 return __tmp -= __n;
550 iterator __tmp = _M_finish; in back() local
551 --__tmp; in back()
[all …]
H A Dmemory67 _Tp* __tmp = _M_ptr;
69 return __tmp;
H A Dstl_tree.h174 _Self __tmp = *this; member
176 return __tmp;
181 _Self __tmp = *this; member
183 return __tmp;
554 _Link_type __tmp = _M_get_node(); in _M_create_node() local
556 construct(&__tmp->_M_value_field, __x); in _M_create_node()
558 __STL_UNWIND(_M_put_node(__tmp)); in _M_create_node()
559 return __tmp; in _M_create_node()
564 _Link_type __tmp = _M_create_node(__x->_M_value_field); in _M_clone_node() local
565 __tmp->_M_color = __x->_M_color; in _M_clone_node()
[all …]
H A Dstl_algobase.h65 _Tp __tmp = *__a; in __iter_swap() local
67 *__b = __tmp; in __iter_swap()
77 _Tp __tmp = __a; in swap() local
79 __b = __tmp; in swap()
H A Dbitset894 string __tmp;
895 __tmp.reserve(_Nb);
918 __tmp.push_back(__c);
921 if (__tmp.empty())
924 __x._M_copy_from_string(__tmp, static_cast<size_t>(0), _Nb);
931 string __tmp;
932 __x._M_copy_to_string(__tmp);
933 return __os << __tmp;
H A Dstl_slist.h150 _Self __tmp = *this; member
152 return __tmp;
290 _Slist_node<_Tp>* __tmp = __cur; in _M_erase_after() local
292 destroy(&__tmp->_M_data); in _M_erase_after()
293 _M_put_node(__tmp); in _M_erase_after()
H A Dstl_algo.h289 _ForwardIter2 __tmp(__first2); in search()
290 ++__tmp; in search()
291 if (__tmp == __last2) in search()
334 _ForwardIter2 __tmp(__first2); in search()
335 ++__tmp; in search()
336 if (__tmp == __last2) in search()
784 _Tp __tmp = *__first; in __rotate() local
811 *__p = __tmp; in __rotate()
H A Dstl_rope.h791 _CharT __tmp = __a; in swap() local
793 __b = __tmp; in swap()
805 _CharT __tmp = __a; \
807 __b = __tmp; \
1944 _RopeRep* __tmp = _M_tree_ptr;
1946 __b._M_tree_ptr = __tmp;
/haiku/src/libs/compat/openbsd_wlan/sys/
H A Dtree.h186 struct type *__tmp; \
194 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
197 SPLAY_RIGHT((head)->sph_root, field) = __tmp; \
207 struct type __node, *__left, *__right, *__tmp; \
215 __tmp = SPLAY_LEFT((head)->sph_root, field); \
216 if (__tmp == NULL) \
218 if ((cmp)(elm, __tmp) < 0){ \
219 SPLAY_ROTATE_RIGHT(head, __tmp, field); \
225 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
226 if (__tmp == NULL) \
[all …]
/haiku/src/system/libroot/posix/glibc/extensions/
H A Dgetopt.c284 char __tmp = __getopt_nonoption_flags[ch1]; \
286 __getopt_nonoption_flags[ch2] = __tmp; \
/haiku/src/system/libroot/posix/glibc/stdlib/
H A Dlonglong.h291 USItype __tmp; \
308 : "=r" (count), "=r" (__tmp) : "1" (x)); \