| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/parallel/ |
| merge.h | 48 * @param end2 End iterator of second sequence.
60 RandomAccessIterator2 end2, OutputIterator target,
64 while (begin1 != end1 && begin2 != end2 && max_length > 0)
97 * @param end2 End iterator of second sequence.
109 RandomAccessIterator2 end2,
123 while (begin1 != end1 && begin2 != end2 && max_length > 0)
165 * @param end2 End iterator of second sequence.
175 RandomAccessIterator2& begin2, RandomAccessIterator2 end2,
181 return merge_advance_movc(begin1, end1, begin2, end2, target,
190 * @param end2 End iterator of second sequence
[all...] |
| algobase.h | 163 InputIterator2 begin2, InputIterator2 end2,
166 begin2, end2); }
173 InputIterator2 begin2, InputIterator2 end2,
176 begin2, end2, pred); }
183 InputIterator2 begin2, InputIterator2 end2,
186 begin2, end2, pred); }
196 RandomAccessIterator2 end2, Predicate pred,
212 if ((end1 - begin1) < (end2 - begin2))
227 pair_type mm = mismatch_switch(begin2, end2, begin1,
232 return (mm.first != end2) && bool(pred(*mm.second, *mm.first))
[all...] |
| set_operations.h | 355 InputIterator begin2, InputIterator end2,
358 _GLIBCXX_CALL((end1 - begin1) + (end2 - begin2))
365 return op.first_empty(begin2, end2, result);
367 if (begin2 == end2)
370 const difference_type size = (end1 - begin1) + (end2 - begin2);
373 { std::make_pair(begin1, end1), std::make_pair(begin2, end2) } ;
381 std::min(end1 - begin1, end2 - begin2));
408 if (offset[ 0 ] != begin1 && offset[ 1 ] != end2
456 block_begin.first, end1, block_begin.second, end2, r);
478 InputIterator begin2, InputIterator end2,
[all...] |
| search.h | 75 * @param end2 End iterator of second sequence.
83 _RandomAccessIterator2 begin2, _RandomAccessIterator2 end2,
89 _GLIBCXX_CALL((end1 - begin1) + (end2 - begin2));
91 difference_type pattern_length = end2 - begin2;
|
| algo.h | 214 ForwardIterator begin2, ForwardIterator end2,
216 { return _GLIBCXX_STD_P::find_first_of(begin1, end1, begin2, end2); }
223 ForwardIterator begin2, ForwardIterator end2,
225 { return _GLIBCXX_STD_P::find_first_of(begin1, end1, begin2, end2, comp); }
232 ForwardIterator begin2, ForwardIterator end2,
234 { return find_first_of(begin1, end1, begin2, end2,
243 ForwardIterator begin2, ForwardIterator end2,
250 <ForwardIterator>(begin2, end2)).first;
259 ForwardIterator begin2, ForwardIterator end2,
261 { return find_first_of(begin1, end1, begin2, end2, comp,
[all...] |
| /external/chromium/third_party/icu/source/tools/genprops/misc/ |
| ucdmerge.c | 55 char *end1, *end2; local
64 end2=endOfData(l2);
68 return length==(end2-l2) && 0==memcmp(l1, l2, length);
|
| /external/icu4c/tools/genprops/misc/ |
| ucdmerge.c | 55 char *end1, *end2; local
64 end2=endOfData(l2);
68 return length==(end2-l2) && 0==memcmp(l1, l2, length);
|
| /external/icu4c/tools/genprops/ |
| ucdmerge.c | 55 char *end1, *end2; local
64 end2=endOfData(l2);
68 return length==(end2-l2) && 0==memcmp(l1, l2, length);
|
| /external/webkit/WebCore/bindings/js/ |
| JSDOMGlobalObject.cpp | 58 JSDOMConstructorMap::iterator end2 = constructors().end(); local
59 for (JSDOMConstructorMap::iterator it2 = constructors().begin(); it2 != end2; ++it2)
|
| /external/chromium/base/ |
| file_util.cc | 167 std::string::size_type end2 = line2.find_last_not_of("\r\n"); local
168 if (end2 == std::string::npos)
170 else if (end2 + 1 < line2.length())
171 line2.erase(end2 + 1);
|
| /external/wpa_supplicant_6/wpa_supplicant/src/wps/ |
| httpread.c | 121 int end2 = 0; local
130 end2 = !isgraph(c2);
131 if (end1 || end2 || c1 != c2)
134 return end1 && end2; /* reached end of both words? */
|
| wps_upnp_ssdp.c | 41 int end2 = 0; local
50 end2 = !(isalnum(c2) || c2 == '_' || c2 == '-');
51 if (end1 || end2 || c1 != c2)
54 return end1 && end2; /* reached end of both words? */
|
| /external/quake/quake/src/WinQuake/ |
| sys_linux.cpp | 114 static char end2[] =
124 printf("%s", end2);
|
| /external/libxml2/include/libxml/ |
| parserInternals.h | 493 xmlChar end2,
501 xmlChar end2,
591 xmlChar end2,
|
| /external/webkit/WebCore/loader/ |
| CachedResource.cpp | 348 HashCountedSet<CachedResourceClient*>::iterator end2 = m_clients.end(); local
349 for (HashCountedSet<CachedResourceClient*>::iterator it = m_clients.begin(); it != end2; ++it) {
|
| /external/bluetooth/bluez/audio/ |
| liba2dp.c | 645 uint64_t begin, end, begin2, end2; local
667 end2 = get_microseconds();
668 print_time("poll", begin2, end2);
699 end2 = get_microseconds();
700 print_time("send", begin2, end2);
|
| /external/libxml2/ |
| legacy.c | 32 xmlChar end2, xmlChar end3);
39 * @end2: an end marker xmlChar, 0 if none
52 xmlChar end2 ATTRIBUTE_UNUSED,
394 * @end2: an end marker xmlChar, 0 if none
413 xmlChar end2 ATTRIBUTE_UNUSED,
[all...] |
| parser.c | [all...] |
| /frameworks/base/media/java/android/media/ |
| MediaScanner.java | 1235 int end2 = path2.length(); local
[all...] |
| /bionic/libc/netbsd/resolv/ |
| res_cache.c | 859 const uint8_t* end2 = pack2->end; local
864 if (p1 >= end1 || p2 >= end2) {
882 if ((p1+c1 > end1) || (p2+c1 > end2)) {
[all...] |
| /sdk/traceview/src/com/android/traceview/ |
| TimeLineView.java | 381 long end2 = r2.block.getEndTime();
382 if (end1 > end2)
384 if (end1 < end2)
[all...] |
| /bionic/libc/regex/ |
| regcomp.c | 448 * Giving end1 as OUT essentially eliminates the end1/end2 check.
459 int end2) /* second terminating character */
470 while (MORE() && !SEETWO(end1, end2)) {
[all...] |
| /external/icu4c/test/cintltst/ |
| ncnvtst.c | 1899 UChar32 start, end, start2, end2, notStart, notEnd; member in struct:NameRange
[all...] |
| /external/chromium/third_party/icu/source/test/cintltst/ |
| ncnvtst.c | 1876 UChar32 start, end, start2, end2, notStart, notEnd; member in struct:NameRange
[all...] |
| /external/clearsilver/util/regex/ |
| regex.c | 3583 const char *end1, *end2; local
[all...] |
