| /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
| H A D | upredalgo.h | 70 mismatch (InputIterator first1, InputIterator last1, InputIterator first2, BinaryPredicate comp) argument
72 while (first1 != last1 && comp(*first1, *first2))
73 ++ first1, ++ first2;
74 return (make_pair (first1, first2));
83 inline bool equal (InputIterator first1, InputIterator last1, InputIterator first2, BinaryPredicate comp) argument
85 return (mismatch (first1, last1, first2, comp).first == last1);
285 /// \brief Searches for the first subsequence [first2,last2) in [first1,last1)
289 ForwardIterator1 search (ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate comp) argument
291 const ForwardIterator1 slast = last1 - distance(first2, last2) + 1;
293 ForwardIterator2 i = first2;
306 find_end(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2, BinaryPredicate comp) argument
338 find_first_of(InputIterator first1, InputIterator last1, ForwardIterator first2, ForwardIterator last2, BinaryPredicate comp) argument
352 includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, StrictWeakOrdering comp) argument
370 set_union(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, StrictWeakOrdering comp) argument
387 set_intersection(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, StrictWeakOrdering comp) argument
403 set_difference(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, StrictWeakOrdering comp) argument
419 set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result, StrictWeakOrdering comp) argument
449 lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, BinaryPredicate comp) argument
[all...] |
| H A D | ualgo.h | 68 mismatch (InputIterator first1, InputIterator last1, InputIterator first2) argument
70 while (first1 != last1 && *first1 == *first2)
71 ++ first1, ++ first2;
72 return (make_pair (first1, first2));
80 inline bool equal (InputIterator first1, InputIterator last1, InputIterator first2) argument
82 return (mismatch (first1, last1, first2).first == last1);
125 /// *(result + n) = op(*(first1 + n), *(first2 + n).
131 inline OutputIterator transform (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, OutputIterator result, BinaryFunction op) argument
133 for (; first1 != last1; ++result, ++first1, ++first2)
134 *result = op (*first1, *first2);
253 merge(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result) argument
504 search(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2) argument
513 find_end(ForwardIterator1 first1, ForwardIterator1 last1, ForwardIterator2 first2, ForwardIterator2 last2) argument
531 find_first_of(InputIterator first1, InputIterator last1, ForwardIterator first2, ForwardIterator last2) argument
541 includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2) argument
554 set_union(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result) argument
563 set_intersection(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result) argument
572 set_difference(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result) argument
581 set_symmetric_difference(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, OutputIterator result) argument
599 lexicographical_compare(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2) argument
[all...] |
| H A D | unumeric.h | 52 inline T inner_product (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, T init) argument
55 init += *first1++ * *first2++;
65 (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, T init,
69 init = sumOp (init, productOp (*first1++, *first2++));
64 inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, T init, BinaryOperation1 sumOp, BinaryOperation2 productOp) argument
|
| H A D | ustring.cpp | 135 /*static*/ int string::compare (const_iterator first1, const_iterator last1, const_iterator first2, const_iterator last2) argument
137 assert (first1 <= last1 && (first2 <= last2 || !last2) && "Negative ranges result in memory allocation errors.");
138 const size_type len1 = distance (first1, last1), len2 = distance (first2, last2);
140 int rv = memcmp (first1, first2, min (len1, len2));
|
| H A D | ustring.h | 106 static int compare (const_iterator first1, const_iterator last1, const_iterator first2, const_iterator last2);
|