| /external/icu4c/layoutex/ |
| LXUtilities.h | 21 static void reverse(le_int32 array[], le_int32 count);
22 static void reverse(float array[], le_int32 count);
|
| /external/clang/test/CodeGen/ |
| 2003-11-20-Bitfields.c | 4 unsigned int reverse :1; member in struct:face_cachel
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Array/ |
| 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...] |
| 15.4.4.4-2.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
78 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/srec/tools/thirdparty/OpenFst/fst/lib/ |
| reverse.h | 0 // reverse.h
28 // reverse of A transduces the reverse of x to the reverse of y with
29 // weight a.Reverse().
31 // Typically, a = a.Reverse() and Arc = RevArc (e.g. for
36 void Reverse(const Fst<Arc> &ifst, MutableFst<RevArc> *ofst) {
60 RevArc oarc(0, 0, final.Reverse(), os);
68 RevArc oarc(iarc.ilabel, iarc.olabel, iarc.weight.Reverse(), os);
|
| weight.h | 47 // ReverseWeight: the type of the corresponding reverse weight.
50 // Reverse: a mapping from Weight to ReverseWeight s.t.
51 // --> Reverse(Reverse(a)) = a
52 // --> Reverse(Plus(a, b)) = Plus(Reverse(a), Reverse(b))
53 // --> Reverse(Times(a, b)) = Times(Reverse(b), Reverse(a)
[all...] |
| /device/sample/frameworks/PlatformLibrary/java/com/example/android/platform_library/ |
| PlatformLibrary.java | 40 /* reverse a string, for no very good reason */
41 String reverse = reverseString("Android!"); local
43 Log.i("PlatformLibrary", "getInt: " + result + ", '" + reverse + "'");
62 * Native method that returns a new string that is the reverse of
|
| /external/clang/test/SemaTemplate/ |
| example-typelist.cpp | 48 class reverse { class
49 typedef typename reverse<typename T::tail>::type reversed_tail;
51 typedef typename reverse<typename reversed_tail::tail>::type most_of_tail;
55 typename reverse<cons<typename T::head, most_of_tail> >::type> type;
59 class reverse<cons<Head> > { class
65 class reverse<nil> { class
70 int reverse0[is_same<reverse<unsigned_inttypes>::type,
|
| /frameworks/compile/libbcc/runtime/lib/arm/ |
| bswapdi2.S | 15 // Reverse all the bytes in a 64-bit integer.
18 rev r2, r1 // reverse bytes in high 32-bits into temp2
19 rev r3, r0 // reverse bytes in low 32-bit into temp3
|
| bswapsi2.S | 15 // Reverse all the bytes in a 32-bit integer.
18 rev r0, r0 // reverse bytes in parameter and put into result register
|
| /external/skia/src/core/ |
| SkEdgeClipper.cpp | 37 it to be increasing in Y. If it had to reverse the order of the points,
130 bool reverse = sort_increasing_Y(pts, srcPts, 3); local
142 reverse = !reverse;
150 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
154 this->appendVLine(clip.fRight, pts[0].fY, pts[2].fY, reverse);
165 this->appendVLine(clip.fLeft, tmp[0].fY, tmp[2].fY, reverse);
173 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
184 this->appendQuad(tmp, reverse);
185 this->appendVLine(clip.fRight, tmp[2].fY, tmp[4].fY, reverse);
[all...] |
| /external/webkit/Tools/Scripts/webkitperl/VCSUtils_unittest/ |
| parseSvnPropertyValue.pl | 70 diffName => "'Reverse-merged' change",
72 Reverse-merged /trunk/Makefile:r33020
175 diffName => "'Reverse-merged' change followed by 'Merge' change",
177 Reverse-merged /trunk/Makefile:r33020
195 diffName => "'Reverse-merged' change followed by 'Reverse-merged' change",
197 Reverse-merged /trunk/Makefile:r33020
198 Reverse-merged /trunk/Makefile.shared:r58350
200 expectedReturn => ["/trunk/Makefile:r33020", " Reverse-merged /trunk/Makefile.shared:r58350\n"],
205 diffName => "'Reverse-merged' change followed by 'Reverse-merged' change followed by 'Merged' change"
[all...] |
| /external/bouncycastle/src/main/java/org/bouncycastle/jce/ |
| X509Principal.java | 105 * some such, converting it into an ordered set of name attributes. If reverse
111 boolean reverse,
114 super(reverse, dirName);
124 * If reverse is true, create the encoded version of the sequence starting
128 boolean reverse,
132 super(reverse, lookUp, dirName);
|
| /external/skia/include/core/ |
| SkEdgeClipper.h | 45 void appendVLine(SkScalar x, SkScalar y0, SkScalar y1, bool reverse);
46 void appendQuad(const SkPoint pts[3], bool reverse);
47 void appendCubic(const SkPoint pts[4], bool reverse);
|
| /external/clang/test/CXX/except/except.spec/ |
| p9-noexcept.cpp | 15 void reverse() noexcept(false)
|
| /external/valgrind/main/none/tests/ppc32/ |
| ldstrev.c | 11 " lhbrx %0,0,%1 \n" // Get half word and reverse the bytes
23 " lhzx %0,0,%1 \n" // Get half word and reverse the bytes
35 " lwbrx %0,0,%1 \n" // Get half word and reverse the bytes
47 " lwzx %0,0,%1 \n" // Get half word and reverse the bytes
|
| /dalvik/vm/mterp/x86-atom/ |
| OP_RSUB_INT.S | 19 * Code: 32-bit reverse-subtraction. Uses no substitutions.
23 * Description: Perform a reverse subtraction on a register and a
|
| OP_RSUB_INT_LIT8.S | 19 * Code: 32-bit reverse-subtraction. Uses no substitutions.
23 * Description: Perform a reverse subtraction on a register and a
|
| /development/samples/ApiDemos/res/anim/ |
| animator_set.xml | 24 android:repeatMode="reverse"/>
31 android:repeatMode="reverse"/>
|
| /external/chromium/net/base/ |
| net_log_unittest.h | 25 int i, // Negative indices are reverse indices.
30 // Negative indices are reverse indices.
61 int i, // Negative indices are reverse indices.
72 int i, // Negative indices are reverse indices.
82 int i, // Negative indices are reverse indices.
90 int i, // Negative indices are reverse indices.
97 int i, // Negative indices are reverse indices.
99 // Negative indices are reverse indices.
|
| /external/icu4c/layout/ |
| ArabicLayoutEngine.cpp | 103 void ArabicOpenTypeLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse,
116 OpenTypeLayoutEngine::adjustGlyphPositions(chars, offset, count, reverse, glyphStorage, success);
125 adjustMarkGlyphs(&chars[offset], count, reverse, glyphStorage, &filter, success);
174 void UnicodeArabicOpenTypeLayoutEngine::mapCharsToGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, le_bool /*mirror*/, LEGlyphStorage &glyphStorage, LEErrorCode &success)
187 if (reverse) {
192 glyphStorage.allocateGlyphArray(count, reverse, success);
199 void UnicodeArabicOpenTypeLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse,
213 adjustMarkGlyphs(&chars[offset], count, reverse, glyphStorage, &filter, success);
|
| /packages/apps/Email/emailcommon/src/org/apache/commons/io/comparator/ |
| NameFileComparator.java | 32 * and the reverse of those options.
41 * Example of a <i>reverse case-insensitive</i> file name sort using the
57 /** Reverse case-sensitive name comparator instance (see {@link IOCase#SENSITIVE}) */
63 /** Reverse case-insensitive name comparator instance (see {@link IOCase#INSENSITIVE}) */
69 /** Reverse system sensitive name comparator instance (see {@link IOCase#SYSTEM}) */
|
| PathFileComparator.java | 32 * and the reverse of those options.
41 * Example of a <i>reverse case-insensitive</i> file path sort using the
57 /** Reverse case-sensitive path comparator instance (see {@link IOCase#SENSITIVE}) */
63 /** Reverse case-insensitive path comparator instance (see {@link IOCase#INSENSITIVE}) */
69 /** Reverse system sensitive path comparator instance (see {@link IOCase#SYSTEM}) */
|
| /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/guava/src/com/google/common/collect/ |
| NullsFirstOrdering.java | 47 @Override public <S extends T> Ordering<S> reverse() { method in class:NullsFirstOrdering
48 // ordering.reverse() might be optimized, so let it do its thing
49 return ordering.reverse().nullsLast();
|
