| /external/icu4c/layoutex/ |
| LXUtilities.h | 21 static void reverse(le_int32 array[], le_int32 count);
22 static void reverse(float array[], le_int32 count);
|
| LXUtilities.cpp | 75 void LXUtilities::reverse(le_int32 array[], le_int32 length) function in class:LXUtilities
87 void LXUtilities::reverse(float array[], le_int32 length) function in class:LXUtilities
|
| /device/sample/frameworks/PlatformLibrary/java/com/example/android/platform_library/ |
| PlatformLibrary.java | 41 /* reverse a string, for no very good reason */
42 String reverse = reverseString("Android!"); local
44 Log.i("PlatformLibrary", "getInt: " + result + ", '" + reverse + "'");
63 * Native method that returns a new string that is the reverse of
|
| /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/clearsilver/util/ |
| wildmat.c | 63 register int reverse; local
92 reverse = p[1] == NEGATE_CLASS ? TRUE : FALSE;
93 if (reverse)
105 if (matched == reverse)
127 register int reverse; local
156 reverse = p[1] == NEGATE_CLASS ? TRUE : FALSE;
157 if (reverse)
169 if (matched == reverse)
|
| /dalvik/libcore/security/src/main/java/org/bouncycastle/jce/ |
| X509Principal.java | 97 * some such, converting it into an ordered set of name attributes. If reverse
103 boolean reverse,
106 super(reverse, dirName);
116 * If reverse is true, create the encoded version of the sequence starting
120 boolean reverse,
124 super(reverse, lookUp, dirName);
|
| /external/icu4c/layout/ |
| ArabicLayoutEngine.h | 128 * @param reverse - <code>TRUE</code> if the glyphs in the glyph array have been reordered
136 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success);
211 * @param reverse - if <code>TRUE</code>, the output will be in reverse order
219 virtual void mapCharsToGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, le_bool mirror,
230 * @param reverse - <code>TRUE</code> if the glyphs in the glyph array have been reordered
236 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success);
|
| GXLayoutEngine.h | 119 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse,
|
| ThaiLayoutEngine.h | 131 * @param reverse - <code>TRUE</code> if the glyphs in the glyph array have been reordered
138 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success);
|
| 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);
|
| LayoutEngine.h | 230 * @param reverse - <code>TRUE</code> if the glyphs in the glyph array have been reordered
237 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success);
260 * text with the ability to store the glyphs in reverse order, and by supporting
268 * @param reverse - if <code>TRUE</code>, the output will be in reverse order
278 virtual void mapCharsToGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, le_bool mirror, LEGlyphStorage &glyphStorage, LEErrorCode &success);
305 * @param reverse - <code>TRUE</code> if the glyph array has been reordered
313 static void adjustMarkGlyphs(const LEUnicode chars[], le_int32 charCount, le_bool reverse, LEGlyphStorage &glyphStorage, LEGlyphFilter *markFilter, LEErrorCode &success);
|
| /external/skia/src/core/ |
| SkQuadClipper.h | 64 void appendVLine(SkScalar x, SkScalar y0, SkScalar y1, bool reverse);
65 void appendQuad(const SkPoint pts[3], bool reverse);
66 void appendCubic(const SkPoint pts[4], bool reverse);
|
| 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...] |
| SkQuadClipper.cpp | 71 bool reverse; local
78 reverse = true;
81 reverse = false;
129 if (reverse) {
|
| SkLineClipper.cpp | 149 bool reverse; local
154 reverse = false;
158 reverse = true;
164 reverse = false;
168 reverse = false;
194 if (reverse) {
195 // copy the pts in reverse order to maintain winding order
|
| /external/webkit/JavaScriptCore/tests/mozilla/ecma/Array/ |
| 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...] |
| 15.4.2.3.js | 58 array[item++] = new TestCase( SECTION, "(new Array()).reverse == Array.prototype.reverse", true, (new Array()).reverse == Array.prototype.reverse );
|
| 15.4.2.1-3.js | 90 array[item++] = new TestCase( SECTION, "TEST_ARRAY.reverse", Array.prototype.reverse, TEST_ARRAY.reverse );
|
| /dalvik/vm/mterp/x86-atom/ |
| bincmp.S | 20 * variable to specify the reverse comparison to perform.
38 j${revcmp} 1f # goto next instruction if reverse
|
| /development/samples/ApiDemos/src/com/example/android/apis/animation/ |
| Rotate3dAnimation.java | 50 * @param reverse true if the translation should be reversed, false otherwise
53 float centerX, float centerY, float depthZ, boolean reverse) {
59 mReverse = reverse;
|
| /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();
|
| NullsLastOrdering.java | 47 @Override public <S extends T> Ordering<S> reverse() { method in class:NullsLastOrdering
48 // ordering.reverse() might be optimized, so let it do its thing
49 return ordering.reverse().nullsFirst();
|
| /external/icu4c/common/ |
| brkeng.h | 68 * @param reverse Whether the caller is looking for breaks in a reverse
77 UBool reverse,
193 * @param reverse Whether the caller is looking for breaks in a reverse
202 UBool reverse,
|
| dictbe.h | 87 * @param reverse Whether the caller is looking for breaks in a reverse
96 UBool reverse,
|
| /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);
|
