/external/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/algorithms/alg.nonmodifying/alg.adjacent.find/Android.mk 19 test_name := algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find_pred 23 test_name := algorithms/alg.nonmodifying/alg.adjacent.find/adjacent_find
|
/external/libcxx/test/numerics/numeric.ops/adjacent.difference/ |
H A D | Android.mk | 17 test_makefile := external/libcxx/test/numerics/numeric.ops/adjacent.difference/Android.mk 19 test_name := numerics/numeric.ops/adjacent.difference/adjacent_difference_op 23 test_name := numerics/numeric.ops/adjacent.difference/adjacent_difference
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/toolbox/ |
H A D | InspectedPagePlaceholder.js | 30 var adjacent = { top: true, right: true, bottom: true, left: true }; 38 if (adjacent[side] && !parent.hasCustomResizer() && parent.isResizable()) 40 adjacent[side] = false;
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Interval.java | 100 /** Are two intervals adjacent such as 0..41 and 42..42? */ 101 public boolean adjacent(Interval other) { method in class:Interval
|
H A D | IntervalSet.java | 112 if ( addition.adjacent(r) || !addition.disjoint(r) ) { 120 if ( bigger.adjacent(next)||!bigger.disjoint(next) ) { 156 if ( addition.adjacent(r) || !addition.disjoint(r) ) { 165 if ( bigger.adjacent(next)||!bigger.disjoint(next) ) {
|
/external/owasp/sanitizer/empiricism/ |
H A D | html-containment.js | 300 function breadthFirstSearch(start, isEnd, eq, adjacent) { 312 var adjacentNodes = adjacent(candidate.node);
|
/external/llvm/include/llvm/ADT/ |
H A D | IntervalMap.h | 119 // in an interval, and if two intervals are adjacent so they can be coalesced. 146 /// adjacent - Return true when the intervals [x;a] and [b;y] can coalesce. 148 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapInfo 167 /// adjacent - Return true when the intervals [x;a) and [b;y) can coalesce. 168 static inline bool adjacent(const T &a, const T &b) { function in struct:llvm::IntervalMapHalfOpenInfo 544 // The intervals are kept sorted and fully coalesced so there are no adjacent 553 // - value(i) != value(i + 1) || !Traits::adjacent(stop(i), start(i + 1)) 634 if (i && value(i - 1) == y && Traits::adjacent(stop(i - 1), a)) { 637 if (i != Size && value(i) == y && Traits::adjacent(b, start(i))) { 659 if (value(i) == y && Traits::adjacent( [all...] |
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/x86/ |
H A D | mfqe_sse2.asm | 222 ; phaddd only operates on adjacent double words. 241 ; phaddw could be used to sum adjacent values but we want
|
/external/libvpx/libvpx/vp8/common/x86/ |
H A D | mfqe_sse2.asm | 222 ; phaddd only operates on adjacent double words. 241 ; phaddw could be used to sum adjacent values but we want
|
/external/chromium_org/third_party/libvpx/source/libvpx/vp8/common/arm/armv6/ |
H A D | sixtappredict8x4_v6.asm | 104 ;;add r9, ppl, #30 ; attempt to load 2 adjacent cache lines
|
/external/libvpx/libvpx/vp8/common/arm/armv6/ |
H A D | sixtappredict8x4_v6.asm | 104 ;;add r9, ppl, #30 ; attempt to load 2 adjacent cache lines
|
/external/libvpx/libvpx/vp8/common/arm/neon/ |
H A D | variance_neon.asm | 46 ;VPADAL adds adjacent pairs of elements of a vector, and accumulates
|
/external/chromium_org/ui/gfx/ |
H A D | render_text.cc | 538 // Use an adjacent selection model if the cursor is not at a valid position. 1138 size_t adjacent = (caret_affinity == CURSOR_BACKWARD) ? local 1140 return range.Contains(Range(caret_pos, adjacent));
|
/external/clang/lib/Lex/ |
H A D | LiteralSupport.cpp | 597 // Check for long long. The L's need to be adjacent and the same case.
|
/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/parse-only/ |
H A D | prototype-1.6.0.3.js | 1774 adjacent: function() { 2906 adjacent: "/following-sibling::*[1]", 3020 adjacent: 'c = "adjacent";', 3029 adjacent: /^\s*\+\s*/, 3134 adjacent: function(nodes) { 3193 } else if (combinator == 'adjacent') {
|
H A D | concat-jquery-mootools-prototype.js | 10153 adjacent: function() { 11285 adjacent: "/following-sibling::*[1]", 11399 adjacent: 'c = "adjacent";', 11408 adjacent: /^\s*\+\s*/, 11513 adjacent: function(nodes) { 11572 } else if (combinator == 'adjacent') {
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/ |
H A D | inspectorStyle.css | 857 .console-adjacent-user-command-result .console-user-command { 861 .console-adjacent-user-command-result + .console-user-command-result.console-log-level::before {
|
/external/blktrace/btt/doc/ |
H A D | btt.tex | 259 the block IO layer in adjacent sectors. (Obviously, the higher this
|
/external/chromium_org/third_party/WebKit/PerformanceTests/Dromaeo/resources/dromaeo/web/lib/ |
H A D | prototype-1.7.js | 2240 adjacent: function(element) {
|
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
H A D | Antlr.Runtime.pas | 2776 /// 1. for any inserts to same index, combine even if not adjacent.
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.core.resources_3.6.1.R36x_v20101007-1215.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | com.ibm.icu_4.2.1.v20100412.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.osgi_3.6.1.R36x_v20100806.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.osgi_3.6.2.R36x_v20101103.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
/external/antlr/antlr-3.4/lib/ |
H A D | antlr-3.4-complete.jar | META-INF/ META-INF/MANIFEST.MF org/ org/antlr/ org/antlr/analysis/ org/antlr/codegen/ org/ ... |