| /external/skia/legacy/src/core/ |
| SkEdgeClipper.cpp | 30 it to be increasing in Y. If it had to reverse the order of the points,
123 bool reverse = sort_increasing_Y(pts, srcPts, 3); local
135 reverse = !reverse;
143 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
147 this->appendVLine(clip.fRight, pts[0].fY, pts[2].fY, reverse);
158 this->appendVLine(clip.fLeft, tmp[0].fY, tmp[2].fY, reverse);
166 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
177 this->appendQuad(tmp, reverse);
178 this->appendVLine(clip.fRight, tmp[2].fY, tmp[4].fY, reverse);
[all...] |
| SkQuadClipper.h | 57 void appendVLine(SkScalar x, SkScalar y0, SkScalar y1, bool reverse);
58 void appendQuad(const SkPoint pts[3], bool reverse);
59 void appendCubic(const SkPoint pts[4], bool reverse);
|
| /external/skia/src/core/ |
| SkEdgeClipper.cpp | 30 it to be increasing in Y. If it had to reverse the order of the points,
127 bool reverse = sort_increasing_Y(pts, srcPts, 3); local
139 reverse = !reverse;
147 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
151 this->appendVLine(clip.fRight, pts[0].fY, pts[2].fY, reverse);
162 this->appendVLine(clip.fLeft, tmp[0].fY, tmp[2].fY, reverse);
172 this->appendVLine(clip.fLeft, pts[0].fY, pts[2].fY, reverse);
185 this->appendQuad(tmp, reverse);
186 this->appendVLine(clip.fRight, tmp[2].fY, tmp[4].fY, reverse);
[all...] |
| SkQuadClipper.h | 57 void appendVLine(SkScalar x, SkScalar y0, SkScalar y1, bool reverse);
58 void appendQuad(const SkPoint pts[3], bool reverse);
59 void appendCubic(const SkPoint pts[4], bool reverse);
|
| /external/compiler-rt/lib/tsan/lit_tests/ |
| atomic_race.cc | 41 fprintf(stderr, "Test %d reverse\n", i);
73 // CHECK: Test 0 reverse
75 // CHECK: Test 1 reverse
77 // CHECK: Test 2 reverse
79 // CHECK: Test 3 reverse
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| 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...] |
| /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/eigen/blas/ |
| level1_cplx_impl.h | 52 else if(*incx<0 && *incy>0) *res = (vector(x,*n,-*incx).reverse().dot(vector(y,*n,*incy)));
53 else if(*incx>0 && *incy<0) *res = (vector(x,*n,*incx).dot(vector(y,*n,-*incy).reverse()));
54 else if(*incx<0 && *incy<0) *res = (vector(x,*n,-*incx).reverse().dot(vector(y,*n,-*incy).reverse()));
71 else if(*incx<0 && *incy>0) *res = (vector(x,*n,-*incx).reverse().cwiseProduct(vector(y,*n,*incy))).sum();
72 else if(*incx>0 && *incy<0) *res = (vector(x,*n,*incx).cwiseProduct(vector(y,*n,-*incy).reverse())).sum();
73 else if(*incx<0 && *incy<0) *res = (vector(x,*n,-*incx).reverse().cwiseProduct(vector(y,*n,-*incy).reverse())).sum();
102 Reverse<StridedVectorType> rvx(vx);
103 Reverse<StridedVectorType> rvy(vy)
[all...] |
| level1_real_impl.h | 38 else if(*incx<0 && *incy>0) return (vector(x,*n,-*incx).reverse().cwiseProduct(vector(y,*n,*incy))).sum();
39 else if(*incx>0 && *incy<0) return (vector(x,*n,*incx).cwiseProduct(vector(y,*n,-*incy).reverse())).sum();
40 else if(*incx<0 && *incy<0) return (vector(x,*n,-*incx).reverse().cwiseProduct(vector(y,*n,-*incy).reverse())).sum();
70 Reverse<StridedVectorType> rvx(vx);
71 Reverse<StridedVectorType> rvy(vy);
|
| level1_impl.h | 22 else if(*incx>0 && *incy<0) vector(y,*n,-*incy).reverse() += alpha * vector(x,*n,*incx);
23 else if(*incx<0 && *incy>0) vector(y,*n,*incy) += alpha * vector(x,*n,-*incx).reverse();
24 else if(*incx<0 && *incy<0) vector(y,*n,-*incy).reverse() += alpha * vector(x,*n,-*incx).reverse();
158 else if(*incx>0 && *incy<0) vector(y,*n,-*incy).reverse().swap(vector(x,*n,*incx));
159 else if(*incx<0 && *incy>0) vector(y,*n,*incy).swap(vector(x,*n,-*incx).reverse());
160 else if(*incx<0 && *incy<0) vector(y,*n,-*incy).reverse().swap(vector(x,*n,-*incx).reverse());
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/ |
| X509Principal.java | 115 * some such, converting it into an ordered set of name attributes. If reverse
121 boolean reverse,
124 super(reverse, dirName);
134 * If reverse is true, create the encoded version of the sequence starting
138 boolean reverse,
142 super(reverse, lookUp, dirName);
|
| /external/openfst/src/bin/ |
| fstreverse.cc | 25 #include <fst/script/reverse.h>
34 using fst::script::Reverse;
55 Reverse(*ifst, out);
|
| /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
|
| /external/openfst/src/include/fst/ |
| weight.h | 54 // ReverseWeight: the type of the corresponding reverse weight.
57 // Reverse: a mapping from Weight to ReverseWeight s.t.
58 // --> Reverse(Reverse(a)) = a
59 // --> Reverse(Plus(a, b)) = Plus(Reverse(a), Reverse(b))
60 // --> Reverse(Times(a, b)) = Times(Reverse(b), Reverse(a)
[all...] |
| /development/samples/ApiDemos/res/anim/ |
| animator_set.xml | 24 android:repeatMode="reverse"/>
31 android:repeatMode="reverse"/>
|
| /development/samples/devbytes/animation/PropertyAnimations/res/animator/ |
| scale.xml | 20 android:repeatMode="reverse"
26 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);
|
| /external/openfst/src/script/ |
| shortest-distance.cc | 35 bool reverse, double delta) {
36 ShortestDistanceArgs2 args(ifst, distance, reverse, delta);
|
| /frameworks/ex/chips/src/com/android/ex/chips/recipientchip/ |
| BaseRecipientChip.java | 64 * before any reverse lookups.
70 * before any reverse lookups.
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/list/list.ops/ |
| reverse.pass.cpp | 12 // void reverse();
22 c1.reverse();
|
| /packages/apps/Email/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}) */
|
| /cts/tests/tests/graphics/src/android/graphics/drawable/cts/ |
| TransitionDrawableTest.java | 81 // start when there is a reverse transition in progress
109 // reset when there is a reverse transition in progress
122 // reverse when there is no transition
128 // reverse after the other transition ends
134 // reverse when there is a transition in progress
142 // reverse when there is a reverse transition in progress
|
| /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);
|
