/external/opencore/codecs_v2/video/m4v_h263/dec/src/ |
chvr_filter.cpp | 65 /* brwidth contains the block number of the leftmost block 86 /* Set brwidth to the first (leftmost) block number of the next row */
|
/frameworks/base/media/libstagefright/codecs/m4v_h263/dec/src/ |
chvr_filter.cpp | 65 /* brwidth contains the block number of the leftmost block 86 /* Set brwidth to the first (leftmost) block number of the next row */
|
/dalvik/libcore/text/src/main/java/java/text/ |
SimpleDateFormat.java | 290 * parse "1234". In other words, the leftmost field of the run is flexible, 292 * then the leftmost field is shortened by one character, and the entire run is 294 * leftmost field is one character in length. If the parse still fails at that [all...] |
/external/e2fsprogs/e2fsck/ |
dict.c | 472 } else { /* could be dupes, find leftmost one */ 670 * successor (i.e. the leftmost node in the right subtree.) By doing this, 855 * Return the node with the lowest (leftmost) key. If the dictionary is empty [all...] |
/external/icu4c/i18n/unicode/ |
smpdtfmt.h | 193 * parse "1234". In other words, the leftmost field of the run is flexible, 195 * then the leftmost field is shortened by one character, and the entire run is 197 * leftmost field is one character in length. If the parse still fails at that [all...] |
/dalvik/libcore/luni/src/main/java/java/net/ |
SocketPermission.java | 402 * If it is included, it must be in the leftmost position
|
/external/freetype/src/autofit/ |
afloader.c | 179 AF_Edge edge1 = axis->edges; /* leftmost edge */
|
/external/icu4c/common/ |
util.cpp | 151 * reverse direction. In either case, the leftmost index will be
|
/external/v8/src/ |
virtual-frame.cc | 146 // Find the leftmost (ordered by register number) register whose only
|
/external/webkit/JavaScriptCore/tests/mozilla/ecma/String/ |
15.5.4.6-2.js | 28 specified position, then the index of the leftmost such
|
/external/webkit/WebCore/editing/ |
InsertParagraphSeparatorCommand.cpp | 179 // Use the leftmost candidate.
|
VisiblePosition.cpp | 456 // FIXME (9535): Canonicalizing to the leftmost candidate means that if we're at a line wrap, we will
|
/frameworks/base/awt/org/apache/harmony/awt/gl/font/ |
CaretManager.java | 165 if (hitInfo.getCharIndex() >= 0) { // Don't check for leftmost info
|
/frameworks/base/docs/html/guide/topics/ui/ |
layout-objects.jd | 82 leftmost — is considered the reference line). This is so that people scanning
|
/packages/apps/Phone/src/com/android/phone/ |
InCallMenu.java | 202 // Row 0 is the topmost row onscreen, item 0 is the leftmost item in a row.
|
InCallMenuView.java | 68 * Row 0 is the topmost row onscreen, item 0 is the leftmost item in a row.
|
/cts/tests/tests/text/src/android/text/method/cts/ |
ScrollingMovementMethodTest.java | 129 int leftMost = mTextView.getScrollX(); 200 assertEquals(leftMost, mTextView.getScrollX()); [all...] |
/external/webkit/JavaScriptCore/bytecompiler/ |
NodesCodegen.cpp | [all...] |
/external/e2fsprogs/ext2ed/doc/ |
ext2fs-overview.sgml | 580 Those are divided into two parts - The rightmost 4 digits and the leftmost 2 628 <Title>The leftmost two octal digits</Title> 631 Note the the leftmost octal digit can only be 0 or 1, since the total number [all...] |
/external/bluetooth/glib/glib/ |
gutf8.c | 648 * Finds the leftmost occurrence of the given Unicode character 653 * otherwise, a pointer to the start of the leftmost occurrence of [all...] |
/frameworks/base/core/java/android/widget/ |
HorizontalScrollView.java | 704 * to the leftmost/rightmost component in the new visible area. If no 740 * to the leftmost/rightmost component in the new visible area. If no [all...] |
/external/grub/stage2/ |
jfs.h | 116 #define BT_LEFTMOST 0x20 /* leftmost page */
|
/external/icu4c/common/unicode/ |
ushape.h | 200 * the leftmost displayed character stored first.
|
/external/srec/srec/cfront/ |
sp_fft.c | 68 * round the result based on the leftmost bit shifted out.
|
/external/stlport/stlport/stl/ |
_tree.h | 42 but also to the leftmost node of the tree, to enable constant time
|