/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.sort/sort/ |
sort_comp.pass.cpp | 41 std::reverse(v.begin(), v.end());
|
sort.pass.cpp | 98 // test reverse sorted pattern 99 std::reverse(array, array+N); 106 // test reverse swap ranges 2 pattern 107 std::reverse(array, array+N);
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/ |
x25.h | 104 unsigned int reverse; member in struct:x25_facilities
|
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
x25.h | 104 unsigned int reverse; member in struct:x25_facilities
|
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/ |
x25.h | 104 unsigned int reverse; member in struct:x25_facilities
|
/external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/x500/style/ |
BCStyle.java | 333 boolean reverse = false; 337 reverse = !rdns1[0].getFirst().getType().equals(rdns2[0].getFirst().getType()); // guess forward 342 if (!foundMatch(reverse, rdns1[i], rdns2)) 351 private boolean foundMatch(boolean reverse, RDN rdn, RDN[] possRDNs) 353 if (reverse)
|
/external/elfutils/libebl/ |
eblgstrtab.c | 80 char reverse[0]; member in struct:Ebl_GStrent 202 newstr->reverse[i * st->width + j] = str[(len - 2 - i) * st->width + j]; 204 newstr->reverse[(len - 1) * st->width + j] = '\0'; 228 cmpres = memcmp ((*sep)->reverse, newstr->reverse, 290 /* We have a new substring. This means we don't need the reverse
|
eblwstrtab.c | 81 wchar_t reverse[0]; member in struct:Ebl_WStrent 203 newstr->reverse[i] = str[len - 2 - i]; 204 newstr->reverse[len - 1] = L'\0'; 228 cmpres = wmemcmp ((*sep)->reverse, newstr->reverse, 284 /* We have a new substring. This means we don't need the reverse
|
/external/skia/src/gpu/ |
GrDefaultPathRenderer.cpp | 360 bool reverse = false; local 385 reverse = true; 395 if (reverse) { 405 reverse = true; 435 if (reverse) { 462 if (reverse) {
|
/external/eigen/blas/ |
common.h | 122 if(incx<0) vector(ret,n) = vector(x,n,-incx).reverse(); 133 if(incx<0) vector(x,n,-incx).reverse() = vector(x_cpy,n);
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/google/ |
ListGenerators.java | 71 Collections.reverse(list); 72 return ImmutableList.copyOf(list).reverse();
|
/external/icu4c/layout/ |
LEFontInstance.cpp | 50 le_bool reverse, const LECharMapper *mapper, le_bool filterZeroWidth, LEGlyphStorage &glyphStorage) const 54 if (reverse) {
|
LEFontInstance.h | 229 * @param reverse - if <code>TRUE</code>, store the glyph indices in reverse order. 238 virtual void mapCharsToGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, const LECharMapper *mapper, le_bool filterZeroWidth, LEGlyphStorage &glyphStorage) const;
|
OpenTypeLayoutEngine.h | 376 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success);
|
/external/libpcap/ |
gencode.h | 300 struct block *gen_atmfield_code(int atmfield, bpf_int32 jvalue, bpf_u_int32 jtype, int reverse); 305 struct block *gen_mtp3field_code(int mtp3field, bpf_u_int32 jvalue, bpf_u_int32 jtype, int reverse);
|
/external/oprofile/libpp/ |
symbol_sort.cpp | 96 bool reverse) 97 : compare_order(order), reverse_sort(reverse) {}
|
/ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.sort/stable.sort/ |
stable_sort.pass.cpp | 98 // test reverse sorted pattern 99 std::reverse(array, array+N); 106 // test reverse swap ranges 2 pattern 107 std::reverse(array, array+N);
|
/external/chromium/chrome/browser/tab_contents/ |
tab_contents_view_gtk.h | 79 virtual void TakeFocus(bool reverse);
|
tab_contents_view_mac.h | 95 virtual void TakeFocus(bool reverse);
|
/external/chromium-trace/trace-viewer/build/ |
flatten.py | 33 load_sequence.reverse()
|
/external/eigen/bench/ |
bench_reverse.cpp | 39 b = a.reverse();
|
/external/icu4c/common/ |
dictbe.h | 87 * @param reverse Whether the caller is looking for breaks in a reverse 96 UBool reverse,
|
/external/linux-tools-perf/scripts/python/ |
failed-syscalls-by-pid.py | 72 for ret, val in sorted(syscalls[comm][pid][id].iteritems(), key = lambda(k, v): (v, k), reverse = True):
|
/external/openfst/src/bin/ |
fstrmepsilon.cc | 28 DEFINE_bool(reverse, false, "Perform in the reverse direction");
|
fstshortestdistance.cc | 29 DEFINE_bool(reverse, false, "Perform in the reverse direction"); 78 LOG(ERROR) << "Specifying a non-default queue with reverse not supported.";
|