| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/tr1/ |
| hashtable.h | 201 _Hashtable(_InputIterator __first, _InputIterator __last,
388 insert(_InputIterator __first, _InputIterator __last);
767 iterator __first(__p, __head);
771 return std::make_pair(__first, __last);
805 const_iterator __first(__p, __head);
809 return std::make_pair(__first, __last);
[all...] |
| hashtable_policy.h | 43 __distance_fw(_Iterator __first, _Iterator __last,
49 __distance_fw(_Iterator __first, _Iterator __last,
51 { return std::distance(__first, __last); }
55 __distance_fw(_Iterator __first, _Iterator __last)
58 return __distance_fw(__first, __last, _Tag());
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/tr1/ |
| hashtable.h | 201 _Hashtable(_InputIterator __first, _InputIterator __last,
388 insert(_InputIterator __first, _InputIterator __last);
767 iterator __first(__p, __head);
771 return std::make_pair(__first, __last);
805 const_iterator __first(__p, __head);
809 return std::make_pair(__first, __last);
[all...] |
| hashtable_policy.h | 43 __distance_fw(_Iterator __first, _Iterator __last,
49 __distance_fw(_Iterator __first, _Iterator __last,
51 { return std::distance(__first, __last); }
55 __distance_fw(_Iterator __first, _Iterator __last)
58 return __distance_fw(__first, __last, _Tag());
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| regex.h | 65 __compile_nfa(const typename _TraitsT::char_type* __first,
218 * @param __first beginning of the character sequence.
237 transform(_Fwd_iter __first, _Fwd_iter __last) const
241 string_type __s(__first, __last);
248 * @param __first beginning of the character sequence.
253 * returned by collate_byname<_Ch_type>::transform(__first, __last)
261 transform_primary(_Fwd_iter __first, _Fwd_iter __last) const
271 std::vector<char_type> __s(__first, __last);
279 * @param __first beginning of the collation element name.
284 * the iterator range [__first, __last). Returns an empty string if th
[all...] |
| stl_tree.h | 874 _M_insert_unique(_InputIterator __first, _InputIterator __last);
878 _M_insert_equal(_InputIterator __first, _InputIterator __last);
885 _M_erase_aux(const_iterator __first, const_iterator __last);
928 erase(const_iterator __first, const_iterator __last)
930 _M_erase_aux(__first, __last);
935 erase(iterator __first, iterator __last)
936 { _M_erase_aux(__first, __last); }
939 erase(const_iterator __first, const_iterator __last)
940 { _M_erase_aux(__first, __last); }
943 erase(const key_type* __first, const key_type* __last)
[all...] |
| unordered_map.h | 148 * @param __first An input iterator.
156 * [__first,__last). This is linear in N (where N is
157 * distance(__first,__last)).
440 * @param __first Iterator pointing to the start of the range to be
448 insert(_InputIterator __first, _InputIterator __last)
449 { _M_h.insert(__first, __last); }
503 * @brief Erases a [__first,__last) range of elements from an
505 * @param __first Iterator pointing to the start of the range to be
517 erase(const_iterator __first, const_iterator __last)
518 { return _M_h.erase(__first, __last);
[all...] |
| regex_compiler.h | 149 __compile_nfa(const typename _TraitsT::char_type* __first,
155 return _Cmplr(__first, __last, __traits, __flags)._M_get_nfa();
|
| hashtable_policy.h | 64 __distance_fw(_Iterator __first, _Iterator __last,
70 __distance_fw(_Iterator __first, _Iterator __last,
72 { return std::distance(__first, __last); }
76 __distance_fw(_Iterator __first, _Iterator __last)
79 return __distance_fw(__first, __last, _Tag());
714 _M_insert_range(_InputIterator __first, _InputIterator __last,
740 insert(_InputIterator __first, _InputIterator __last)
744 return _M_insert_range(__first, __last, __node_gen);
756 _M_insert_range(_InputIterator __first, _InputIterator __last,
763 size_type __n_elt = __detail::__distance_fw(__first, __last)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_tree.h | 786 _M_insert_unique(_InputIterator __first, _InputIterator __last);
790 _M_insert_equal(_InputIterator __first, _InputIterator __last);
797 _M_erase_aux(const_iterator __first, const_iterator __last);
840 erase(const_iterator __first, const_iterator __last)
842 _M_erase_aux(__first, __last);
847 erase(iterator __first, iterator __last)
848 { _M_erase_aux(__first, __last); }
851 erase(const_iterator __first, const_iterator __last)
852 { _M_erase_aux(__first, __last); }
855 erase(const key_type* __first, const key_type* __last)
1722 _M_insert_unique_(end(), *__first); local
1733 _M_insert_equal_(end(), *__first); local
[all...] |
| unordered_map.h | 147 * @param __first An input iterator.
155 * [__first,__last). This is linear in N (where N is
156 * distance(__first,__last)).
410 * @param __first Iterator pointing to the start of the range to be
418 insert(_InputIterator __first, _InputIterator __last)
419 { _M_h.insert(__first, __last); }
473 * @brief Erases a [__first,__last) range of elements from an
475 * @param __first Iterator pointing to the start of the range to be
487 erase(const_iterator __first, const_iterator __last)
488 { return _M_h.erase(__first, __last);
[all...] |
| hashtable_policy.h | 64 __distance_fw(_Iterator __first, _Iterator __last,
70 __distance_fw(_Iterator __first, _Iterator __last,
72 { return std::distance(__first, __last); }
76 __distance_fw(_Iterator __first, _Iterator __last)
79 return __distance_fw(__first, __last, _Tag());
617 insert(_InputIterator __first, _InputIterator __last);
628 insert(_InputIterator __first, _InputIterator __last)
634 size_type __n_elt = __detail::__distance_fw(__first, __last);
646 for (; __first != __last; ++__first)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| stl_tree.h | 786 _M_insert_unique(_InputIterator __first, _InputIterator __last);
790 _M_insert_equal(_InputIterator __first, _InputIterator __last);
797 _M_erase_aux(const_iterator __first, const_iterator __last);
840 erase(const_iterator __first, const_iterator __last)
842 _M_erase_aux(__first, __last);
847 erase(iterator __first, iterator __last)
848 { _M_erase_aux(__first, __last); }
851 erase(const_iterator __first, const_iterator __last)
852 { _M_erase_aux(__first, __last); }
855 erase(const key_type* __first, const key_type* __last)
1722 _M_insert_unique_(end(), *__first); local
1733 _M_insert_equal_(end(), *__first); local
[all...] |
| unordered_map.h | 147 * @param __first An input iterator.
155 * [__first,__last). This is linear in N (where N is
156 * distance(__first,__last)).
410 * @param __first Iterator pointing to the start of the range to be
418 insert(_InputIterator __first, _InputIterator __last)
419 { _M_h.insert(__first, __last); }
473 * @brief Erases a [__first,__last) range of elements from an
475 * @param __first Iterator pointing to the start of the range to be
487 erase(const_iterator __first, const_iterator __last)
488 { return _M_h.erase(__first, __last);
[all...] |
| hashtable_policy.h | 64 __distance_fw(_Iterator __first, _Iterator __last,
70 __distance_fw(_Iterator __first, _Iterator __last,
72 { return std::distance(__first, __last); }
76 __distance_fw(_Iterator __first, _Iterator __last)
79 return __distance_fw(__first, __last, _Tag());
617 insert(_InputIterator __first, _InputIterator __last);
628 insert(_InputIterator __first, _InputIterator __last)
634 size_type __n_elt = __detail::__distance_fw(__first, __last);
646 for (; __first != __last; ++__first)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| stl_tree.h | 786 _M_insert_unique(_InputIterator __first, _InputIterator __last);
790 _M_insert_equal(_InputIterator __first, _InputIterator __last);
797 _M_erase_aux(const_iterator __first, const_iterator __last);
840 erase(const_iterator __first, const_iterator __last)
842 _M_erase_aux(__first, __last);
847 erase(iterator __first, iterator __last)
848 { _M_erase_aux(__first, __last); }
851 erase(const_iterator __first, const_iterator __last)
852 { _M_erase_aux(__first, __last); }
855 erase(const key_type* __first, const key_type* __last)
1722 _M_insert_unique_(end(), *__first); local
1733 _M_insert_equal_(end(), *__first); local
[all...] |
| unordered_map.h | 147 * @param __first An input iterator.
155 * [__first,__last). This is linear in N (where N is
156 * distance(__first,__last)).
410 * @param __first Iterator pointing to the start of the range to be
418 insert(_InputIterator __first, _InputIterator __last)
419 { _M_h.insert(__first, __last); }
473 * @brief Erases a [__first,__last) range of elements from an
475 * @param __first Iterator pointing to the start of the range to be
487 erase(const_iterator __first, const_iterator __last)
488 { return _M_h.erase(__first, __last);
[all...] |
| hashtable_policy.h | 64 __distance_fw(_Iterator __first, _Iterator __last,
70 __distance_fw(_Iterator __first, _Iterator __last,
72 { return std::distance(__first, __last); }
76 __distance_fw(_Iterator __first, _Iterator __last)
79 return __distance_fw(__first, __last, _Tag());
617 insert(_InputIterator __first, _InputIterator __last);
628 insert(_InputIterator __first, _InputIterator __last)
634 size_type __n_elt = __detail::__distance_fw(__first, __last);
646 for (; __first != __last; ++__first)
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| hashtable_policy.h | 43 __distance_fw(_Iterator __first, _Iterator __last,
49 __distance_fw(_Iterator __first, _Iterator __last,
51 { return std::distance(__first, __last); }
55 __distance_fw(_Iterator __first, _Iterator __last)
58 return __distance_fw(__first, __last, _Tag());
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/tr1/ |
| hashtable_policy.h | 43 __distance_fw(_Iterator __first, _Iterator __last,
49 __distance_fw(_Iterator __first, _Iterator __last,
51 { return std::distance(__first, __last); }
55 __distance_fw(_Iterator __first, _Iterator __last)
58 return __distance_fw(__first, __last, _Tag());
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| ptrspec_test.cpp | 40 bool operator () (_Tp *__first, _Tp *__second) const {
41 return *__first < *__second;
|
| /ndk/tests/device/test-stlport/unit/ |
| ptrspec_test.cpp | 40 bool operator () (_Tp *__first, _Tp *__second) const {
41 return *__first < *__second;
|
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/ |
| vstring.h | 798 * @param __first Iterator referencing the first character to append.
811 append(_InputIterator __first, _InputIterator __last)
812 { return this->replace(_M_iend(), _M_iend(), __first, __last); }
926 * @param __first Iterator referencing the first character to append.
940 assign(_InputIterator __first, _InputIterator __last)
941 { return this->replace(_M_ibegin(), _M_iend(), __first, __last); }
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/ext/ |
| ropeimpl.h | [all...] |
| vstring.h | 763 * @param __first Iterator referencing the first character to append.
776 append(_InputIterator __first, _InputIterator __last)
777 { return this->replace(_M_iend(), _M_iend(), __first, __last); }
891 * @param __first Iterator referencing the first character to append.
905 assign(_InputIterator __first, _InputIterator __last)
906 { return this->replace(_M_ibegin(), _M_iend(), __first, __last); }
[all...] |
