| /external/icu4c/layout/ |
| 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 | 239 * @param reverse - <code>TRUE</code> if the glyphs in the glyph array have been reordered
246 virtual void adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, LEGlyphStorage &glyphStorage, LEErrorCode &success);
269 * text with the ability to store the glyphs in reverse order, and by supporting
277 * @param reverse - if <code>TRUE</code>, the output will be in reverse order
287 virtual void mapCharsToGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, le_bool mirror, LEGlyphStorage &glyphStorage, LEErrorCode &success);
315 * @param reverse - <code>TRUE</code> if the glyph array has been reordered
323 static void adjustMarkGlyphs(const LEUnicode chars[], le_int32 charCount, le_bool reverse, LEGlyphStorage &glyphStorage, LEGlyphFilter *markFilter, LEErrorCode &success);
|
| /external/openfst/src/include/fst/script/ |
| reverse.h | 22 #include <fst/reverse.h>
30 void Reverse(ReverseArgs *args) {
34 Reverse(fst1, fst2);
37 void Reverse(const FstClass &fst1, MutableFstClass *fst2);
|
| /external/openfst/src/script/ |
| reverse.cc | 19 #include <fst/script/reverse.h>
24 void Reverse(const FstClass &fst1, MutableFstClass *fst2) {
25 if (!ArcTypesMatch(fst1, *fst2, "Reverse")) return;
29 Apply<Operation<ReverseArgs> >("Reverse", fst1.ArcType(), &args);
32 REGISTER_FST_OPERATION(Reverse, StdArc, ReverseArgs);
33 REGISTER_FST_OPERATION(Reverse, LogArc, ReverseArgs);
34 REGISTER_FST_OPERATION(Reverse, Log64Arc, ReverseArgs);
|
| rmepsilon.cc | 25 bool reverse, const RmEpsilonOptions &opts) {
28 RmEpsilonArgs1 args(ifst, ofst, reverse, opts);
|
| shortest-distance.cc | 35 bool reverse, double delta) {
36 ShortestDistanceArgs2 args(ifst, distance, reverse, delta);
|
| /external/skia/legacy/src/core/ |
| SkQuadClipper.cpp | 64 bool reverse; local
71 reverse = true;
74 reverse = false;
122 if (reverse) {
|
| /external/skia/src/core/ |
| SkQuadClipper.cpp | 66 bool reverse; local
73 reverse = true;
76 reverse = false;
124 if (reverse) {
|
| /ndk/sources/cxx-stl/llvm-libc++/test/containers/sequences/forwardlist/forwardlist.ops/ |
| reverse.pass.cpp | 12 // void reverse();
26 c.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/chromium/chrome/browser/ui/views/tab_contents/ |
| native_tab_contents_container_win.cc | 129 bool reverse) {
130 container_->tab_contents()->FocusThroughTabTraversal(reverse);
|
| native_tab_contents_container_gtk.h | 35 virtual void AboutToRequestFocusFromTabTraversal(bool reverse) OVERRIDE;
|
| /external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
| tokenutil.py | 99 reverse=False):
110 reverse: When true, search the tokens before this one instead of the tokens
118 if reverse:
147 def Search(start_token, token_types, distance=None, reverse=False):
156 reverse: When true, search the tokens before this one instead of the tokens
164 None, distance, reverse)
167 def SearchExcept(start_token, token_types, distance=None, reverse=False):
176 reverse: When true, search the tokens before this one instead of the tokens
185 None, distance, reverse)
189 reverse=False)
[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_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/guava/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/guava/guava-tests/test/com/google/common/collect/ |
| SortedIterablesTest.java | 61 assertTrue(SortedIterables.hasSameComparator(Ordering.natural().reverse(),
62 Sets.newTreeSet(Ordering.natural().reverse())));
|
| /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,
|
| /external/icu4c/layoutex/ |
| 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
|
| /external/webkit/Source/JavaScriptCore/tests/mozilla/ecma/Array/ |
| 15.4.2.3.js | 58 array[item++] = new TestCase( SECTION, "(new Array()).reverse == Array.prototype.reverse", true, (new Array()).reverse == Array.prototype.reverse );
|
| /external/protobuf/python/ |
| stubout.py | 73 mro.reverse()
102 self.stubs.reverse()
134 # Undo calls to Set() in reverse order, in case Set() was called on the
136 self.cache.reverse()
|
| /build/tools/ |
| fileslist.py | 40 output.sort(key=operator.itemgetter(0), reverse=True)
|
