| /external/stlport/stlport/stl/ |
| H A D | _rope.c | 174 _RopeRep* __left = __c->_M_left; local
175 size_t __left_len = __left->_M_size._M_data;
183 __curr_rope = __left;
443 rope<_CharT,_Alloc>::_S_tree_concat (_RopeRep* __left, _RopeRep* __right) { argument
445 _S_new_RopeConcatenation(__left, __right, __left->get_allocator());
448 _STLP_ASSERT(__left->get_allocator() == __right->get_allocator())
460 _STLP_UNWIND((_STLP_CREATE_ALLOCATOR(allocator_type,(allocator_type&)__left->_M_size,
493 _RopeRep* __left = ((_RopeConcatenation*)__r)->_M_left; local
495 __left
577 _S_concat_rep(_RopeRep* __left, _RopeRep* __right) argument
642 _RopeRep* __left = __c->_M_left; local
798 _RopeRep* __left = __conc->_M_left; local
854 const bool __left = (__o.flags() & ios::left) != 0; local
924 _RopeRep* __left = __c->_M_left; local
960 _RopeRep* __left = __c->_M_left; local
1134 _RopeRep* __left = __c->_M_left; local
1185 _RopeRep* __left = __c->_M_left; local
1227 _S_compare(const _RopeRep* __left, const _RopeRep* __right) argument
[all...] |
| H A D | _rope.h | 1178 static _RopeRep* _S_concat_rep(_RopeRep* __left, _RopeRep* __right);
1209 static _RopeConcatenation* _S_new_RopeConcatenation(_RopeRep* __left, _RopeRep* __right, argument
1213 return new(__space) _RopeConcatenation(__left, __right, __a);
1255 _S_tree_concat(_RopeRep* __left, _RopeRep* __right);
1317 static _RopeRep* _S_concat_and_set_balanced(_RopeRep* __left, argument
1319 _RopeRep* __result = _S_concat_rep(__left, __right);
1521 _RopeRep* __left = local
1524 _M_tree_ptr._M_data = _S_concat_rep(__left, _M_tree_ptr._M_data);
1526 _S_unref(__left);
1528 _STLP_UNWIND(_S_unref(__left))
2195 operator +(const rope<_CharT,_Alloc>& __left, const rope<_CharT,_Alloc>& __right) argument
2204 operator +=(rope<_CharT,_Alloc>& __left, const rope<_CharT,_Alloc>& __right) argument
2212 operator +(const rope<_CharT,_Alloc>& __left, const _CharT* __right) argument
2220 operator +=(rope<_CharT,_Alloc>& __left, const _CharT* __right) argument
2228 operator +(const rope<_CharT,_Alloc>& __left, _CharT __right) argument
2234 operator +=(rope<_CharT,_Alloc>& __left, _CharT __right) argument
2241 operator <(const rope<_CharT,_Alloc>& __left, const rope<_CharT,_Alloc>& __right) argument
2248 operator ==(const rope<_CharT,_Alloc>& __left, const rope<_CharT,_Alloc>& __right) argument
[all...] |
| H A D | _string_io.c | 44 const bool __left = (__os.flags() & __ostream::left) != 0; local
52 if (!__left)
57 if (__left)
|
| H A D | _algo.c | 1401 _ForwardIter __left = _STLP_PRIV __lower_bound(__first, __middle, __val, __comp1, __comp2, __dist); local
1404 if (__comp1(*__left, __val)) {
1405 _STLP_VERBOSE_ASSERT(!__comp2(__val, *__left), _StlMsg_INVALID_STRICT_WEAK_PREDICATE)
1406 return pair<_ForwardIter, _ForwardIter>(__left, __left);
1410 return pair<_ForwardIter, _ForwardIter>(__left, __right);
|
| /external/chromium_org/third_party/bsdtrees/ |
| H A D | tree.h | 205 struct type __node, *__left, *__right, *__tmp; \
209 __left = __right = &__node; \
231 SPLAY_LINKRIGHT(head, __left, field); \
234 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
242 struct type __node, *__left, *__right, *__tmp; \
245 __left = __right = &__node; \
267 SPLAY_LINKRIGHT(head, __left, field); \
270 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
|
| /external/qemu/ |
| H A D | sys-tree.h | 216 SYS_TREE_STRUCT type __node, *__left, *__right, *__tmp; \
220 __left = __right = &__node; \
242 SPLAY_LINKRIGHT(head, __left, field); \
245 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
253 SYS_TREE_STRUCT type __node, *__left, *__right, *__tmp; \
256 __left = __right = &__node; \
278 SPLAY_LINKRIGHT(head, __left, field); \
281 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
|