| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _list.c | 49 _List_node_base* __first, _List_node_base* __last) {
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
53 __first->_M_prev->_M_next = __last;
58 __position->_M_prev = __last->_M_prev;
59 __last->_M_prev = __first->_M_prev;
142 _Literator __last = __that.end(); local
143 while (__first != __last) {
155 _Literator __last = __that.end(); local
156 if (__first == __last) return
[all...] |
| _time_facets.c | 78 __match(_InIt& __first, _InIt& __last, _NameIt __name, _NameIt __name_end) {
89 while (__first != __last) {
149 __get_formatted_time _STLP_WEAK (_InIt1 __first, _InIt1 __last,
157 while (__first != __last && __format != __format_end) {
171 size_t __index = __match(__first, __last,
182 size_t __index = __match(__first, __last,
191 bool __pr = __get_decimal_integer(__first, __last, __t->tm_mday, __STATIC_CAST(_Ch*, 0));
200 bool __pr = __get_decimal_integer(__first, __last, __t->tm_hour, __STATIC_CAST(_Ch*, 0));
207 bool __pr = __get_decimal_integer(__first, __last, __t->tm_yday, __STATIC_CAST(_Ch*, 0));
214 bool __pr = __get_decimal_integer(__first, __last, __t->tm_mon, __STATIC_CAST(_Ch*, 0))
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/stlport/stlport/stl/ |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _list.c | 49 _List_node_base* __first, _List_node_base* __last) {
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
53 __first->_M_prev->_M_next = __last;
58 __position->_M_prev = __last->_M_prev;
59 __last->_M_prev = __first->_M_prev;
142 _Literator __last = __that.end(); local
143 while (__first != __last) {
155 _Literator __last = __that.end(); local
156 if (__first == __last) return
[all...] |
| _time_facets.c | 78 __match(_InIt& __first, _InIt& __last, _NameIt __name, _NameIt __name_end) {
89 while (__first != __last) {
149 __get_formatted_time _STLP_WEAK (_InIt1 __first, _InIt1 __last,
157 while (__first != __last && __format != __format_end) {
171 size_t __index = __match(__first, __last,
182 size_t __index = __match(__first, __last,
191 bool __pr = __get_decimal_integer(__first, __last, __t->tm_mday, __STATIC_CAST(_Ch*, 0));
200 bool __pr = __get_decimal_integer(__first, __last, __t->tm_hour, __STATIC_CAST(_Ch*, 0));
207 bool __pr = __get_decimal_integer(__first, __last, __t->tm_yday, __STATIC_CAST(_Ch*, 0));
214 bool __pr = __get_decimal_integer(__first, __last, __t->tm_mon, __STATIC_CAST(_Ch*, 0))
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/stlport/stlport/stl/ |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _list.c | 49 _List_node_base* __first, _List_node_base* __last) {
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
53 __first->_M_prev->_M_next = __last;
58 __position->_M_prev = __last->_M_prev;
59 __last->_M_prev = __first->_M_prev;
142 _Literator __last = __that.end(); local
143 while (__first != __last) {
155 _Literator __last = __that.end(); local
156 if (__first == __last) return
[all...] |
| _time_facets.c | 78 __match(_InIt& __first, _InIt& __last, _NameIt __name, _NameIt __name_end) {
89 while (__first != __last) {
149 __get_formatted_time _STLP_WEAK (_InIt1 __first, _InIt1 __last,
157 while (__first != __last && __format != __format_end) {
171 size_t __index = __match(__first, __last,
182 size_t __index = __match(__first, __last,
191 bool __pr = __get_decimal_integer(__first, __last, __t->tm_mday, __STATIC_CAST(_Ch*, 0));
200 bool __pr = __get_decimal_integer(__first, __last, __t->tm_hour, __STATIC_CAST(_Ch*, 0));
207 bool __pr = __get_decimal_integer(__first, __last, __t->tm_yday, __STATIC_CAST(_Ch*, 0));
214 bool __pr = __get_decimal_integer(__first, __last, __t->tm_mon, __STATIC_CAST(_Ch*, 0))
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/stlport/stlport/stl/ |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _list.c | 49 _List_node_base* __first, _List_node_base* __last) {
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
53 __first->_M_prev->_M_next = __last;
58 __position->_M_prev = __last->_M_prev;
59 __last->_M_prev = __first->_M_prev;
142 _Literator __last = __that.end(); local
143 while (__first != __last) {
155 _Literator __last = __that.end(); local
156 if (__first == __last) return
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/stlport/stlport/stl/ |
| _queue.h | 184 priority_queue(_InputIterator __first, _InputIterator __last)
185 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
189 _InputIterator __last, const _Compare& __x)
190 : c(__first, __last), comp(__x)
194 priority_queue(_InputIterator __first, _InputIterator __last,
198 c.insert(c.end(), __first, __last);
203 priority_queue(const value_type* __first, const value_type* __last)
204 : c(__first, __last) { make_heap(c.begin(), c.end(), comp); }
206 priority_queue(const value_type* __first, const value_type* __last,
208 : c(__first, __last), comp(__x
[all...] |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _list.c | 49 _List_node_base* __first, _List_node_base* __last) {
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
53 __first->_M_prev->_M_next = __last;
58 __position->_M_prev = __last->_M_prev;
59 __last->_M_prev = __first->_M_prev;
142 _Literator __last = __that.end(); local
143 while (__first != __last) {
155 _Literator __last = __that.end(); local
156 if (__first == __last) return
[all...] |
| /external/stlport/stlport/stl/ |
| _hashtable.c | 72 const size_t* __last = __first + __size; local
73 const size_t* pos = __lower_bound(__first, __last, __n,
75 return (pos == __last ? *(__last - 1) : *pos);
83 const size_t* __last = __begin + __size; local
84 __pos = __lower_bound(__begin, __last, __n,
87 if (__pos== __last)
202 _ElemsIte __last(_M_buckets[__n + 1]);
204 if (__cur != __last) {
205 for (; __cur != __last; ++__cur)
[all...] |
| _list.c | 49 _List_node_base* __first, _List_node_base* __last) {
50 if (__position != __last) {
52 __last->_M_prev->_M_next = __position;
53 __first->_M_prev->_M_next = __last;
58 __position->_M_prev = __last->_M_prev;
59 __last->_M_prev = __first->_M_prev;
142 _Literator __last = __that.end(); local
143 while (__first != __last) {
155 _Literator __last = __that.end(); local
156 if (__first == __last) return
[all...] |
| _time_facets.c | 78 __match(_InIt& __first, _InIt& __last, _NameIt __name, _NameIt __name_end) {
89 while (__first != __last) {
149 __get_formatted_time _STLP_WEAK (_InIt1 __first, _InIt1 __last,
157 while (__first != __last && __format != __format_end) {
171 size_t __index = __match(__first, __last,
182 size_t __index = __match(__first, __last,
191 bool __pr = __get_decimal_integer(__first, __last, __t->tm_mday, __STATIC_CAST(_Ch*, 0));
200 bool __pr = __get_decimal_integer(__first, __last, __t->tm_hour, __STATIC_CAST(_Ch*, 0));
207 bool __pr = __get_decimal_integer(__first, __last, __t->tm_yday, __STATIC_CAST(_Ch*, 0));
214 bool __pr = __get_decimal_integer(__first, __last, __t->tm_mon, __STATIC_CAST(_Ch*, 0))
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| stl_bvector.h | 356 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
358 for (; __first != __last; ++__first)
363 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
365 if (__first._M_p != __last._M_p)
367 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
369 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local
372 __fill_bvector(__first, __last, __x);
548 vector(_InputIterator __first, _InputIterator __last,
553 _M_initialize_dispatch(__first, __last, _Integral())
959 insert(end(), __first, __last); local
975 insert(end(), __mid, __last); local
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| stl_bvector.h | 356 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
358 for (; __first != __last; ++__first)
363 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
365 if (__first._M_p != __last._M_p)
367 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
369 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local
372 __fill_bvector(__first, __last, __x);
548 vector(_InputIterator __first, _InputIterator __last,
553 _M_initialize_dispatch(__first, __last, _Integral())
959 insert(end(), __first, __last); local
975 insert(end(), __mid, __last); local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.6/include/bits/ |
| stl_bvector.h | 356 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
358 for (; __first != __last; ++__first)
363 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
365 if (__first._M_p != __last._M_p)
367 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
369 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local
372 __fill_bvector(__first, __last, __x);
548 vector(_InputIterator __first, _InputIterator __last,
553 _M_initialize_dispatch(__first, __last, _Integral())
959 insert(end(), __first, __last); local
975 insert(end(), __mid, __last); local
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.7/include/bits/ |
| stl_bvector.h | 358 __fill_bvector(_Bit_iterator __first, _Bit_iterator __last, bool __x)
360 for (; __first != __last; ++__first)
365 fill(_Bit_iterator __first, _Bit_iterator __last, const bool& __x)
367 if (__first._M_p != __last._M_p)
369 std::fill(__first._M_p + 1, __last._M_p, __x ? ~0 : 0);
371 __fill_bvector(_Bit_iterator(__last._M_p, 0), __last, __x); local
374 __fill_bvector(__first, __last, __x);
561 vector(_InputIterator __first, _InputIterator __last,
566 _M_initialize_dispatch(__first, __last, _Integral())
[all...] |
