HomeSort by relevance Sort by last modified time
    Searched full:__result (Results 176 - 200 of 725) sorted by null

1 2 3 4 5 6 78 91011>>

  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
streambuf_iterator.h 297 ostreambuf_iterator<_CharT> __result)
299 if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed)
302 __copy_streambufs_eof(__first._M_sbuf, __result._M_sbuf, __ineof);
304 __result._M_failed = true;
306 return __result;
313 ostreambuf_iterator<_CharT> __result)
317 __result._M_put(__first, __num);
318 return __result;
325 ostreambuf_iterator<_CharT> __result)
329 __result._M_put(__first, __num)
    [all...]
stl_algo.h 528 _ForwardIterator1 __result = __last1; local
534 return __result;
537 __result = __new_result;
557 _ForwardIterator1 __result = __last1; local
564 return __result;
567 __result = __new_result;
604 _BidirectionalIterator1 __result = __rresult.base(); local
605 std::advance(__result, -std::distance(__first2, __last2));
606 return __result;
639 _BidirectionalIterator1 __result = __rresult.base() local
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/
streambuf_iterator.h 295 ostreambuf_iterator<_CharT> __result)
297 if (__first._M_sbuf && !__last._M_sbuf && !__result._M_failed)
300 __copy_streambufs_eof(__first._M_sbuf, __result._M_sbuf, __ineof);
302 __result._M_failed = true;
304 return __result;
311 ostreambuf_iterator<_CharT> __result)
315 __result._M_put(__first, __num);
316 return __result;
323 ostreambuf_iterator<_CharT> __result)
327 __result._M_put(__first, __num)
    [all...]
stl_algo.h 526 _ForwardIterator1 __result = __last1; local
532 return __result;
535 __result = __new_result;
555 _ForwardIterator1 __result = __last1; local
562 return __result;
565 __result = __new_result;
602 _BidirectionalIterator1 __result = __rresult.base(); local
603 std::advance(__result, -std::distance(__first2, __last2));
604 return __result;
637 _BidirectionalIterator1 __result = __rresult.base() local
    [all...]
  /external/stlport/stlport/stl/
_num_get.c 122 _Integer __result = 0; local
148 if (__result < __over_base)
151 _Integer __next = __STATIC_CAST(_Integer, __base * __result - __n);
152 if (__result != 0)
153 __ovflow = __ovflow || __next >= __result;
154 __result = __next;
166 : __is_negative ? __result
167 : __STATIC_CAST(_Integer, -__result);
182 _Integer __result = 0; local
208 if (__result > __over_base
261 bool __result; local
    [all...]
_rope.c 381 _RopeLeaf* __result; local
387 __result = _S_new_RopeLeaf(__new_data, __old_len + __len, __r->get_allocator());
391 return __result;
432 _RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len); local
433 //_STLP_ASSERT(__result->_M_ref_count == 1)
434 return __result;
444 _RopeConcatenation* __result = local
446 size_t __depth = __result->_M_depth;
449 if (__depth > 20 && (__result->_M_size._M_data < 1000 ||
454 __balanced = _S_balance(__result);
476 _RopeRep* __result; local
519 _RopeRep* __result; local
645 _RopeRep* __result; local
656 __result = _S_concat_rep(__left_result, __right_result); local
664 _RopeLeaf* __result; local
683 _RopeSubstring* __result = _S_new_RopeSubstring(__old->_M_base, local
826 bool __result; local
1030 _RopeRep* __result = 0; local
1154 _CharT __result; local
1319 _CharT* __result = _STLP_CREATE_ALLOCATOR(allocator_type,(const allocator_type&)_M_tree_ptr, _CharT).allocate(__s + 1); local
1345 _CharT* __result = _M_tree_ptr.allocate(_S_rounded_up_size(__s)); local
    [all...]
_bitset.h 77 size_t __result = 0; local
80 if ((*__beg & (1 << i)) != 0) { ++__result; }
83 return __result;
569 basic_string<_CharT, _Traits, _Alloc> __result; local
570 _M_copy_to_string(__result);
571 return __result;
575 string __result; local
576 _M_copy_to_string(__result);
577 return __result;
603 bitset<_Nb> __result(*this)
    [all...]
  /ndk/sources/cxx-stl/stlport/stlport/stl/
_num_get.c 122 _Integer __result = 0; local
148 if (__result < __over_base)
151 _Integer __next = __STATIC_CAST(_Integer, __base * __result - __n);
152 if (__result != 0)
153 __ovflow = __ovflow || __next >= __result;
154 __result = __next;
166 : __is_negative ? __result
167 : __STATIC_CAST(_Integer, -__result);
182 _Integer __result = 0; local
208 if (__result > __over_base
261 bool __result; local
    [all...]
_rope.c 381 _RopeLeaf* __result; local
387 __result = _S_new_RopeLeaf(__new_data, __old_len + __len, __r->get_allocator());
391 return __result;
432 _RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len); local
433 //_STLP_ASSERT(__result->_M_ref_count == 1)
434 return __result;
444 _RopeConcatenation* __result = local
446 size_t __depth = __result->_M_depth;
449 if (__depth > 20 && (__result->_M_size._M_data < 1000 ||
454 __balanced = _S_balance(__result);
476 _RopeRep* __result; local
519 _RopeRep* __result; local
645 _RopeRep* __result; local
656 __result = _S_concat_rep(__left_result, __right_result); local
664 _RopeLeaf* __result; local
683 _RopeSubstring* __result = _S_new_RopeSubstring(__old->_M_base, local
826 bool __result; local
1030 _RopeRep* __result = 0; local
1154 _CharT __result; local
1319 _CharT* __result = _STLP_CREATE_ALLOCATOR(allocator_type,(const allocator_type&)_M_tree_ptr, _CharT).allocate(__s + 1); local
1345 _CharT* __result = _M_tree_ptr.allocate(_S_rounded_up_size(__s)); local
    [all...]
_bitset.h 77 size_t __result = 0; local
80 if ((*__beg & (1 << i)) != 0) { ++__result; }
83 return __result;
569 basic_string<_CharT, _Traits, _Alloc> __result; local
570 _M_copy_to_string(__result);
571 return __result;
575 string __result; local
576 _M_copy_to_string(__result);
577 return __result;
603 bitset<_Nb> __result(*this)
    [all...]
  /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/
_num_get.c 122 _Integer __result = 0; local
148 if (__result < __over_base)
151 _Integer __next = __STATIC_CAST(_Integer, __base * __result - __n);
152 if (__result != 0)
153 __ovflow = __ovflow || __next >= __result;
154 __result = __next;
166 : __is_negative ? __result
167 : __STATIC_CAST(_Integer, -__result);
182 _Integer __result = 0; local
208 if (__result > __over_base
261 bool __result; local
    [all...]
_rope.c 381 _RopeLeaf* __result; local
387 __result = _S_new_RopeLeaf(__new_data, __old_len + __len, __r->get_allocator());
391 return __result;
432 _RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len); local
433 //_STLP_ASSERT(__result->_M_ref_count == 1)
434 return __result;
444 _RopeConcatenation* __result = local
446 size_t __depth = __result->_M_depth;
449 if (__depth > 20 && (__result->_M_size._M_data < 1000 ||
454 __balanced = _S_balance(__result);
476 _RopeRep* __result; local
519 _RopeRep* __result; local
645 _RopeRep* __result; local
656 __result = _S_concat_rep(__left_result, __right_result); local
664 _RopeLeaf* __result; local
683 _RopeSubstring* __result = _S_new_RopeSubstring(__old->_M_base, local
826 bool __result; local
1030 _RopeRep* __result = 0; local
1154 _CharT __result; local
1319 _CharT* __result = _STLP_CREATE_ALLOCATOR(allocator_type,(const allocator_type&)_M_tree_ptr, _CharT).allocate(__s + 1); local
1345 _CharT* __result = _M_tree_ptr.allocate(_S_rounded_up_size(__s)); local
    [all...]
  /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/
_num_get.c 122 _Integer __result = 0; local
148 if (__result < __over_base)
151 _Integer __next = __STATIC_CAST(_Integer, __base * __result - __n);
152 if (__result != 0)
153 __ovflow = __ovflow || __next >= __result;
154 __result = __next;
166 : __is_negative ? __result
167 : __STATIC_CAST(_Integer, -__result);
182 _Integer __result = 0; local
208 if (__result > __over_base
261 bool __result; local
    [all...]
_rope.c 381 _RopeLeaf* __result; local
387 __result = _S_new_RopeLeaf(__new_data, __old_len + __len, __r->get_allocator());
391 return __result;
432 _RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len); local
433 //_STLP_ASSERT(__result->_M_ref_count == 1)
434 return __result;
444 _RopeConcatenation* __result = local
446 size_t __depth = __result->_M_depth;
449 if (__depth > 20 && (__result->_M_size._M_data < 1000 ||
454 __balanced = _S_balance(__result);
476 _RopeRep* __result; local
519 _RopeRep* __result; local
645 _RopeRep* __result; local
656 __result = _S_concat_rep(__left_result, __right_result); local
664 _RopeLeaf* __result; local
683 _RopeSubstring* __result = _S_new_RopeSubstring(__old->_M_base, local
826 bool __result; local
1030 _RopeRep* __result = 0; local
1154 _CharT __result; local
1319 _CharT* __result = _STLP_CREATE_ALLOCATOR(allocator_type,(const allocator_type&)_M_tree_ptr, _CharT).allocate(__s + 1); local
1345 _CharT* __result = _M_tree_ptr.allocate(_S_rounded_up_size(__s)); local
    [all...]
  /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/
_num_get.c 122 _Integer __result = 0; local
148 if (__result < __over_base)
151 _Integer __next = __STATIC_CAST(_Integer, __base * __result - __n);
152 if (__result != 0)
153 __ovflow = __ovflow || __next >= __result;
154 __result = __next;
166 : __is_negative ? __result
167 : __STATIC_CAST(_Integer, -__result);
182 _Integer __result = 0; local
208 if (__result > __over_base
261 bool __result; local
    [all...]
_rope.c 381 _RopeLeaf* __result; local
387 __result = _S_new_RopeLeaf(__new_data, __old_len + __len, __r->get_allocator());
391 return __result;
432 _RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len); local
433 //_STLP_ASSERT(__result->_M_ref_count == 1)
434 return __result;
444 _RopeConcatenation* __result = local
446 size_t __depth = __result->_M_depth;
449 if (__depth > 20 && (__result->_M_size._M_data < 1000 ||
454 __balanced = _S_balance(__result);
476 _RopeRep* __result; local
519 _RopeRep* __result; local
645 _RopeRep* __result; local
656 __result = _S_concat_rep(__left_result, __right_result); local
664 _RopeLeaf* __result; local
683 _RopeSubstring* __result = _S_new_RopeSubstring(__old->_M_base, local
826 bool __result; local
1030 _RopeRep* __result = 0; local
1154 _CharT __result; local
1319 _CharT* __result = _STLP_CREATE_ALLOCATOR(allocator_type,(const allocator_type&)_M_tree_ptr, _CharT).allocate(__s + 1); local
1345 _CharT* __result = _M_tree_ptr.allocate(_S_rounded_up_size(__s)); local
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/
_num_get.c 122 _Integer __result = 0; local
148 if (__result < __over_base)
151 _Integer __next = __STATIC_CAST(_Integer, __base * __result - __n);
152 if (__result != 0)
153 __ovflow = __ovflow || __next >= __result;
154 __result = __next;
166 : __is_negative ? __result
167 : __STATIC_CAST(_Integer, -__result);
182 _Integer __result = 0; local
208 if (__result > __over_base
261 bool __result; local
    [all...]
_rope.c 381 _RopeLeaf* __result; local
387 __result = _S_new_RopeLeaf(__new_data, __old_len + __len, __r->get_allocator());
391 return __result;
432 _RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len); local
433 //_STLP_ASSERT(__result->_M_ref_count == 1)
434 return __result;
444 _RopeConcatenation* __result = local
446 size_t __depth = __result->_M_depth;
449 if (__depth > 20 && (__result->_M_size._M_data < 1000 ||
454 __balanced = _S_balance(__result);
476 _RopeRep* __result; local
519 _RopeRep* __result; local
645 _RopeRep* __result; local
656 __result = _S_concat_rep(__left_result, __right_result); local
664 _RopeLeaf* __result; local
683 _RopeSubstring* __result = _S_new_RopeSubstring(__old->_M_base, local
826 bool __result; local
1030 _RopeRep* __result = 0; local
1154 _CharT __result; local
1319 _CharT* __result = _STLP_CREATE_ALLOCATOR(allocator_type,(const allocator_type&)_M_tree_ptr, _CharT).allocate(__s + 1); local
1345 _CharT* __result = _M_tree_ptr.allocate(_S_rounded_up_size(__s)); local
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/
_num_get.c 122 _Integer __result = 0; local
148 if (__result < __over_base)
151 _Integer __next = __STATIC_CAST(_Integer, __base * __result - __n);
152 if (__result != 0)
153 __ovflow = __ovflow || __next >= __result;
154 __result = __next;
166 : __is_negative ? __result
167 : __STATIC_CAST(_Integer, -__result);
182 _Integer __result = 0; local
208 if (__result > __over_base
261 bool __result; local
    [all...]
_rope.c 381 _RopeLeaf* __result; local
387 __result = _S_new_RopeLeaf(__new_data, __old_len + __len, __r->get_allocator());
391 return __result;
432 _RopeLeaf* __result = _S_leaf_concat_char_iter(__r, __iter, __len); local
433 //_STLP_ASSERT(__result->_M_ref_count == 1)
434 return __result;
444 _RopeConcatenation* __result = local
446 size_t __depth = __result->_M_depth;
449 if (__depth > 20 && (__result->_M_size._M_data < 1000 ||
454 __balanced = _S_balance(__result);
476 _RopeRep* __result; local
519 _RopeRep* __result; local
645 _RopeRep* __result; local
656 __result = _S_concat_rep(__left_result, __right_result); local
664 _RopeLeaf* __result; local
683 _RopeSubstring* __result = _S_new_RopeSubstring(__old->_M_base, local
826 bool __result; local
1030 _RopeRep* __result = 0; local
1154 _CharT __result; local
1319 _CharT* __result = _STLP_CREATE_ALLOCATOR(allocator_type,(const allocator_type&)_M_tree_ptr, _CharT).allocate(__s + 1); local
1345 _CharT* __result = _M_tree_ptr.allocate(_S_rounded_up_size(__s)); local
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/bits/
string2.h 843 (__extension__ ({ register int __result = \
846 if (l > 0 && __result == 0) \
848 __result = (((__const unsigned char *) \
852 if (l > 1 && __result == 0) \
854 __result = \
859 if (l > 2 && __result == 0) \
860 __result = \
867 __result; }))
872 register int __result = \
875 if (l1 > 0 && __result == 0)
973 register size_t __result = 0; local
984 register size_t __result = 0; local
997 register size_t __result = 0; local
1049 register size_t __result = 0; local
1061 register size_t __result = 0; local
1073 register size_t __result = 0; local
1177 char *__result; local
    [all...]
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/bits/
string2.h 843 (__extension__ ({ register int __result = \
846 if (l > 0 && __result == 0) \
848 __result = (((__const unsigned char *) \
852 if (l > 1 && __result == 0) \
854 __result = \
859 if (l > 2 && __result == 0) \
860 __result = \
867 __result; }))
872 register int __result = \
875 if (l1 > 0 && __result == 0)
973 register size_t __result = 0; local
984 register size_t __result = 0; local
997 register size_t __result = 0; local
1049 register size_t __result = 0; local
1061 register size_t __result = 0; local
1073 register size_t __result = 0; local
1177 char *__result; local
    [all...]
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/bits/
string2.h 843 (__extension__ ({ register int __result = \
846 if (l > 0 && __result == 0) \
848 __result = (((__const unsigned char *) \
852 if (l > 1 && __result == 0) \
854 __result = \
859 if (l > 2 && __result == 0) \
860 __result = \
867 __result; }))
872 register int __result = \
875 if (l1 > 0 && __result == 0)
973 register size_t __result = 0; local
984 register size_t __result = 0; local
997 register size_t __result = 0; local
1049 register size_t __result = 0; local
1061 register size_t __result = 0; local
1073 register size_t __result = 0; local
1177 char *__result; local
    [all...]
  /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/
stl_algo.h 528 _ForwardIterator1 __result = __last1; local
534 return __result;
537 __result = __new_result;
557 _ForwardIterator1 __result = __last1; local
564 return __result;
567 __result = __new_result;
604 _BidirectionalIterator1 __result = __rresult.base(); local
605 std::advance(__result, -std::distance(__first2, __last2));
606 return __result;
639 _BidirectionalIterator1 __result = __rresult.base() local
    [all...]
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/
set_operations.h 352 _OutputIterator __result, _Operation __op)
361 return __op.__first_empty(__begin2, __end2, __result);
364 return __op.__second_empty(__begin1, __end1, __result);
370 _OutputIterator __return_value = __result;
430 __result) - __result;
442 _OutputIterator __r = __result;
477 _OutputIterator __result, _Compare __comp)
480 __result,
491 _OutputIterator __result, _Compare __comp
    [all...]

Completed in 2937 milliseconds

1 2 3 4 5 6 78 91011>>