| /external/chromium/chrome/browser/ui/views/tab_contents/ |
| native_tab_contents_container_win.h | 32 virtual void AboutToRequestFocusFromTabTraversal(bool reverse) OVERRIDE;
|
| /external/openfst/src/bin/ |
| fstreverse.cc | 25 #include <fst/script/reverse.h>
34 using fst::script::Reverse;
55 Reverse(*ifst, out);
|
| /external/robolectric/ |
| update-downloads.rb | 15 Dir.glob('pages/downloads/*.jar').sort.reverse.each do |f|
|
| /external/skia/legacy/src/core/ |
| SkCubicClipper.cpp | 115 bool reverse; local
123 reverse = true;
126 reverse = false;
155 if (reverse) {
|
| SkLineClipper.cpp | 193 bool reverse; local
198 reverse = false;
202 reverse = true;
208 reverse = false;
212 reverse = false;
240 if (reverse) {
241 // copy the pts in reverse order to maintain winding order
|
| /external/skia/src/core/ |
| SkCubicClipper.cpp | 117 bool reverse; local
125 reverse = true;
128 reverse = false;
157 if (reverse) {
|
| SkLineClipper.cpp | 241 bool reverse; local
246 reverse = false;
250 reverse = true;
256 reverse = false;
260 reverse = false;
288 if (reverse) {
289 // copy the pts in reverse order to maintain winding order
|
| /external/webkit/Tools/Scripts/webkitpy/common/net/ |
| regressionwindow.py | 51 self._revisions.reverse()
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| GeneralRangeTest.java | 197 assertEquals(GeneralRange.all(ORDERING.reverse()), GeneralRange.all(ORDERING).reverse());
198 assertEquals(GeneralRange.downTo(ORDERING.reverse(), 3, CLOSED),
199 GeneralRange.upTo(ORDERING, 3, CLOSED).reverse());
200 assertEquals(GeneralRange.upTo(ORDERING.reverse(), 3, OPEN),
201 GeneralRange.downTo(ORDERING, 3, OPEN).reverse());
202 assertEquals(GeneralRange.range(ORDERING.reverse(), 5, OPEN, 3, CLOSED),
203 GeneralRange.range(ORDERING, 3, CLOSED, 5, OPEN).reverse());
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Array/ |
| 15.4.2.1-3.js | 90 array[item++] = new TestCase( SECTION, "TEST_ARRAY.reverse", Array.prototype.reverse, TEST_ARRAY.reverse );
|
| 15.4.4.4-1.js | 24 ECMA Section: 15.4.4.3-1 Array.prototype.reverse()
27 The elements of the array are rearranged so as to reverse their order.
59 Note that the reverse function is intentionally generic; it does not require
61 kinds of objects for use as a method. Whether the reverse function can be applied
64 Note: Array.prototype.reverse allows some flexibility in implementation
77 writeHeaderToLog( SECTION + " Array.prototype.reverse()");
86 testcases[testcases.length] = new TestCase( SECTION, "Array.prototype.reverse.length", 0, Array.prototype.reverse.length );
87 testcases[testcases.length] = new TestCase( SECTION, "delete Array.prototype.reverse.length", false, delete Array.prototype.reverse.length )
[all...] |
| /external/v8/test/mjsunit/ |
| sparse-array-reverse.js | 29 * @fileoverview Test reverse on small * and large arrays.
39 // Simple test of reverse on sparse array.
51 a.reverse();
60 // reverse code.
70 // Fuzzing test of reverse on sparse array.
122 a.reverse();
129 assertEquals(expected_reversed2 + expected_reversed, a.join(''), 'reverse then join' + size);
|
| /external/elfutils/libebl/ |
| eblstrtab.c | 80 char reverse[0]; member in struct:Ebl_Strent
197 newstr->reverse[i] = str[len - 2 - i];
198 newstr->reverse[len - 1] = '\0';
220 int cmpres = memcmp ((*sep)->reverse, newstr->reverse,
272 /* We have a new substring. This means we don't need the reverse
|
| /packages/apps/Launcher2/src/com/android/launcher2/ |
| SearchDropTargetBar.java | 128 mDropTargetBarAnim.reverse();
130 mQSBSearchBarAnim.reverse();
140 mQSBSearchBarAnim.reverse();
200 mDropTargetBarAnim.reverse();
203 mQSBSearchBarAnim.reverse();
|
| /external/icu4c/test/perf/unisetperf/draft/ |
| bitset.cpp | 33 uint16_t reverse[0x400]; member in struct:BMPBitHash
57 reverse[count]=hash;
79 k[i]=keys[reverse[i]];
|
| /external/guava/guava/src/com/google/common/collect/ |
| GeneralRange.java | 238 private transient GeneralRange<T> reverse; field in class:GeneralRange
243 public GeneralRange<T> reverse() { method in class:GeneralRange
244 GeneralRange<T> result = reverse;
247 new GeneralRange<T>(Ordering.from(comparator).reverse(), hasUpperBound, upperEndpoint,
249 result.reverse = this;
250 return this.reverse = result;
|
| NaturalOrdering.java | 44 @Override public <S extends Comparable> Ordering<S> reverse() { method in class:NaturalOrdering
|
| /external/icu4c/data/brkitr/ |
| char.txt | 55 !!reverse;
|
| /external/openssl/apps/ |
| passwd.c | 43 char *passwd, BIO *out, int quiet, int table, int reverse,
55 * -reverse - switch table columns
72 int passed_salt = 0, quiet = 0, table = 0, reverse = 0; local
141 else if (strcmp(argv[i], "-reverse") == 0)
142 reverse = 1;
186 BIO_printf(bio_err, "-reverse switch table columns\n");
246 quiet, table, reverse, pw_maxlen, usecrypt, use1, useapr1))
275 quiet, table, reverse, pw_maxlen, usecrypt, use1, useapr1))
418 char *passwd, BIO *out, int quiet, int table, int reverse,
494 if (table && !reverse)
[all...] |
| /external/antlr/antlr-3.4/runtime/Perl5/lib/ANTLR/Runtime/ |
| BitSet.pm | 55 $bits = reverse unpack('B*', pack('N', $args->{number}));
64 reverse @$words64;
67 foreach my $h (split //xms, reverse $number) {
68 $bits .= reverse substr(unpack('B*', pack('h', hex $h)), 4);
|
| /external/linux-tools-perf/scripts/python/ |
| sctop.py | 69 reverse = True):
|
| syscall-counts-by-pid.py | 68 key = lambda(k, v): (v, k), reverse = True):
|
| syscall-counts.py | 58 reverse = True):
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| reverse.h | 0 // reverse.h
32 #include <fst/reverse.h>
38 void Reverse(const Fst<Arc> &ifst,
45 Reverse(ifst, ofst);
|
| /external/webkit/Source/WebCore/xml/ |
| XPathNodeSet.h | 73 void reverse();
|
