Searched
full:reverse (Results
426 -
450 of
1025) sorted by null
<<11121314151617181920>>
/external/bluetooth/glib/tests/ |
queue-test.c | 200 IS_EMPTY, GET_LENGTH, REVERSE, COPY, 281 case REVERSE:
|
/external/freetype/src/base/ |
ftoutln.c | 550 /* reverse point table */ 567 /* reverse tags table */
|
/external/guava/src/com/google/common/collect/ |
ImmutableSortedMap.java | 295 * ordered by the reverse of their natural ordering. 303 return new Builder<K, V>(Ordering.natural().reverse());
|
ImmutableSortedSet.java | 438 * ordered by the reverse of their natural ordering. 446 return new Builder<E>(Ordering.natural().reverse());
|
/external/icu4c/i18n/ |
tblcoll.cpp | 436 * character, they are compared from the beginning. To handle this, we reverse 437 * all of the accents that belong to each base character, then we reverse the
|
/external/icu4c/test/cintltst/ |
ncnvfbts.c | 581 /* for testing reverse fallback behavior */ 600 /* for testing reverse fallback behavior */
|
/external/libpng/contrib/visupng/ |
VisualPng.c | 891 *dst++ = b; /* note the reverse order */ 948 *dst++ = b; /* note the reverse order */
|
/external/opencore/codecs_v2/audio/aac/dec/src/ |
digit_reversal_tables.cpp | 32 Tables for digit reverse operation 79 Digit Reverse tables
|
inv_long_complex_rot.cpp | 81 for the case of long windows. It also performs digit reverse ordering of 90 exp(-j(2pi/N)(k+1/8)), digit reverse ordering and word normalization
|
inv_short_complex_rot.cpp | 79 for the case of short windows. It performs digit reverse ordering as well 86 exp( j(2pi/N)(k+1/8)), digit reverse ordering and word normalization
|
/external/proguard/src/proguard/gui/ |
boilerplate.pro | 199 public static int reverse(int); 225 public static long reverse(long);
|
/external/qemu/elff/ |
elf_file.h | 92 * in reverse order relatively to the order CUs have been added to the list
337 * NOTE: CUs in the list returned via last_cu() method are in reverse order
|
/external/skia/include/core/ |
SkPath.h | 80 /** Toggle between inverse and normal filltypes. This reverse the return 597 /* Append, in reverse order, the first contour of path, ignoring path's
|
/external/stlport/stlport/stl/ |
_algo.h | 310 // reverse and reverse_copy, and their auxiliary functions 332 reverse(_BidirectionalIter __first, _BidirectionalIter __last) { function
|
/external/tcpdump/missing/ |
getaddrinfo.c | 642 * if AI_CANONNAME and if reverse lookup 802 * if AI_CANONNAME and if reverse lookup
|
/external/webkit/WebCore/icu/unicode/ |
ubrk.h | 101 * Print each element in reverse order: 156 * //print each sentence in forward and reverse order
|
/external/webkit/WebKit/mac/WebCoreSupport/ |
WebViewFactory.mm | 706 return UI_STRING("fast reverse", "accessibility role description for fast reverse button");
|
/external/webkit/WebKit/win/ |
WebCoreLocalizedStrings.cpp | 156 return String(LPCTSTR_UI_STRING("fast reverse", "accessibility role description for fast reverse button"));
|
/frameworks/base/media/libstagefright/codecs/aacdec/ |
digit_reversal_tables.cpp | 32 Tables for digit reverse operation 79 Digit Reverse tables
|
inv_long_complex_rot.cpp | 81 for the case of long windows. It also performs digit reverse ordering of 90 exp(-j(2pi/N)(k+1/8)), digit reverse ordering and word normalization
|
inv_short_complex_rot.cpp | 79 for the case of short windows. It performs digit reverse ordering as well 86 exp( j(2pi/N)(k+1/8)), digit reverse ordering and word normalization
|
/packages/inputmethods/OpenWnn/libs/libwnnDictionary/engine/ |
ndapi.c | 43 static void set_operation_id(NJ_SEARCH_LOCATION *dicinfo, NJ_UINT8 reverse, NJ_RESULT *result); 413 static void set_operation_id(NJ_SEARCH_LOCATION *dicinfo, NJ_UINT8 reverse, NJ_RESULT *result) {
|
/prebuilt/linux-x86/swt/ |
about.html | 57 work is provided for debugging purposes so there is no need to reverse engineer the combined work.</p> 86 work is provided for debugging purposes so there is no need to reverse engineer the combined work.</p>
|
/prebuilt/linux-x86_64/swt/ |
about.html | 57 work is provided for debugging purposes so there is no need to reverse engineer the combined work.</p> 86 work is provided for debugging purposes so there is no need to reverse engineer the combined work.</p>
|
/external/icu4c/common/ |
rbbiscan.cpp | 337 // (forward, reverse, safe_forward, safe_reverse) 494 } else if (opt == UNICODE_STRING("reverse", 7)) { [all...] |
Completed in 307 milliseconds
<<11121314151617181920>>