| /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
| upredalgo.h | 70 mismatch (InputIterator first1, InputIterator last1, InputIterator first2, BinaryPredicate comp)
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)
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)
292 for (; first1 < slast; ++first1)
[all...] |
| ualgo.h | 68 mismatch (InputIterator first1, InputIterator last1, InputIterator first2)
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)
82 return (mismatch (first1, last1, first2).first == last1);
121 /// op(*i1, *i2) for each iterator i1 in the range [first1, last1) and assigns
124 /// for each n such that 0 <= n < last1 - first1, it performs the assignment
125 /// *(result + n) = op(*(first1 + n), *(first2 + n)
[all...] |
| unumeric.h | 52 inline T inner_product (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, T init)
54 while (first1 < last1)
55 init += *first1++ * *first2++;
65 (InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, T init,
68 while (first1 < last1)
69 init = sumOp (init, productOp (*first1++, *first2++));
|
| ustring.cpp | 135 /*static*/ int string::compare (const_iterator first1, const_iterator last1, const_iterator first2, const_iterator last2)
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));
|
| ustring.h | 106 static int compare (const_iterator first1, const_iterator last1, const_iterator first2, const_iterator last2);
|
| /external/stlport/src/ |
| num_get.cpp | 38 __valid_grouping(const char * first1, const char * last1,
40 if (first1 == last1 || first2 == last2) return true;
44 while (first1 != last1) {
|
| /external/jdiff/src/jdiff/ |
| Diff.java | 136 int first1 = hunk.line1; // Index of first inserted word local
139 newDocWords[first1 - 1].compareTo(" ") == 0 &&
141 first1 == lasthunk.line1 + lasthunk.inserted + 1) {
193 int first1 = hunk.line1; // Index of first inserted word local
203 System.out.println("first1: " + first1);
240 for (int i = first1; i <= last1; i++) {
[all...] |
| /external/stlport/test/eh/ |
| test_insert.h | 170 DstIter first1 = original.begin(); local
179 EH_STD::pair<DstIter, DstIter> p = EH_STD::mismatch( first1, original.end(), first2 );
200 dstItem = EH_STD::find( first1, original.end(), *p.first );
209 first1 = p.first;
|
| /external/icu4c/tools/tzcode/ |
| tz2icu.cpp | 1690 bool first1 = true; local
[all...] |
| /external/stlport/test/unit/ |
| codecvt_test.cpp | 464 virtual result do_in(state_type& /*state*/, const extern_type* first1,
468 for ( next1 = first1, next2 = first2; next1 < last1; next1 += 2 ) {
|
| /external/grub/docs/ |
| texinfo.tex | [all...] |
