| /external/grub/stage2/ |
| terminfo.c | 232 /* enter reverse video */
239 /* exit reverse video */
|
| /external/icu4c/common/ |
| brkeng.cpp | 78 UBool reverse,
83 if (reverse) {
|
| rbbidata.h | 78 uint32_t fRTable; /* Offset to the reverse state transition table. */
82 uint32_t fSRTable; /* safe point reverse transition table */
|
| rbbiscan.h | 72 // reverse rules,
126 // is a reverse direction rule (if it
|
| rbbirpt.txt | 77 # !Reverse rule.
81 default reverse-rule ^break-rule-end doReverseDir
97 reverse-rule:
|
| /external/icu4c/common/unicode/ |
| unimatch.h | 86 * Matching in the reverse direction is indicated by limit <
96 * reverse direction, this will be the index of the last matched
|
| /external/icu4c/layout/ |
| 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);
|
| OpenTypeLayoutEngine.cpp | 323 void OpenTypeLayoutEngine::adjustGlyphPositions(const LEUnicode chars[], le_int32 offset, le_int32 count, le_bool reverse,
362 fGPOSTable->process(glyphStorage, adjustments, reverse, fScriptTagV2, fLangSysTag, fGDEFTable, success, fFontInstance,
366 fGPOSTable->process(glyphStorage, adjustments, reverse, fScriptTag, fLangSysTag, fGDEFTable, success, fFontInstance,
|
| /external/qemu/android/ |
| cmdline-option.c | 173 /* note: store list items in reverse order here
208 /* reverse any parameter list before exit.
|
| /external/qemu/elff/ |
| dwarf_die.h | 140 * performace the list is created in reverse order (relatively to the order,
193 * performace the list is created in reverse order (relatively to the order,
|
| elf_alloc.h | 47 * allocated chunks in reverse order (relatively to the chunk allocation
101 * in reverse order (relatively to the chunk allocation sequence).
|
| /external/srec/srec/cfront/ |
| sp_fft.c | 327 Allocate bit reverse tables
331 unsigned forward, reverse, *tbl; local
340 reverse = n >> 1;
345 if (forward & j) tbl[j] |= reverse;
347 reverse >>= 1;
564 /* Bit reverse the data array */
632 /* center one needs no multiplication, but has to reverse sign */
692 ** to get fft data, we then need to reverse-shift the fixed data by the
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| float-weight.h | 144 TropicalWeight Reverse() const { return *this; }
210 LogWeight Reverse() const { return *this; }
|
| shortest-path.h | 255 // Algorithm works on the reverse of 'fst' : 'rfst' 'distance' is
257 // reverse of the tree of n-shortest path in 'rfst'.
262 Reverse(ifst, &rfst);
311 Arc arc(rarc.ilabel, rarc.olabel, rarc.weight.Reverse(), rarc.nextstate);
321 Weight finalw = rfst.Final(p.first).Reverse();
|
| /frameworks/base/tests/CoreTests/android/core/ |
| StringTest.java | 812 sBuf.reverse();
813 sBuf.reverse();
814 sBuf.reverse();
815 sBuf.reverse();
816 sBuf.reverse();
817 sBuf.reverse();
818 sBuf.reverse();
819 sBuf.reverse();
820 sBuf.reverse();
821 sBuf.reverse();
[all...] |
| /dalvik/libcore/xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMDefaultBaseTraversers.java | 198 * Implements traversal of the Ancestor access, in reverse document order.
242 * Implements traversal of the Ancestor access, in reverse document order.
328 * Implements traversal of the Ancestor access, in reverse document order.
579 * Implements traversal of the Ancestor access, in reverse document order.
758 * Implements traversal of the Ancestor access, in reverse document order.
981 * Implements traversal of the Ancestor access, in reverse document order.
1023 * Implements traversal of the Ancestor access, in reverse document order.
[all...] |
| /external/icu4c/i18n/ |
| cpdtrans.cpp | 64 * @param forward if false, does the list in reverse order, and
136 * @param direction either FORWARD or REVERSE
143 * @param fixReverseID if TRUE, then reconstruct the ID of reverse
182 * is, it should be in the FORWARD order; if direction is REVERSE then
184 * @param direction either FORWARD or REVERSE
185 * @param fixReverseID if TRUE, then reconstruct the ID of reverse
213 // Reverse the order if necessary.
|
| /frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
| ualgo.h | 192 /// \brief Reverse reverses a range.
198 inline void reverse (BidirectionalIterator first, BidirectionalIterator last) function in namespace:ustl
223 reverse (first, middle);
224 reverse (middle, last);
227 reverse (first, (first == middle ? last : middle));
277 reverse (first, middle);
278 reverse (first, ++middle);
|
| /frameworks/base/tools/preload/ |
| sorttable.js | 96 // reverse the table, which is quicker
97 sorttable.reverse(this.sorttable_tbody);
108 // if we're already sorted by this column in reverse, just
109 // re-reverse the table, which is quicker
110 sorttable.reverse(this.sorttable_tbody);
244 reverse: function(tbody) {
245 // reverse the rows in a tbody
|
| /external/dnsmasq/src/ |
| cache.c | 157 are at the start of the hash-chain and all non-reverse
159 This allows reverse searches and garbage collection to be optimised */
262 If (flags & F_REVERSE) then remove any reverse entries for addr and any expired
269 We take advantage of the fact that hash chains have stuff in the order <reverse>,<other>,<immortal>
270 so that when we hit an entry which isn't reverse and is immortal, we're done. */
594 also free anything which has expired. All the reverse entries are at the
596 non-REVERSE one. */
667 a HOSTS file. Since the first host entry gets reverse, we know
1078 /* avoid multiple reverse mappings */
[all...] |
| /bionic/libc/ |
| Jamfile | 35 # reverse a list of elements
36 rule Reverse list
93 result = [ Reverse $(result) ] ;
|
| /external/bison/lib/ |
| bitset.h | 275 /* Find reverse list of up to NUM bits set in BSET starting from and
324 /* Loop over all elements of BSET, in reverse order starting with
326 following will print the bits set in a bitset in reverse order:
|
| /external/kernel-headers/original/linux/ |
| qic117.h | 139 /*11*/ {"physical reverse", 0x17, 0x05, motion, 0, required},\
153 /*25*/ {"skip segments reverse", 0x36, 0x24, motion, 1, required},\
162 /*34*/ {"skip extended reverse", 0x36, 0x24, motion, 1, ccs1},\
|
| /external/tcpdump/ |
| smbutil.c | 435 int reverse = 0; local
486 reverse = !reverse;
503 x = reverse ? EXTRACT_16BITS(buf) :
514 x = reverse ? EXTRACT_32BITS(buf) :
525 x = reverse ? EXTRACT_64BITS(buf) :
538 x1 = reverse ? EXTRACT_32BITS(buf) :
540 x2 = reverse ? EXTRACT_32BITS(buf + 4) :
562 x = reverse ? EXTRACT_16BITS(buf) :
573 x = reverse ? EXTRACT_32BITS(buf)
[all...] |
| /frameworks/base/location/java/android/location/ |
| Geocoder.java | 32 * A class for handling geocoding and reverse geocoding. Geocoding is
34 * of a location into a (latitude, longitude) coordinate. Reverse
37 * reverse geocoded location description may vary, for example one
|
