Searched defs:reverse (Results 1 - 25 of 48) sorted by relevance

12

/external/clearsilver/util/
H A Dwildmat.c63 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)
/external/icu4c/layoutex/
H A DLXUtilities.cpp75 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/guava/src/com/google/common/collect/
H A DNaturalOrdering.java45 @Override public <S extends Comparable> Ordering<S> reverse() { method in class:NaturalOrdering
H A DNullsFirstOrdering.java47 @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();
H A DNullsLastOrdering.java47 @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();
H A DReverseNaturalOrdering.java24 /** An ordering that uses the reverse of the natural order of the values. */
42 @Override public <S extends Comparable> Ordering<S> reverse() { method in class:ReverseNaturalOrdering
78 return "Ordering.natural().reverse()";
H A DReverseOrdering.java26 /** An ordering that uses the reverse of a given order. */
40 @Override public <S extends T> Ordering<S> reverse() { method in class:ReverseOrdering
86 return forwardOrder + ".reverse()";
H A DIterables.java679 * for (String str : Iterables.reverse(mylist)) {
687 * @return an iterable with the same elements as the list, in reverse
689 public static <T> Iterable<T> reverse(final List<T> list) { method in class:Iterables
H A DOrdering.java39 * if (Ordering.from(comparator).reverse().isOrdered(list)) { ... }}</pre>
307 * Returns the reverse of this ordering; the {@code Ordering} equivalent to
311 // Ordering<String> o = Ordering.<String>natural().reverse();
313 public <S extends T> Ordering<S> reverse() { method in class:Ordering
339 * <p>Note that {@code ordering.lexicographical().reverse()} is not
340 * equivalent to {@code ordering.reverse().lexicographical()} (consider how
/external/webkit/WebCore/xml/
H A DXPathNodeSet.cpp172 void NodeSet::reverse() function in class:WebCore::XPath::NodeSet
/external/bluetooth/bluez/tools/
H A Dl2ping.c53 static int reverse = 0; variable
148 if (reverse)
197 if (!reverse && recv_cmd->code == L2CAP_ECHO_RSP)
289 reverse = 1;
/external/icu4c/layout/
H A DArabicLayoutEngine.cpp103 void ArabicOpenTypeLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, argument
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) argument
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, argument
213 adjustMarkGlyphs(&chars[offset], count, reverse, glyphStorage, &filter, success);
H A DLEFontInstance.cpp50 le_bool reverse, const LECharMapper *mapper, le_bool filterZeroWidth, LEGlyphStorage &glyphStorage) const
54 if (reverse) {
49 mapCharsToGlyphs(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse, const LECharMapper *mapper, le_bool filterZeroWidth, LEGlyphStorage &glyphStorage) const argument
/external/icu4c/test/perf/unisetperf/draft/
H A Dbitset.cpp33 uint16_t reverse[0x400]; member in struct:BMPBitHash
57 reverse[count]=hash;
79 k[i]=keys[reverse[i]];
/external/skia/src/core/
H A DSkLineClipper.cpp149 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
H A DSkQuadClipper.cpp71 bool reverse; local
78 reverse = true;
81 reverse = false;
129 if (reverse) {
H A DSkEdgeClipper.cpp37 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/elfutils/libebl/
H A Deblgstrtab.c44 char reverse[0]; member in struct:Ebl_GStrent
171 newstr->reverse[i * st->width + j] = str[(len - 2 - i) * st->width + j];
173 newstr->reverse[(len - 1) * st->width + j] = '\0';
197 cmpres = memcmp ((*sep)->reverse, newstr->reverse,
259 /* We have a new substring. This means we don't need the reverse
H A Deblstrtab.c44 char reverse[0]; member in struct:Ebl_Strent
167 newstr->reverse[i] = str[len - 2 - i];
168 newstr->reverse[len - 1] = '\0';
192 cmpres = memcmp ((*sep)->reverse, newstr->reverse,
248 /* We have a new substring. This means we don't need the reverse
H A Deblwstrtab.c45 wchar_t reverse[0]; member in struct:Ebl_WStrent
167 newstr->reverse[i] = str[len - 2 - i];
168 newstr->reverse[len - 1] = L'\0';
192 cmpres = wmemcmp ((*sep)->reverse, newstr->reverse,
248 /* We have a new substring. This means we don't need the reverse
/external/icu4c/common/
H A Dbrkeng.cpp78 UBool reverse,
83 if (reverse) {
75 findBreaks( UText *text, int32_t startPos, int32_t endPos, UBool reverse, int32_t breakType, UStack & ) const argument
H A Ddictbe.cpp47 UBool reverse,
58 if (reverse) {
44 findBreaks( UText *text, int32_t startPos, int32_t endPos, UBool reverse, int32_t breakType, UStack &foundBreaks ) const argument
/external/jdiff/src/jdiff/
H A DDiffMyers.java357 producing an edit script in reverse order. */
427 public change diff_2(final boolean reverse) { argument
461 if (reverse)
/external/openssl/apps/
H A Dpasswd.c43 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)
417 do_passwd(int passed_salt, char **salt_p, char **salt_malloc_p, char *passwd, BIO *out, int quiet, int table, int reverse, size_t pw_maxlen, int usecrypt, int use1, int useapr1) argument
[all...]
/external/stlport/stlport/stl/
H A D_algo.h310 // reverse and reverse_copy, and their auxiliary functions
332 reverse(_BidirectionalIter __first, _BidirectionalIter __last) { function

Completed in 53 milliseconds

12