HomeSort by relevance Sort by last modified time
    Searched refs:intersection (Results 26 - 50 of 196) sorted by null

12 3 4 5 6 7 8

  /external/chromium-trace/trace-viewer/build/
check_gyp.py 31 i = set(gyp_files).intersection(set(known_files))
  /external/chromium_org/third_party/WebKit/Tools/Scripts/
webkit-patch 74 if set(["-v", "--verbose"]).intersection(set(sys.argv)):
  /external/chromium_org/ui/compositor/
layer_animation_sequence.cc 188 LayerAnimationElement::AnimatableProperties intersection; local
190 intersection, intersection.begin());
194 return (intersection.size() > 0);
  /external/guava/guava/src/com/google/common/collect/
RegularContiguousSet.java 46 return range.intersection(Ranges.upTo(toElement, BoundType.forBoolean(inclusive)))
58 return range.intersection(Ranges.range(fromElement, BoundType.forBoolean(fromInclusive),
64 return range.intersection(Ranges.downTo(fromElement, BoundType.forBoolean(inclusive)))
130 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method
EmptyContiguousSet.java 49 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method in class:EmptyContiguousSet
Range.java 94 * the definition of {@link #intersection}.
290 * <p>For example, the intersection of {@code [1..5]} and {@code (3..7)} is
295 * <p>Generally, the intersection exists if and only if this range and
298 * <p>The intersection operation has the following properties:
301 * <li>commutative: {@code a.intersection(b)} produces the same result as
302 * {@code b.intersection(a)}
303 * <li>associative: {@code a.intersection(b).intersection(c)} produces the
304 * same result as {@code a.intersection(b.intersection(c))
313 public Range<C> intersection(Range<C> other) { method in class:Range
    [all...]
  /external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
EmptyContiguousSet.java 47 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method in class:EmptyContiguousSet
  /external/libvpx/libvpx/tools/
intersect-diffs.py 10 """Calculates the "intersection" of two unified diffs.
  /libcore/libart/src/main/java/java/lang/reflect/
Proxy.java 318 * computes the exceptions of each method; this is the intersection of the
345 * exception from the other, the subtype is included in the intersection.
354 Set<Class<?>> intersection = new HashSet<Class<?>>(); local
358 intersection.add(b);
360 intersection.add(a);
364 return intersection.toArray(new Class<?>[intersection.size()]);
  /external/chromium_org/third_party/freetype/src/cff/
cf2hints.c 1205 FT_Vector intersection = { 0, 0 }; local
    [all...]
  /external/freetype/src/cff/
cf2hints.c 1205 FT_Vector intersection = { 0, 0 }; local
    [all...]
  /external/chromium_org/chrome/browser/sync/
backend_migrator.cc 157 const ModelTypeSet intersection = local
158 Intersection(result.requested_types, to_migrate_);
159 // This intersection check is to determine if our disable request
161 if (state_ == DISABLING_TYPES && !intersection.Empty()) {
  /dalvik/dexgen/src/com/android/dexgen/rop/code/
RegisterSpecSet.java 311 * instance. The intersection consists of the pairwise
317 * the intersection; if {@code true}, then the only non-null
337 RegisterSpec intersection = local
339 if (intersection != spec) {
340 specs[i] = intersection;
  /dalvik/dx/src/com/android/dx/rop/code/
RegisterSpecSet.java 310 * instance. The intersection consists of the pairwise
316 * the intersection; if {@code true}, then the only non-null
336 RegisterSpec intersection = local
338 if (intersection != spec) {
339 specs[i] = intersection;
  /external/chromium_org/third_party/WebKit/Source/platform/scroll/
ScrollbarThemeMacCommon.mm 149 context->fillRect(intersection(horizontalOverhangRect, dirtyRect));
151 context->fillRect(intersection(verticalOverhangRect, dirtyRect));
218 context->fillRect(intersection(shadowRect, dirtyRect));
228 context->fillRect(intersection(shadowRect, dirtyRect));
246 context->fillRect(intersection(shadowRect, dirtyRect));
256 context->fillRect(intersection(shadowRect, dirtyRect));
  /external/dexmaker/src/dx/java/com/android/dx/rop/code/
RegisterSpecSet.java 310 * instance. The intersection consists of the pairwise
316 * the intersection; if {@code true}, then the only non-null
336 RegisterSpec intersection = local
338 if (intersection != spec) {
339 specs[i] = intersection;
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/
_weakrefset.py 143 def intersection(self, other): member in class:WeakSet
145 __and__ = intersection
196 return len(self.intersection(other)) == 0
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/
_weakrefset.py 143 def intersection(self, other): member in class:WeakSet
145 __and__ = intersection
196 return len(self.intersection(other)) == 0
  /external/guava/guava-tests/test/com/google/common/collect/
ContiguousSetTest.java 267 assertEquals(ImmutableSet.of(), set.intersection(emptySet));
268 assertEquals(ImmutableSet.of(), emptySet.intersection(set));
269 assertEquals(ImmutableSet.of(), Ranges.closed(-5, -1).asSet(integers()).intersection(
275 assertEquals(ImmutableSet.of(1, 2, 3), Ranges.open(-1, 4).asSet(integers()).intersection(set));
276 assertEquals(ImmutableSet.of(1, 2, 3), set.intersection(Ranges.open(-1, 4).asSet(integers())));
  /external/chromium_org/remoting/base/
util.cc 312 webrtc::DesktopRect intersection(a);
313 intersection.IntersectWith(b);
314 return intersection.equals(b);
  /external/chromium_org/remoting/codec/
video_decoder_vpx.cc 197 webrtc::DesktopRegion intersection(source_rect);
198 intersection.IntersectWith(updated_region_);
199 if (intersection.is_empty())
  /external/chromium_org/ui/views/widget/desktop_aura/
desktop_screen_x11.cc 359 gfx::Rect intersection = crtc_bounds; local
360 intersection.Intersect(work_area);
361 display.set_work_area(intersection);
  /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
Interval.java 115 public Interval intersection(Interval other) { method in class:Interval
  /external/ceres-solver/internal/ceres/
visibility_based_preconditioner.cc 526 vector<int> intersection; local
530 back_inserter(intersection));
532 if (intersection.size() > 0) {
538 cluster_graph->AddEdge(i, j, intersection.size());
  /external/chromium_org/build/android/gyp/
write_ordered_libraries.py 82 if not dependencies.intersection(unsorted_deps.keys()):

Completed in 1282 milliseconds

12 3 4 5 6 7 8