| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| forward_list.h | 618 * @param __val Value to be assigned.
626 assign(size_type __n, const _Tp& __val)
627 { _M_assign_n(__n, __val, is_copy_assignable<_Tp>()); }
787 * @param __val Data to be added.
796 push_front(const _Tp& __val)
797 { this->_M_insert_after(cbefore_begin(), __val); } local
803 push_front(_Tp&& __val)
804 { this->_M_insert_after(cbefore_begin(), std::move(__val)); }
845 * @param __val Data to be inserted.
854 insert_after(const_iterator __pos, const _Tp& __val)
1326 insert_after(cbefore_begin(), __n, __val); local
[all...] |
| stl_deque.h | 1742 std::fill(begin(), end(), __val); local
1743 insert(end(), __n - size(), __val); local
1748 std::fill(begin(), end(), __val); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/ |
| algo.h | 131 find(_IIter __begin, _IIter __end, const _Tp& __val,
133 { return _GLIBCXX_STD_A::find(__begin, __end, __val); }
138 __find_switch(_IIter __begin, _IIter __end, const _Tp& __val,
140 { return _GLIBCXX_STD_A::find(__begin, __end, __val); }
146 const _Tp& __val, random_access_iterator_tag)
154 __comp(__gnu_parallel::_EqualTo<_ValueType, const _Tp&>(), __val); local
160 return _GLIBCXX_STD_A::find(__begin, __end, __val);
166 find(_IIter __begin, _IIter __end, const _Tp& __val)
170 return __find_switch(__begin, __end, __val, _IteratorCategory());
[all...] |
| /prebuilts/gcc/linux-x86/mips/mips64el-linux-android-4.9/lib/gcc/mips64el-linux-android/4.9/include/ |
| stdatomic.h | 235 _Bool __val; member in struct:__anon50940
237 unsigned char __val;
|
| /prebuilts/gcc/linux-x86/x86/x86_64-linux-android-4.9/lib/gcc/x86_64-linux-android/4.9/include/ |
| stdatomic.h | 235 _Bool __val; member in struct:__anon50963
237 unsigned char __val;
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| forward_list.h | 615 assign(size_type __n, const _Tp& __val)
618 insert_after(cbefore_begin(), __n, __val); local
793 push_front(const _Tp& __val)
794 { this->_M_insert_after(cbefore_begin(), __val); } local
800 push_front(_Tp&& __val)
801 { this->_M_insert_after(cbefore_begin(), std::move(__val)); }
851 insert_after(const_iterator __pos, const _Tp& __val)
852 { return iterator(this->_M_insert_after(__pos, __val)); }
858 insert_after(const_iterator __pos, _Tp&& __val)
859 { return iterator(this->_M_insert_after(__pos, std::move(__val))); }
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _list.h | 306 explicit list(size_type __n, const_reference __val = _STLP_DEFAULT_CONSTRUCTED(value_type),
312 list(size_type __n, const_reference __val)
314 { this->insert(begin(), __n, __val); }
315 list(size_type __n, const_reference __val, const allocator_type& __a)
318 { this->insert(begin(), __n, __val); } local
555 void assign(size_type __n, const_reference __val) { _M_fill_assign(__n, __val); }
557 void _M_fill_assign(size_type __n, const_reference __val);
567 void _M_assign_dispatch(_Integer __n, _Integer __val,
569 _M_fill_assign(__n, __val);
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| forward_list.h | 615 assign(size_type __n, const _Tp& __val)
618 insert_after(cbefore_begin(), __n, __val); local
793 push_front(const _Tp& __val)
794 { this->_M_insert_after(cbefore_begin(), __val); } local
800 push_front(_Tp&& __val)
801 { this->_M_insert_after(cbefore_begin(), std::move(__val)); }
851 insert_after(const_iterator __pos, const _Tp& __val)
852 { return iterator(this->_M_insert_after(__pos, __val)); }
858 insert_after(const_iterator __pos, _Tp&& __val)
859 { return iterator(this->_M_insert_after(__pos, std::move(__val))); }
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _list.h | 306 explicit list(size_type __n, const_reference __val = _STLP_DEFAULT_CONSTRUCTED(value_type),
312 list(size_type __n, const_reference __val)
314 { this->insert(begin(), __n, __val); }
315 list(size_type __n, const_reference __val, const allocator_type& __a)
318 { this->insert(begin(), __n, __val); } local
555 void assign(size_type __n, const_reference __val) { _M_fill_assign(__n, __val); }
557 void _M_fill_assign(size_type __n, const_reference __val);
567 void _M_assign_dispatch(_Integer __n, _Integer __val,
569 _M_fill_assign(__n, __val);
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| forward_list.h | 615 assign(size_type __n, const _Tp& __val)
618 insert_after(cbefore_begin(), __n, __val); local
793 push_front(const _Tp& __val)
794 { this->_M_insert_after(cbefore_begin(), __val); } local
800 push_front(_Tp&& __val)
801 { this->_M_insert_after(cbefore_begin(), std::move(__val)); }
851 insert_after(const_iterator __pos, const _Tp& __val)
852 { return iterator(this->_M_insert_after(__pos, __val)); }
858 insert_after(const_iterator __pos, _Tp&& __val)
859 { return iterator(this->_M_insert_after(__pos, std::move(__val))); }
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _list.h | 306 explicit list(size_type __n, const_reference __val = _STLP_DEFAULT_CONSTRUCTED(value_type),
312 list(size_type __n, const_reference __val)
314 { this->insert(begin(), __n, __val); }
315 list(size_type __n, const_reference __val, const allocator_type& __a)
318 { this->insert(begin(), __n, __val); } local
555 void assign(size_type __n, const_reference __val) { _M_fill_assign(__n, __val); }
557 void _M_fill_assign(size_type __n, const_reference __val);
567 void _M_assign_dispatch(_Integer __n, _Integer __val,
569 _M_fill_assign(__n, __val);
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| forward_list.h | 615 assign(size_type __n, const _Tp& __val)
618 insert_after(cbefore_begin(), __n, __val); local
793 push_front(const _Tp& __val)
794 { this->_M_insert_after(cbefore_begin(), __val); } local
800 push_front(_Tp&& __val)
801 { this->_M_insert_after(cbefore_begin(), std::move(__val)); }
851 insert_after(const_iterator __pos, const _Tp& __val)
852 { return iterator(this->_M_insert_after(__pos, __val)); }
858 insert_after(const_iterator __pos, _Tp&& __val)
859 { return iterator(this->_M_insert_after(__pos, std::move(__val))); }
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| forward_list.h | 624 assign(size_type __n, const _Tp& __val)
627 insert_after(cbefore_begin(), __n, __val); local
800 push_front(const _Tp& __val)
801 { this->_M_insert_after(cbefore_begin(), __val); } local
807 push_front(_Tp&& __val)
808 { this->_M_insert_after(cbefore_begin(), std::move(__val)); }
858 insert_after(const_iterator __pos, const _Tp& __val)
859 { return iterator(this->_M_insert_after(__pos, __val)); }
865 insert_after(const_iterator __pos, _Tp&& __val)
866 { return iterator(this->_M_insert_after(__pos, std::move(__val))); }
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_deque.h | 1714 std::fill(begin(), end(), __val); local
1715 insert(end(), __n - size(), __val); local
1720 std::fill(begin(), end(), __val); local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _list.h | 306 explicit list(size_type __n, const_reference __val = _STLP_DEFAULT_CONSTRUCTED(value_type),
312 list(size_type __n, const_reference __val)
314 { this->insert(begin(), __n, __val); }
315 list(size_type __n, const_reference __val, const allocator_type& __a)
318 { this->insert(begin(), __n, __val); } local
555 void assign(size_type __n, const_reference __val) { _M_fill_assign(__n, __val); }
557 void _M_fill_assign(size_type __n, const_reference __val);
567 void _M_assign_dispatch(_Integer __n, _Integer __val,
569 _M_fill_assign(__n, __val);
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/EH/stlport/stlport/stl/ |
| _list.h | 306 explicit list(size_type __n, const_reference __val = _STLP_DEFAULT_CONSTRUCTED(value_type),
312 list(size_type __n, const_reference __val)
314 { this->insert(begin(), __n, __val); }
315 list(size_type __n, const_reference __val, const allocator_type& __a)
318 { this->insert(begin(), __n, __val); } local
555 void assign(size_type __n, const_reference __val) { _M_fill_assign(__n, __val); }
557 void _M_fill_assign(size_type __n, const_reference __val);
567 void _M_assign_dispatch(_Integer __n, _Integer __val,
569 _M_fill_assign(__n, __val);
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| forward_list.h | 624 assign(size_type __n, const _Tp& __val)
627 insert_after(cbefore_begin(), __n, __val); local
800 push_front(const _Tp& __val)
801 { this->_M_insert_after(cbefore_begin(), __val); } local
807 push_front(_Tp&& __val)
808 { this->_M_insert_after(cbefore_begin(), std::move(__val)); }
858 insert_after(const_iterator __pos, const _Tp& __val)
859 { return iterator(this->_M_insert_after(__pos, __val)); }
865 insert_after(const_iterator __pos, _Tp&& __val)
866 { return iterator(this->_M_insert_after(__pos, std::move(__val))); }
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_deque.h | 1714 std::fill(begin(), end(), __val); local
1715 insert(end(), __n - size(), __val); local
1720 std::fill(begin(), end(), __val); local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/bits/ |
| forward_list.h | 618 * @param __val Value to be assigned.
626 assign(size_type __n, const _Tp& __val)
627 { _M_assign_n(__n, __val, is_copy_assignable<_Tp>()); }
787 * @param __val Data to be added.
796 push_front(const _Tp& __val)
797 { this->_M_insert_after(cbefore_begin(), __val); } local
803 push_front(_Tp&& __val)
804 { this->_M_insert_after(cbefore_begin(), std::move(__val)); }
845 * @param __val Data to be inserted.
854 insert_after(const_iterator __pos, const _Tp& __val)
1326 insert_after(cbefore_begin(), __n, __val); local
[all...] |
| stl_deque.h | 1742 std::fill(begin(), end(), __val); local
1743 insert(end(), __n - size(), __val); local
1748 std::fill(begin(), end(), __val); local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/ |
| algo.h | 131 find(_IIter __begin, _IIter __end, const _Tp& __val,
133 { return _GLIBCXX_STD_A::find(__begin, __end, __val); }
138 __find_switch(_IIter __begin, _IIter __end, const _Tp& __val,
140 { return _GLIBCXX_STD_A::find(__begin, __end, __val); }
146 const _Tp& __val, random_access_iterator_tag)
154 __comp(__gnu_parallel::_EqualTo<_ValueType, const _Tp&>(), __val); local
160 return _GLIBCXX_STD_A::find(__begin, __end, __val);
166 find(_IIter __begin, _IIter __end, const _Tp& __val)
170 return __find_switch(__begin, __end, __val, _IteratorCategory());
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| stl_deque.h | 1808 std::fill(begin(), end(), __val); local
1809 insert(end(), __n - size(), __val); local
1814 std::fill(begin(), end(), __val); local
[all...] |
| /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/ |
| algo.h | 131 find(_IIter __begin, _IIter __end, const _Tp& __val,
133 { return _GLIBCXX_STD_A::find(__begin, __end, __val); }
138 __find_switch(_IIter __begin, _IIter __end, const _Tp& __val,
140 { return _GLIBCXX_STD_A::find(__begin, __end, __val); }
146 const _Tp& __val, random_access_iterator_tag)
156 __comp(__gnu_parallel::_EqualTo<_ValueType, const _Tp&>(), __val); local
162 return _GLIBCXX_STD_A::find(__begin, __end, __val);
168 find(_IIter __begin, _IIter __end, const _Tp& __val)
172 return __find_switch(__begin, __end, __val, _IteratorCategory());
[all...] |
| /external/stlport/stlport/stl/ |
| _algo.c | 155 _Integer __count, const _Tp& __val, _BinaryPred __pred,
168 while ( !__pred(*__lookAhead, __val) ) { // the skip loop...
182 for (__backTrack = __lookAhead; __pred(*--__backTrack, __val); ) {
193 while ( __pred(*__lookAhead, __val) ) {
200 } while (__pred(*--__backTrack, __val));
221 _Integer __count, const _Tp& __val, _BinaryPred __pred,
223 for (; (__first != __last) && !__pred(*__first, __val); ++__first) {}
228 while (__i != __last && __n != 0 && __pred(*__i, __val)) {
235 for (__first = ++__i; (__first != __last) && !__pred(*__first, __val); ++__first) {}
244 // search_n. Search for __count consecutive copies of __val
298 _Tp __val = *__first; local
[all...] |
| _deque.h | 492 void _M_initialize(size_type __n, const value_type& __val = _STLP_DEFAULT_CONSTRUCTED(_Tp)) {
494 _M_fill_initialize(__val, _TrivialInit());
500 deque(size_type __n, const value_type& __val, const allocator_type& __a = allocator_type())
507 deque(size_type __n, const value_type& __val)
509 { _M_fill_initialize(__val, __false_type()); }
510 deque(size_type __n, const value_type& __val, const allocator_type& __a)
513 { _M_fill_initialize(__val, __false_type()); }
587 void _M_fill_assign(size_type __n, const _Tp& __val) {
589 _STLP_STD::fill(begin(), end(), __val); local
590 insert(end(), __n - size(), __val); local
594 _STLP_STD::fill(begin(), end(), __val); local
[all...] |
