| /external/openfst/src/script/ |
| intersect.cc | 19 #include <fst/script/intersect.h>
24 void Intersect(const FstClass &ifst1, const FstClass &ifst2,
26 if (!ArcTypesMatch(ifst1, ifst2, "Intersect") ||
27 !ArcTypesMatch(*ofst, ifst1, "Intersect")) return;
30 Apply<Operation<IntersectArgs1> >("Intersect", ifst1.ArcType(), &args);
33 void Intersect(const FstClass &ifst1, const FstClass &ifst2,
35 if (!ArcTypesMatch(ifst1, ifst2, "Intersect") ||
36 !ArcTypesMatch(*ofst, ifst1, "Intersect")) return;
39 Apply<Operation<IntersectArgs2> >("Intersect", ifst1.ArcType(), &args);
42 REGISTER_FST_OPERATION(Intersect, StdArc, IntersectArgs1)
[all...] |
| /external/openfst/src/include/fst/script/ |
| intersect.h | 22 #include <fst/intersect.h>
32 void Intersect(IntersectArgs1 *args) {
37 Intersect(ifst1, ifst2, ofst, args->arg4);
44 void Intersect(IntersectArgs2 *args) {
49 Intersect(ifst1, ifst2, ofst, args->arg4);
52 void Intersect(const FstClass &ifst1, const FstClass &ifst2,
56 void Intersect(const FstClass &ifst, const FstClass &ifst2,
|
| /external/chromium_org/ui/base/range/ |
| range.cc | 69 Range Range::Intersect(const Range& range) const {
|
| /art/compiler/dex/ |
| arena_bit_vector.cc | 96 // Intersect with another bit vector. Sizes and expandability must be the same.
97 void ArenaBitVector::Intersect(const ArenaBitVector* src) {
|
| /external/chromium_org/cc/resources/ |
| tile_priority.cc | 25 inline Range Intersect(const Range& a, const Range& b) {
128 // overlap between these time ranges, the bounds must have intersect with
|
| layer_quad.h | 60 gfx::PointF Intersect(const Edge& e) const {
|
| /external/chromium_org/ppapi/cpp/ |
| rect.cc | 52 Rect Rect::Intersect(const Rect& rect) const {
|
| /external/chromium_org/third_party/libjingle/source/talk/media/base/ |
| codec.cc | 66 void FeedbackParams::Intersect(const FeedbackParams& from) {
129 feedback_params.Intersect(other.feedback_params);
|
| /external/openfst/src/include/fst/ |
| intersect.h | 0 // intersect.h
143 void Intersect(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,
|
| interval-set.h | 135 void Intersect(const IntervalSet<T> &iset, IntervalSet<T> *oset) const;
200 void IntervalSet<T>::Intersect(const IntervalSet<T> &iset,
267 Intersect(cset, oset);
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| intersect.h | 0 // intersect.h
118 void Intersect(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2,
|
| /external/chromium_org/cc/base/ |
| region.cc | 90 void Region::Intersect(gfx::Rect rect) {
94 void Region::Intersect(const Region& region) {
|
| /external/chromium_org/ui/gfx/ |
| rect_base_impl.h | 164 Intersect(const Class& rect) {
|
| /external/chromium_org/v8/src/ |
| types.cc | 422 Type* Type::Intersect(Handle<Type> type1, Handle<Type> type2) {
|
| data-flow.h | 156 void Intersect(const BitVector& other) {
|
| lithium-allocator.h | 223 LifetimePosition Intersect(const UseInterval* other) const {
224 if (other->start().Value() < start_.Value()) return other->Intersect(this);
|
| /external/v8/src/ |
| data-flow.h | 156 void Intersect(const BitVector& other) {
|
| lithium-allocator.h | 223 LifetimePosition Intersect(const UseInterval* other) const {
224 if (other->start().Value() < start_.Value()) return other->Intersect(this);
|
| hydrogen-instructions.cc | 143 void Range::Intersect(Range* other) {
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| test-types.cc | 184 Handle<Type> Intersect(Handle<Type> type1, Handle<Type> type2) {
185 return handle(Type::Intersect(type1, type2), isolate_);
570 TEST(Intersect) {
577 CHECK(IsBitset(Type::Intersect(T.Object, T.Number)));
578 CHECK(IsBitset(Type::Intersect(T.Object, T.Object)));
579 CHECK(IsBitset(Type::Intersect(T.Any, T.None)));
581 CheckEqual(T.Intersect(T.None, T.Number), T.None);
582 CheckEqual(T.Intersect(T.Object, T.Proxy), T.None);
583 CheckEqual(T.Intersect(T.Name, T.String), T.Intersect(T.String, T.Name))
[all...] |
| /external/clang/lib/StaticAnalyzer/Core/ |
| RangeConstraintManager.cpp | 238 RangeSet Intersect(BasicValueFactory &BV, Factory &F,
357 if (Ranges->Intersect(BV, F, Zero, Zero).isEmpty())
397 Result = Result.Intersect(BV, F, ++IntType.getZeroValue(),
411 // do not have to worry about overflow; RangeSet::Intersect can handle such a
432 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Upper, Lower);
447 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, AdjInt, AdjInt);
476 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper);
505 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper);
534 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper);
563 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper)
[all...] |
| /art/compiler/sea_ir/ir/ |
| sea.cc | 105 // then NewIdom = Intersect(p, NewIdom)
112 new_dom = SeaGraph::Intersect(*pred_it, new_dom);
134 Region* SeaGraph::Intersect(Region* i, Region* j) {
|
| /external/chromium_org/third_party/re2/lib/codereview/ |
| codereview.py | 93 def Intersect(l1, l2):
[all...] |
| /external/regex-re2/lib/codereview/ |
| codereview.py | 93 def Intersect(l1, l2):
[all...] |
| /external/v8/tools/ |
| test.py | 812 def Intersect(self, that):
814 return that.Intersect(self)
828 def Intersect(self, that):
840 def Intersect(self, that):
863 inter = self.left.GetOutcomes(env, defs).Intersect(self.right.GetOutcomes(env, defs))
866 inter = self.left.GetOutcomes(env, defs).Intersect(self.right.GetOutcomes(env, defs))
880 return self.left.GetOutcomes(env, defs).Intersect(self.right.GetOutcomes(env, defs))
[all...] |
