/external/deqp/framework/delibs/decpp/ |
deSTLUtil.hpp | 56 C intersection (const C& s1, const C& s2) function in namespace:de
|
/external/antlr/tool/src/main/java/org/antlr/analysis/ |
LookaheadSet.java | 76 public LookaheadSet intersection(LookaheadSet s) { method in class:LookaheadSet 78 LookaheadSet intersection = new LookaheadSet(i); local 79 return intersection;
|
/external/tensorflow/tensorflow/core/util/ |
tensor_slice_set.cc | 42 // We check if there is any intersection between this slice and any of the 76 // We figure this out by computing the intersection of each of the existing 79 // existing slices don't have any intersection among themselves. 90 TensorSlice intersection; local 93 if (slice.Intersect(x.second.slice, &intersection)) { 94 s = intersection.SliceTensorShape(shape_, &inter_shape); 133 // We figure this out by computing the intersection of each of the existing 136 // existing slices don't have any intersection among themselves. 147 TensorSlice intersection; local 150 if (slice.Intersect(x.second.slice, &intersection)) { [all...] |
/external/antlr/tool/src/main/java/org/antlr/misc/ |
Interval.java | 116 public Interval intersection(Interval other) { method in class:Interval
|
IntervalSet.java | 270 // will be ignored since we are doing this & ~other. The intersection 406 /** Return a new set with the intersection of this set with other. Because 419 IntervalSet intersection = null; local 438 // overlap, add intersection, get next theirs 439 if ( intersection==null ) { 440 intersection = new IntervalSet(); 442 intersection.add(mine.intersection(theirs)); 446 // overlap, add intersection, get next mine 447 if ( intersection==null ) [all...] |
/external/eigen/Eigen/src/Geometry/ |
ParametrizedLine.h | 102 EIGEN_DEVICE_FUNC Scalar intersection(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const; 162 /** \returns the parameter value of the intersection between \c *this and the given \a hyperplane 174 * \returns the parameter value of the intersection between \c *this and the given \a hyperplane 178 EIGEN_DEVICE_FUNC inline _Scalar ParametrizedLine<_Scalar, _AmbientDim,_Options>::intersection(const Hyperplane<_Scalar, _AmbientDim, OtherOptions>& hyperplane) const function in class:Eigen::ParametrizedLine 183 /** \returns the point of the intersection between \c *this and the given hyperplane
|
Hyperplane.h | 183 /** \returns the intersection of *this with \a other. 189 EIGEN_DEVICE_FUNC VectorType intersection(const Hyperplane& other) const function in class:Eigen::Hyperplane
|
/external/guava/guava/src/com/google/common/collect/ |
ContiguousSet.java | 59 effectiveRange = effectiveRange.intersection(Range.atLeast(domain.minValue())); 62 effectiveRange = effectiveRange.intersection(Range.atMost(domain.maxValue())); 143 * {@link Sets#intersection} for {@link ContiguousSet} instances. 145 public abstract ContiguousSet<C> intersection(ContiguousSet<C> other); method in class:ContiguousSet
|
EmptyContiguousSet.java | 49 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method in class:EmptyContiguousSet
|
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
ContiguousSet.java | 56 effectiveRange = effectiveRange.intersection(Range.atLeast(domain.minValue())); 59 effectiveRange = effectiveRange.intersection(Range.atMost(domain.maxValue())); 112 * {@link Sets#intersection} for {@link ContiguousSet} instances. 114 public abstract ContiguousSet<C> intersection(ContiguousSet<C> other); method in class:ContiguousSet
|
EmptyContiguousSet.java | 47 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method in class:EmptyContiguousSet
|
RegularContiguousSet.java | 44 ? ContiguousSet.create(range.intersection(other), domain) 118 @Override public ContiguousSet<C> intersection(ContiguousSet<C> other) { method
|
/external/skia/samplecode/ |
SampleDegenerateQuads.cpp | 65 SkPath intersection; local 66 if (!Op(shape, pixel, kIntersect_SkPathOp, &intersection) || intersection.isEmpty()) { 72 for (int i = 0; i < intersection.countPoints(); ++i) { 73 SkPoint p0 = intersection.getPoint(i); 74 SkPoint p1 = intersection.getPoint((i + 1) % intersection.countPoints());
|
/external/guava/guava-gwt/test-super/com/google/common/collect/super/com/google/common/collect/ |
ContiguousSetTest.java | 267 assertEquals(ImmutableSet.of(), set.intersection(emptySet)); 268 assertEquals(ImmutableSet.of(), emptySet.intersection(set)); 270 ContiguousSet.create(Range.closed(-5, -1), integers()).intersection( 277 ContiguousSet.create(Range.open(-1, 4), integers()).intersection(set)); 279 set.intersection(ContiguousSet.create(Range.open(-1, 4), integers())));
|
/external/mesa3d/src/intel/compiler/ |
brw_fs_combine_constants.cpp | 226 bblock_t *intersection = cfg_t::intersect(block, imm->block); local 227 if (intersection != imm->block) 229 imm->block = intersection;
|
/external/protobuf/java/util/src/main/java/com/google/protobuf/util/ |
FieldMaskUtil.java | 228 * Calculates the intersection of two FieldMasks. 230 public static FieldMask intersection(FieldMask mask1, FieldMask mask2) { method in class:FieldMaskUtil
|
/external/wpa_supplicant_8/src/p2p/ |
p2p_invitation.c | 186 struct p2p_channels all_channels, intersection, *channels = NULL; local 253 &intersection); 254 p2p_channels_dump(p2p, "intersection", &intersection); 260 &go, group_bssid, &op_freq, persistent, &intersection, 266 &intersection); 267 p2p_channels_dump(p2p, "intersection(GO)", &intersection); 268 if (intersection.reg_classes == 0) { 285 if (!p2p_channels_includes(&intersection, reg_class, channel) 436 struct p2p_channels intersection, *channels = NULL; local [all...] |
/external/guava/guava-tests/test/com/google/common/collect/ |
ContiguousSetTest.java | 305 assertEquals(ImmutableSet.of(), set.intersection(emptySet)); 306 assertEquals(ImmutableSet.of(), emptySet.intersection(set)); 308 ContiguousSet.create(Range.closed(-5, -1), integers()).intersection( 315 ContiguousSet.create(Range.open(-1, 4), integers()).intersection(set)); 317 set.intersection(ContiguousSet.create(Range.open(-1, 4), integers())));
|
/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;
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Lib/ |
_weakrefset.py | 145 def intersection(self, other):
member in class:WeakSet 147 __and__ = intersection
204 return len(self.intersection(other)) == 0
|
/device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Lib/ |
_weakrefset.py | 158 def intersection(self, other):
member in class:WeakSet 159 return self._apply(other, self.data.intersection)
160 __and__ = intersection
216 return len(self.intersection(other)) == 0
|
sets.py | 4 ignored. The usual operations (union, intersection, deletion, etc.)
169 # Standard set operations: union, intersection, both differences.
197 """Return the intersection of two sets as a new set.
203 return self.intersection(other)
205 def intersection(self, other):
member in class:BaseSet 206 """Return the intersection of two sets as a new set.
423 # In-place union, intersection, differences.
439 """Update a set with the intersection of itself and another."""
445 """Update a set with the intersection of itself and another."""
449 self._data = (self.intersection(other))._data [all...] |
/device/linaro/bootloader/edk2/BaseTools/Source/C/VfrCompile/Pccts/antlr/ |
fset.c | 395 set intersection;
local 400 intersection=set_and(localConstrain,p->tset);
401 if (! set_nil(intersection)) {
404 set_free(intersection);
570 * The warning detection is simple. Let delta = LOOK(alt1) intersection LOOK(alt2).
[all...] |
/external/antlr/tool/src/main/java/org/antlr/tool/ |
AttributeScope.java | 173 public Set<String> intersection(AttributeScope other) { method in class:AttributeScope
|