/external/webkit/Source/WebCore/xml/ |
H A D | XPathNodeSet.h | 70 void markSubtreesDisjoint(bool disjoint) { m_subtreesAreDisjoint = disjoint; } argument
|
/external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/util/ |
H A D | Collections2Test.java | 348 assertTrue(Collections.disjoint(c1, c2)); 350 assertFalse(Collections.disjoint(c1, c2)); 356 assertTrue(Collections.disjoint(c1, c2)); 358 assertFalse(Collections.disjoint(c1, c2)); 364 assertTrue(Collections.disjoint(c1, c2)); 366 assertFalse(Collections.disjoint(c1, c2)); 372 assertTrue(Collections.disjoint(c1, c2)); 374 assertFalse(Collections.disjoint(c1, c2)); 380 assertTrue(Collections.disjoint(c1, c2)); 382 assertFalse(Collections.disjoint(c [all...] |
/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
H A D | CollectionRetainAllTester.java | 65 private Target disjoint; field in class:CollectionRetainAllTester 84 disjoint 85 = new Target(disjointList, "disjoint"); 135 // retainAll(disjoint) 140 expectReturnsFalse(disjoint); 147 expectReturnsFalseOrThrows(disjoint); 154 expectReturnsTrue(disjoint); 162 expectThrows(disjoint); 280 expectReturnsTrue(disjoint);
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | util.rb | 168 def disjoint?( range )
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Interval.java | 82 /** Does this.a start after other.b? May or may not be disjoint */ 95 /** Are both ranges disjoint? I.e., no overlap? */ 96 public boolean disjoint(Interval other) { method in class:Interval 121 * within this, which would result in two disjoint intervals
|
H A D | IntervalSet.java | 50 * The ranges are ordered and disjoint so that 2..6 appears before 101..103. 55 /** The list of sorted, disjoint intervals. */ 112 if ( addition.adjacent(r) || !addition.disjoint(r) ) { 120 if ( bigger.adjacent(next)||!bigger.disjoint(next) ) { 135 // if disjoint and after r, a future iteration will handle it 137 // ok, must be after last interval (and disjoint from last interval) 156 if ( addition.adjacent(r) || !addition.disjoint(r) ) { 165 if ( bigger.adjacent(next)||!bigger.disjoint(next) ) { 179 // if disjoint and after r, a future iteration will handle it 181 // ok, must be after last interval (and disjoint fro [all...] |
/external/chromium/chrome/browser/sync/ |
H A D | README.js | 33 handled by the JsBackends and the JsFrontend are disjoint, which means
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | FeatureSpecificTestSuiteBuilder.java | 19 import static java.util.Collections.disjoint; 269 return !disjoint(a, b);
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime/ |
H A D | TokenRewriteStream.cs | 607 // throw exception unless disjoint or identical 608 bool disjoint = 614 if (prevRop.text == null && rop.text == null && !disjoint) 622 else if ( !disjoint && !same )
|
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
H A D | TokenRewriteStream.java | 489 // throw exception unless disjoint or identical 490 boolean disjoint = 496 if ( prevRop.text==null && rop.text==null && !disjoint ) { 503 else if ( !disjoint && !same ) {
|
/external/antlr/antlr-3.4/runtime/ActionScript/project/src/org/antlr/runtime/ |
H A D | TokenRewriteStream.as | 338 // throw exception unless disjoint or identical 339 var disjoint:Boolean = 343 if ( !disjoint && !same ) {
|
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime/ |
H A D | TokenRewriteStream.cs | 519 // throw exception unless disjoint or identical 520 bool disjoint = 524 if (!disjoint && !same) {
|
/external/antlr/antlr-3.4/runtime/Python/antlr3/ |
H A D | streams.py | 1420 # throw exception unless disjoint or identical 1421 disjoint = (prevRop.lastIndex < rop.index 1429 if prevRop.text is None and rop.text is None and not disjoint: 1436 elif not disjoint and not same:
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | Grammar.java | 1211 List<IntervalSet> disjoint = makeEdgeSetsDisjoint(edges); 1212 //System.out.println("disjoint="+disjoint); 1215 for (int i = 0; i < disjoint.size(); i++) { 1216 IntervalSet ds = (IntervalSet) disjoint.get(i); 1248 // walk each incoming edge label/set and add to disjoint set
|
/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/ ... |
/external/antlr/antlr-3.4/runtime/Delphi/Sources/Antlr3.Runtime/ |
H A D | Antlr.Runtime.pas | 6046 // throw exception unless disjoint or identical
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.swt.gtk.linux.x86_3.6.1.v3657a.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |
H A D | org.eclipse.swt.win32.win32.x86_3.6.1.v3657a.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |