Home
last modified time | relevance | path

Searched refs:intersection (Results 1 – 25 of 291) sorted by relevance

12345678910>>...12

/external/fonttools/Lib/fontTools/misc/
DclassifyTools.py33 intersection = s.intersection(things) # existing things
34 s.difference_update(intersection) # new things
46 while intersection:
48 old_class = mapping[next(iter(intersection))]
49 old_class_intersection = old_class.intersection(intersection)
55 intersection.difference_update(old_class_intersection)
/external/guava/guava-tests/test/com/google/common/collect/
DRangeTest.java346 assertEquals(range, range.intersection(range)); in testIntersection_empty()
349 range.intersection(Range.open(3, 5)); in testIntersection_empty()
354 range.intersection(Range.closed(0, 2)); in testIntersection_empty()
362 assertEquals(range, range.intersection(range)); in testIntersection_deFactoEmpty()
365 range.intersection(Range.atMost(3))); in testIntersection_deFactoEmpty()
367 range.intersection(Range.atLeast(4))); in testIntersection_deFactoEmpty()
370 range.intersection(Range.lessThan(3)); in testIntersection_deFactoEmpty()
375 range.intersection(Range.greaterThan(4)); in testIntersection_deFactoEmpty()
382 range.intersection(Range.greaterThan(4))); in testIntersection_deFactoEmpty()
387 assertEquals(range, range.intersection(range)); in testIntersection_singleton()
[all …]
DImmutableRangeMapTest.java87 range1.isConnected(range2) && !range1.intersection(range2).isEmpty(); in testOverlapRejection()
103 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) { in testGet()
141 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) { in testSpanTwoRanges()
153 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) { in testGetEntry()
186 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) { in testAsMapOfRanges()
206 if (!range1.isConnected(range2) || range1.intersection(range2).isEmpty()) { in testSubRangeMap()
216 && !entry.getKey().intersection(subRange).isEmpty()) { in testSubRangeMap()
217 expectedBuilder.put(entry.getKey().intersection(subRange), entry.getValue()); in testSubRangeMap()
DSetOperationsTest.java134 return Sets.intersection( in suite()
145 return Sets.intersection( in suite()
156 return Sets.intersection( in suite()
167 return Sets.intersection( in suite()
178 return Sets.intersection( in suite()
286 Set<String> frenemies = Sets.intersection(friends, enemies); in testIntersection()
290 = Sets.intersection(friends, enemies).immutableCopy(); in testIntersection()
292 = Sets.intersection(friends, enemies).copyInto(new HashSet<String>()); in testIntersection()
/external/fonttools/Lib/fontTools/varLib/
DfeatureVars.py128 intersection, remainder = overlayBox(currBox, box)
129 if intersection is not None:
130 intersection = hashdict(intersection)
131 newMap[intersection] = newMap.get(intersection, 0) | rank|currRank
173 intersection = {}
174 intersection.update(top)
175 intersection.update(bot)
183 intersection[axisTag] = minimum,maximum
200 if axisTag not in intersection:
203 min1, max1 = intersection[axisTag]
[all …]
/external/antlr/tool/src/main/java/org/antlr/misc/
DIntervalSet.java419 IntervalSet intersection = null; in and() local
439 if ( intersection==null ) { in and()
440 intersection = new IntervalSet(); in and()
442 intersection.add(mine.intersection(theirs)); in and()
447 if ( intersection==null ) { in and()
448 intersection = new IntervalSet(); in and()
450 intersection.add(mine.intersection(theirs)); in and()
455 if ( intersection==null ) { in and()
456 intersection = new IntervalSet(); in and()
458 intersection.add(mine.intersection(theirs)); in and()
[all …]
/external/wpa_supplicant_8/src/p2p/
Dp2p_invitation.c186 struct p2p_channels all_channels, intersection, *channels = NULL; in p2p_process_invitation_req() local
253 &intersection); in p2p_process_invitation_req()
254 p2p_channels_dump(p2p, "intersection", &intersection); in p2p_process_invitation_req()
260 &go, group_bssid, &op_freq, persistent, &intersection, in p2p_process_invitation_req()
266 &intersection); in p2p_process_invitation_req()
267 p2p_channels_dump(p2p, "intersection(GO)", &intersection); in p2p_process_invitation_req()
268 if (intersection.reg_classes == 0) { in p2p_process_invitation_req()
285 if (!p2p_channels_includes(&intersection, reg_class, channel)) in p2p_process_invitation_req()
294 channels = &intersection; in p2p_process_invitation_req()
313 p2p_channels_includes(&intersection, in p2p_process_invitation_req()
[all …]
Dp2p_go_neg.c42 struct p2p_channels intersection; in p2p_peer_channels_check() local
78 p2p_channels_intersect(own, &dev->channels, &intersection); in p2p_peer_channels_check()
82 (int) intersection.reg_classes); in p2p_peer_channels_check()
83 if (intersection.reg_classes == 0) { in p2p_peer_channels_check()
384 struct p2p_channels *intersection) in p2p_reselect_channel() argument
397 p2p_channels_includes(intersection, op_reg_class, op_channel)) { in p2p_reselect_channel()
408 p2p_channels_includes(intersection, op_reg_class, op_channel)) { in p2p_reselect_channel()
419 !p2p_channels_includes(intersection, p2p->op_reg_class, in p2p_reselect_channel()
423 p2p_channels_includes(intersection, op_reg_class, op_channel)) { in p2p_reselect_channel()
432 !p2p_channels_includes(intersection, p2p->op_reg_class, in p2p_reselect_channel()
[all …]
/external/tensorflow/tensorflow/core/util/
Dtensor_slice_set.cc90 TensorSlice intersection; in Query() local
93 if (slice.Intersect(x.second.slice, &intersection)) { in Query()
94 s = intersection.SliceTensorShape(shape_, &inter_shape); in Query()
147 TensorSlice intersection; in QueryMeta() local
150 if (slice.Intersect(x.second.slice, &intersection)) { in QueryMeta()
151 s = intersection.SliceTensorShape(shape_, &inter_shape); in QueryMeta()
/external/tensorflow/tensorflow/python/kernel_tests/
Dsets_test.py185 intersection = self._set_intersection(a, sp_b)
190 intersection,
196 intersection = self._set_intersection(sp_a, sp_b)
201 intersection,
222 intersection = self._set_intersection(a, b)
227 intersection,
247 intersection = self._set_intersection(a, b)
252 intersection,
258 intersection = self._set_intersection(a, sp_b)
263 intersection,
[all …]
/external/dagger2/compiler/src/it/functional-tests/src/test/java/test/subcomponent/
DSubcomponentTest.java26 import static com.google.common.collect.Sets.intersection;
81 assertThat(intersection(parentObjectSet, childObjectSet)).hasSize(1); in multibindingContributions()
82 assertThat(intersection(parentObjectSet, grandchildObjectSet)).hasSize(1); in multibindingContributions()
83 assertThat(intersection(childObjectSet, grandchildObjectSet)).hasSize(1); in multibindingContributions()
/external/antlr/tool/src/main/java/org/antlr/analysis/
DLookaheadSet.java76 public LookaheadSet intersection(LookaheadSet s) { in intersection() method in LookaheadSet
78 LookaheadSet intersection = new LookaheadSet(i); in intersection() local
79 return intersection; in intersection()
/external/eigen/unsupported/Eigen/
DBVH32 …* of the two basic algorithms over a BVH: intersection of a query object against all objects in th…
33 …* of a function over the objects in the hierarchy. It also provides intersection and minimization…
34 …* two BVH's. A BVH accelerates intersection by using the fact that if a query object does not int…
38 * Some sample queries that can be written in terms of intersection are:
48 …* - Find the intersection between a ray and a triangle mesh closest to the ray origin (function …
72 …* For an intersection query on a single BVH, the intersector encapsulates the query and must provi…
75 …bool intersectObject(const Object &object) //returns true if the intersection search should termin…
80 …* The cartesian product intersection and the BVMinimize queries are similar--see their individual …
/external/guava/guava-testlib/src/com/google/common/collect/testing/features/
DFeatureUtil.java234 intersection(allPresentFeatures, allAbsentFeatures); in buildTesterRequirements()
279 conflictingFeatures = intersection(newFeatures, earlierFeatures); in checkConflict()
295 public static <T> Set<T> intersection( in intersection() method in FeatureUtil
297 return intersection(new Set[] {set1, set2}); in intersection()
308 public static <T> Set<T> intersection(Set<? extends T> ... sets) { in intersection() method in FeatureUtil
/external/tensorflow/tensorflow/compiler/tests/
Dsort_ops_test.py53 for dtype in supported_types.intersection(self.numeric_types):
65 for key_type in supported_key_types.intersection(self.numeric_types):
66 for value_type in supported_value_types.intersection(self.numeric_types):
80 for dtype in supported_types.intersection(self.numeric_types):
105 for dtype in supported_types.intersection(self.numeric_types):
/external/ltp/android/tools/
Dandroid_build_generator.py303 if len(set(cc_libraries[i]).intersection(disabled_libs)) > 0:
311 if len(set(cc_flags[i]).intersection(disabled_cflags)) > 0:
339 if len(set(local_libraries).intersection(disabled_libs)) > 0:
341 if len(set(local_cflags).intersection(disabled_cflags)) > 0:
365 if len(set(local_libraries).intersection(disabled_libs)) > 0:
367 if len(set(local_cflags).intersection(disabled_cflags)) > 0:
394 if len(set(local_cflags).intersection(disabled_cflags)) > 0:
/external/freetype/src/psaux/
Dpshints.c1206 FT_Vector* intersection ) in cf2_glyphpath_computeIntersection() argument
1253 intersection->x = ADD_INT32( u1->x, in cf2_glyphpath_computeIntersection()
1255 intersection->y = ADD_INT32( u1->y, in cf2_glyphpath_computeIntersection()
1269 cf2_fixedAbs( SUB_INT32( intersection->x, in cf2_glyphpath_computeIntersection()
1271 intersection->x = u1->x; in cf2_glyphpath_computeIntersection()
1273 cf2_fixedAbs( SUB_INT32( intersection->y, in cf2_glyphpath_computeIntersection()
1275 intersection->y = u1->y; in cf2_glyphpath_computeIntersection()
1278 cf2_fixedAbs( SUB_INT32( intersection->x, in cf2_glyphpath_computeIntersection()
1280 intersection->x = v1->x; in cf2_glyphpath_computeIntersection()
1282 cf2_fixedAbs( SUB_INT32( intersection->y, in cf2_glyphpath_computeIntersection()
[all …]
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
DContiguousSet.java56 effectiveRange = effectiveRange.intersection(Range.atLeast(domain.minValue())); in create()
59 effectiveRange = effectiveRange.intersection(Range.atMost(domain.maxValue())); in create()
114 public abstract ContiguousSet<C> intersection(ContiguousSet<C> other); in intersection() method in ContiguousSet
/external/deqp-deps/glslang/Test/baseResults/
Dspv.IntersectShader_Errors.rint.out2 ERROR: 0:3: 'rayPayloadInNV' : not supported in this stage: intersection
3 ERROR: 0:4: 'rayPayloadNV' : not supported in this stage: intersection
/external/python/google-api-python-client/
Dexpandsymlinks.py46 retval = retval.union(IGNORE_IN_SAMPLES.intersection(names))
47 retval = retval.union(IGNORE.intersection(names))
/external/guava/guava/src/com/google/common/collect/
DContiguousSet.java59 effectiveRange = effectiveRange.intersection(Range.atLeast(domain.minValue())); in create()
62 effectiveRange = effectiveRange.intersection(Range.atMost(domain.maxValue())); in create()
145 public abstract ContiguousSet<C> intersection(ContiguousSet<C> other); in intersection() method in ContiguousSet
DTreeRangeSet.java264 return new RangesByUpperBound<C>(rangesByLowerBound, window.intersection(upperBoundWindow)); in subMap()
426 subWindow = subWindow.intersection(complementLowerBoundWindow);
650 lowerBoundWindow.intersection(window), restriction, rangesByLowerBound);
695 return candidate.intersection(restriction);
700 return result.intersection(restriction);
739 nextRange = nextRange.intersection(restriction);
767 nextRange = nextRange.intersection(restriction);
801 return enclosing != null && !enclosing.intersection(restriction).isEmpty();
813 return (result == null) ? null : result.intersection(restriction);
826 TreeRangeSet.this.remove(rangeToRemove.intersection(restriction));
[all …]
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/
DSetOperationsTest.java62 Set<String> frenemies = Sets.intersection(friends, enemies); in testIntersection()
66 = Sets.intersection(friends, enemies).immutableCopy(); in testIntersection()
68 = Sets.intersection(friends, enemies).copyInto(new HashSet<String>()); in testIntersection()
/external/skia/samplecode/
DSampleDegenerateQuads.cpp65 SkPath intersection; in get_area_coverage() local
66 if (!Op(shape, pixel, kIntersect_SkPathOp, &intersection) || intersection.isEmpty()) { in get_area_coverage()
72 for (int i = 0; i < intersection.countPoints(); ++i) { in get_area_coverage()
73 SkPoint p0 = intersection.getPoint(i); in get_area_coverage()
74 SkPoint p1 = intersection.getPoint((i + 1) % intersection.countPoints()); in get_area_coverage()
/external/tensorflow/tensorflow/contrib/gan/python/losses/python/
Dtuple_losses_impl.py129 args_from_tuple = set(argspec.args).intersection(set(gan_model._fields))
137 ambiguous_args = set(gan_model._fields).intersection(set(kwargs.keys()))
144 required_args_from_tuple = required_args.intersection(args_from_tuple)

12345678910>>...12