| /external/wpa_supplicant_8/src/ap/ |
| wmm.c | 207 * leftmost 3 bits, i.e., 0x2000 = 1.0 */
|
| /hardware/ti/omap4xxx/domx/omx_core/inc/ |
| OMX_TI_IVCommon.h | [all...] |
| /libcore/luni/src/main/java/java/security/spec/ |
| ECFieldF2m.java | 86 // the leftmost bit must be (m+1)-th one,
|
| /cts/tests/tests/text/src/android/text/method/cts/ |
| ScrollingMovementMethodTest.java | 106 int leftMost = mTextView.getScrollX();
177 assertEquals(leftMost, mTextView.getScrollX());
[all...] |
| /external/chromium_org/third_party/re2/re2/ |
| dfa.cc | 74 // returning the leftmost end of the match instead of the rightmost one.
378 // in the work queue when in leftmost-longest matching mode.
383 // In leftmost longest mode, marks separate sections
592 // mimics backtracking implementations (so-called leftmost first matching) or
593 // traditional DFA implementations (so-called leftmost longest matching as
674 // but in fact the correct leftmost-first match is the leading "" (0,0).
862 // a leftmost-longest unanchored search, separate out from out1
[all...] |
| nfa.cc | 346 // Leftmost-longest mode: save this match only if
353 // Leftmost-biased mode: this match is by definition
|
| /external/chromium_org/third_party/re2/ |
| ucs2.diff | 25 if (TrySearch(prog_->start(), p)) // Match must be leftmost; done.
350 if (Visit(prog_->start(), p)) // Match must be leftmost; done.
|
| /external/chromium_org/third_party/skia/src/core/ |
| SkScan_AntiPath.cpp | 66 /// Leftmost x coordinate in any row, in destination coordinates.
68 /// Leftmost x coordinate in any row, in supersampled coordinates.
|
| /external/guava/guava/src/com/google/common/net/ |
| InternetDomainName.java | 160 * Returns the index of the leftmost part of the public suffix, or -1 if not
456 * this one; that is, the current domain with the leftmost part removed. For
|
| /external/llvm/docs/ |
| re_format.7 | 476 since a null match is the only leftmost match.
701 since a null match is the only leftmost match.
|
| /external/regex-re2/re2/ |
| dfa.cc | 72 // returning the leftmost end of the match instead of the rightmost one.
376 // in the work queue when in leftmost-longest matching mode.
381 // In leftmost longest mode, marks separate sections
590 // mimics backtracking implementations (so-called leftmost first matching) or
591 // traditional DFA implementations (so-called leftmost longest matching as
672 // but in fact the correct leftmost-first match is the leading "" (0,0).
860 // a leftmost-longest unanchored search, separate out from out1
[all...] |
| nfa.cc | 346 // Leftmost-longest mode: save this match only if
353 // Leftmost-biased mode: this match is by definition
|
| /external/regex-re2/ |
| ucs2.diff | 25 if (TrySearch(prog_->start(), p)) // Match must be leftmost; done.
350 if (Visit(prog_->start(), p)) // Match must be leftmost; done.
|
| /external/skia/src/core/ |
| SkScan_AntiPath.cpp | 66 /// Leftmost x coordinate in any row, in destination coordinates.
68 /// Leftmost x coordinate in any row, in supersampled coordinates.
|
| /frameworks/av/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 */
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
| heapq.py | 300 childpos = 2*pos + 1 # leftmost child position
336 childpos = 2*pos + 1 # leftmost child position
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
| heapq.py | 300 childpos = 2*pos + 1 # leftmost child position
336 childpos = 2*pos + 1 # leftmost child position
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| GrRedBlackTree.h | 269 Node* leftMost = NULL;
276 leftMost = n;
283 return Iter(leftMost, this);
[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/libvpx/libvpx/vp9/common/ |
| vp9_loopfilter.c | [all...] |
| /external/skia/src/gpu/ |
| GrRedBlackTree.h | 269 Node* leftMost = NULL;
276 leftMost = n;
283 return Iter(leftMost, this);
[all...] |
| /external/chromium/chrome/browser/ui/gtk/ |
| gtk_custom_menu_item.cc | 190 // We search backwards to find the leftmost and rightmost buttons. The
|
| /external/chromium_org/chrome/browser/ui/gtk/ |
| gtk_custom_menu_item.cc | 192 // We search backwards to find the leftmost and rightmost buttons. The
|
| /external/chromium_org/chrome/common/extensions/docs/templates/articles/ |
| external_extensions.html | 188 <li> If the leftmost icon in the Console says "Show Log List", click that icon. A second column appears at the left. </li>
|
| /external/chromium_org/third_party/freetype/src/autofit/ |
| afloader.c | 195 AF_Edge edge1 = axis->edges; /* leftmost edge */
|
