Searched defs:Intersection (Results 1 - 7 of 7) sorted by relevance
| /external/jmonkeyengine/engine/src/core/com/jme3/bounding/ |
| H A D | Intersection.java | 46 public class Intersection { class
|
| /external/chromium_org/sync/internal_api/public/base/ |
| H A D | enum_set.h | 26 EnumSet<E, Min, Max> Intersection(EnumSet<E, Min, Max> set1,
155 // self-mutating versions of Union, Intersection, and Difference
227 friend EnumSet Intersection<E, MinEnumValue, MaxEnumValue>(
272 EnumSet<E, Min, Max> Intersection(EnumSet<E, Min, Max> set1, function
|
| /external/llvm/unittests/Support/ |
| H A D | IntegersSubsetTest.cpp | 209 Mapping LExclude, Intersection; local
211 LHSMapping.diff(&LExclude, &Intersection, 0, RHSMapping);
224 EXPECT_EQ(Intersection.size(), IntersectResSize);
227 for (Mapping::RangeIterator ii = Intersection.begin(),
228 e = Intersection.end(); ii != e; ++ii, ++i)
231 EXPECT_TRUE(Intersection.empty());
234 Intersection.clear();
235 RHSMapping.diff(0, &Intersection, &LExclude, LHSMapping);
|
| /external/chromium_org/chrome/common/extensions/permissions/ |
| H A D | api_permission_set.cc | 227 void APIPermissionSet::Intersection( function in class:extensions::APIPermissionSet
|
| /external/llvm/include/llvm/Support/ |
| H A D | IntegersSubsetMapping.h | 131 MappingTy *Intersection,
135 IntersectionMapping(Intersection),
428 /// THIS intersect RHS is placed into Intersection.
429 void diff(self *LExclude, self *Intersection, self *RExclude, argument
432 DiffStateMachine Machine(LExclude, Intersection, RExclude);
130 DiffStateMachine(MappingTy *L, MappingTy *Intersection, MappingTy *R) argument
|
| /external/llvm/utils/TableGen/ |
| H A D | CodeGenRegisters.cpp | 1595 std::set<unsigned> Intersection; local
1600 std::inserter(Intersection, Intersection.begin()));
1601 if (Intersection.empty())
1761 CodeGenRegister::Set Intersection; local
1764 std::inserter(Intersection, Intersection.begin()),
1768 if (Intersection.empty())
1778 getOrCreateSubClass(RC1, &Intersection,
|
| /external/llvm/lib/Analysis/ |
| H A D | DependenceAnalysis.cpp | 3382 SmallBitVector Intersection = Pair[SI].GroupLoops; local
3383 Intersection &= Pair[SJ].GroupLoops;
3384 if (Intersection.any()) {
3735 SmallBitVector Intersection = Pair[SI].GroupLoops; local
3736 Intersection &= Pair[SJ].GroupLoops;
3737 if (Intersection.any()) {
|
Completed in 161 milliseconds