/external/apache-harmony/nio/src/test/java/common/org/apache/harmony/nio/tests/java/nio/channels/ |
H A D | FileLockTest.java | 146 * @tests java.nio.channels.FileLock#overlaps(long, long) 149 assertTrue(mockLock.overlaps(0, 11)); 150 assertFalse(mockLock.overlaps(0, 10)); 151 assertTrue(mockLock.overlaps(100, 110)); 152 assertTrue(mockLock.overlaps(99, 110)); 153 assertFalse(mockLock.overlaps(-1, 10)); 155 assertTrue(mockLock.overlaps(1, 120)); 156 assertTrue(mockLock.overlaps(20, 50));
|
/external/webkit/Source/WebCore/platform/graphics/gpu/ |
H A D | PODInterval.h | 105 bool overlaps(const T& low, const T& high) const function in class:WebCore::PODInterval 114 bool overlaps(const PODInterval& other) const function in class:WebCore::PODInterval 116 return overlaps(other.low(), other.high());
|
H A D | LoopBlinnPathProcessor.cpp | 544 // Run plane-sweep algorithm to determine overlaps of control point 781 Vector<IntervalType> overlaps = tree.allOverlaps(tree.createInterval(seg->getPoint(0).y(), local 786 if (overlaps.size() != slowOverlaps.size()) { 788 LOG_ERROR(" overlaps:"); 789 for (size_t i = 0; i < overlaps.size(); i++) 790 LOG_ERROR(" %d: %s", i+1, overlaps[i].data()->toString().ascii().data()); 797 ASSERT(overlaps.size() == slowOverlaps.size()); 799 for (Vector<IntervalType>::iterator iter = overlaps.begin(); iter != overlaps.end(); ++iter) { 817 break; // Abort iteration over overlaps 972 Vector<SweepInterval> overlaps; local [all...] |
H A D | PODIntervalTree.h | 112 // Starting from the given node, adds all overlaps with the given 132 if (node->data().overlaps(interval))
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/ |
H A D | util.rb | 164 def overlaps?( range ) 169 not overlaps?( range )
|
/external/antlr/antlr-3.4/runtime/Ruby/test/functional/token-rewrite/ |
H A D | basic.rb | 234 error.to_s.should == %q<operation (replace @ 1..2 : "foo") overlaps with previous operation (replace @ 0..3 : "bar")> 245 error.to_s.should == %q<operation (insert-before @ 4 : "y") overlaps with previous operation (replace @ 2..4 : "x")> 256 error.to_s.should == %q<operation (replace @ 3..5 : "foo") overlaps with previous operation (replace @ 2..4 : "xyz")> 267 error.to_s.should == %q<operation (replace @ 1..3 : "foo") overlaps with previous operation (replace @ 2..4 : "xyz")>
|
/external/llvm/include/llvm/CodeGen/ |
H A D | MachineLoopRanges.h | 55 /// overlaps - Return true if this loop overlaps the given range of machine 57 bool overlaps(SlotIndex Start, SlotIndex Stop);
|
H A D | LiveInterval.h | 362 /// overlaps - Return true if the intersection of the two live intervals is 364 bool overlaps(const LiveInterval& other) const { 370 /// overlaps - Return true if the two intervals have overlapping segments 375 bool overlaps(const LiveInterval &Other, const CoalescerPair &CP, 378 /// overlaps - Return true if the live interval overlaps a range specified 380 bool overlaps(SlotIndex Start, SlotIndex End) const;
|
H A D | ScheduleDAG.h | 123 bool overlaps(const SDep &Other) const { function in class:llvm::SDep 140 return overlaps(Other)
|
/external/webkit/Source/WebKit/android/jni/ |
H A D | PicturePile.cpp | 214 // Find the overlaps 215 Vector<int> overlaps; 229 overlaps.append(i); 231 overlaps.append(i); 234 if (overlaps.size() >= MAX_OVERLAP_COUNT) { 237 for (int i = (int) overlaps.size() - 1; i >= 0; i--) { 238 overlap.unite(m_pile[overlaps[i]].area); 239 m_pile.remove(overlaps[i]);
|
/external/webkit/Source/WebKit/chromium/tests/ |
H A D | PODIntervalTreeTest.cpp | 161 Vector<PODInterval<float, UserData1> > overlaps = tree.allOverlaps(tree.createInterval(3, 5, data1)); local 162 EXPECT_EQ(1U, overlaps.size()); 163 EXPECT_EQ(5, overlaps[0].data().a); 164 EXPECT_EQ(6, overlaps[0].data().b);
|
/external/llvm/lib/CodeGen/ |
H A D | MachineLoopRanges.cpp | 70 /// overlaps - Return true if this loop overlaps the given range of machine 72 bool MachineLoopRange::overlaps(SlotIndex Start, SlotIndex Stop) { function in class:MachineLoopRange
|
H A D | LiveRegMatrix.cpp | 123 if (VirtReg.overlaps(LIS->getRegUnit(*Units), CP, *LIS->getSlotIndexes()))
|
H A D | RegAllocPBQP.cpp | 220 // Record any overlaps with regmask operands. 237 // vregLI overlaps fixed regunit interference. 240 if (vregLI->overlaps(LIS->getRegUnit(*Units))) { 278 if (l1.overlaps(l2)) {
|
H A D | StackSlotColoring.cpp | 196 /// OverlapWithAssignments - Return true if LiveInterval overlaps with any 203 if (OtherLI->overlaps(*li))
|
H A D | LiveInterval.cpp | 87 // overlaps - Return true if the intersection of the two live intervals is 90 // An example for overlaps(): 102 // A->overlaps(C) should return false since we want to be able to join 146 bool LiveInterval::overlaps(const LiveInterval &Other, function in class:LiveInterval 175 // Advance the iterator that ends first to check for more overlaps. 188 /// overlaps - Return true if the live interval overlaps a range specified 190 bool LiveInterval::overlaps(SlotIndex Start, SlotIndex End) const { function in class:LiveInterval
|
H A D | ScheduleDAG.cpp | 69 if (I->overlaps(D)) {
|
H A D | StackColoring.cpp | 656 if (!First->overlaps(*Second)) {
|
H A D | RegisterCoalescer.cpp | 631 // If ALR and BLR overlaps and end of BLR extends beyond end of ALR, e.g. 1084 if (RHS.overlaps(LIS->getRegUnit(*UI))) {
|
/external/valgrind/main/coregrind/ |
H A D | m_transtab.c | 1132 Bool overlaps ( Addr64 start, ULong range, VexGuestExtents* vge ) function 1219 if (overlaps( guest_start, range, &tte->vge )) { 1242 && overlaps( guest_start, range, &sec->tt[i].vge )) { 1357 vg_assert(!overlaps( guest_start, range, &tte->vge )); 1522 && overlaps( guest_start, range, &unredir_tt[i].vge))
|
/external/antlr/antlr-3.4/runtime/Ruby/lib/antlr3/streams/ |
H A D | rewrite.rb | 230 elsif location.overlaps?( prior_location ) 314 message = 'operation %p overlaps with previous operation %p' % [ current, previous ]
|
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | org.eclipse.text_3.5.0.v20100601-1300.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |