| /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/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/chromium_org/third_party/skia/src/pathops/ |
| SkIntersections.h | 55 return intersect(cubic);
63 return intersect(aCubic, bCubic);
84 return intersect(cubic, line);
92 return intersect(cubic, quad);
129 return intersect(aLine, bLine);
154 return intersect(quad, line);
162 return intersect(aQuad, bQuad);
211 int intersect(const SkDLine&, const SkDLine&);
212 int intersect(const SkDQuad&, const SkDLine&);
213 int intersect(const SkDQuad&, const SkDQuad&)
[all...] |
| SkDCubicIntersection.cpp | 62 i.intersect(simple1, simple2);
64 i.intersect((const SkDLine&) simple1, (const SkDLine&) simple2);
66 i.intersect(simple1, (const SkDLine&) simple2);
69 i.intersect(simple2, (const SkDLine&) simple1);
76 static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDCubic& cubic2, function
162 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
204 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
230 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
236 // intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
252 // intersect the end of the cubic with the other. Try lines from the end to control and opposit
[all...] |
| /external/skia/src/pathops/ |
| SkIntersections.h | 55 return intersect(cubic);
63 return intersect(aCubic, bCubic);
84 return intersect(cubic, line);
92 return intersect(cubic, quad);
129 return intersect(aLine, bLine);
154 return intersect(quad, line);
162 return intersect(aQuad, bQuad);
211 int intersect(const SkDLine&, const SkDLine&);
212 int intersect(const SkDQuad&, const SkDLine&);
213 int intersect(const SkDQuad&, const SkDQuad&)
[all...] |
| SkDCubicIntersection.cpp | 62 i.intersect(simple1, simple2);
64 i.intersect((const SkDLine&) simple1, (const SkDLine&) simple2);
66 i.intersect(simple1, (const SkDLine&) simple2);
69 i.intersect(simple2, (const SkDLine&) simple1);
76 static void intersect(const SkDCubic& cubic1, double t1s, double t1e, const SkDCubic& cubic2, function
162 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
204 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
230 intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
236 // intersect(cubic1, c1Min, c1Max, cubic2, c2Min, c2Max, offset, i);
252 // intersect the end of the cubic with the other. Try lines from the end to control and opposit
[all...] |
| /external/chromium_org/ui/base/range/ |
| range_unittest.cc | 158 EXPECT_EQ(ui::Range(10, 12), r1.Intersect(r1));
162 EXPECT_TRUE(r1.Intersect(r2).is_empty());
165 EXPECT_TRUE(r2.Intersect(r1).is_empty());
171 EXPECT_EQ(ui::Range(10, 12), r1.Intersect(r3));
172 EXPECT_EQ(ui::Range(10, 12), r3.Intersect(r1));
178 EXPECT_EQ(ui::Range(5, 8), r2.Intersect(r3));
179 EXPECT_EQ(ui::Range(5, 8), r3.Intersect(r2));
184 SCOPED_TRACE("contain and intersect");
191 SCOPED_TRACE("contain and intersect: reversed");
200 ui::Range invalid = r1.Intersect(r2)
[all...] |
| /cts/tests/tests/graphics/src/android/graphics/cts/ |
| Region_OpTest.java | 27 assertEquals(Op.INTERSECT, Op.valueOf("INTERSECT"));
41 Op.INTERSECT,
|
| DiscretePathEffectTest.java | 74 int intersect = 0; local
87 intersect += 1;
100 assertTrue(intersect < lineLength);
102 assertTrue(intersect >= lineLength / SEGMENT_LENGTH);
|
| RegionTest.java | 43 // INTERSECT
344 assertFalse(mRegion.op(rect1, Region.Op.INTERSECT));
384 // INTERSECT, Region with rectangle
385 // intersect the two regions
388 // intersect null rectangle
390 assertFalse(mRegion.op(rect1, Region.Op.INTERSECT));
392 // 1. intersect rectangle inside this region
395 assertTrue(mRegion.op(rect3, Region.Op.INTERSECT));
399 // 2. intersect rectangle overlap this region
402 assertTrue(mRegion.op(rect4, Region.Op.INTERSECT));
[all...] |
| /external/chromium_org/cc/resources/ |
| layer_quad.cc | 46 return gfx::QuadF(left_.Intersect(top_),
47 top_.Intersect(right_),
48 right_.Intersect(bottom_),
49 bottom_.Intersect(left_));
|
| /packages/apps/Gallery2/src/com/android/gallery3d/filtershow/filters/ |
| RedEyeCandidate.java | 43 public boolean intersect(RectF rect) { method in class:RedEyeCandidate
44 return mRect.intersect(rect);
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/jce/provider/ |
| PKIXNameConstraintValidator.java | 135 Set intersect = new HashSet(); local
144 intersect.add(dn);
156 intersect.add(dn);
160 intersect.add(subtree);
165 return intersect;
182 Set intersect = new HashSet(); local
191 intersect.add(subtree);
195 intersect.add(dn);
199 intersect.add(subtree);
200 intersect.add(dn)
210 Set intersect = new HashSet(); local
276 Set intersect = new HashSet(); local
1032 Set intersect = new HashSet(); local
1231 Set intersect = new HashSet(); local
[all...] |
| ReasonsMask.java | 71 * @param mask The mask to intersect with.
74 ReasonsMask intersect(ReasonsMask mask) method in class:ReasonsMask
|
| /external/chromium_org/third_party/sqlite/src/test/ |
| collate5.test | 13 # focus of this file is testing DISTINCT, UNION, INTERSECT and EXCEPT
103 # Tests named collate5-2.* focus on UNION, EXCEPT and INTERSECT
107 # collate5-2.2.* - INTERSECT
166 SELECT a FROM collate5t1 INTERSECT select a FROM collate5t2;
171 SELECT a FROM collate5t2 INTERSECT select a FROM collate5t1 WHERE a != 'a';
176 SELECT a, b FROM collate5t1 INTERSECT select a, b FROM collate5t2;
181 SELECT a, b FROM collate5t2 INTERSECT select a, b FROM collate5t1;
249 SELECT a FROM collate5t_cn INTERSECT SELECT a FROM collate5t_ct ORDER BY 1;
254 SELECT a FROM collate5t_ct INTERSECT SELECT a FROM collate5t_cn ORDER BY 1;
|
| selectA.test | 16 # INTERSECT work together with an ORDER BY clause (with or w/o
325 SELECT a,b,c FROM t1 INTERSECT SELECT a,b,c FROM t1 WHERE b>='d'
331 SELECT a,b,c FROM t1 WHERE b>='d' INTERSECT SELECT a,b,c FROM t1
343 SELECT a,b,c FROM t1 INTERSECT SELECT a,b,c FROM t1 WHERE b<'d'
349 SELECT a,b,c FROM t1 WHERE b<'d' INTERSECT SELECT a,b,c FROM t1
361 SELECT a,b,c FROM t1 INTERSECT SELECT a,b,c FROM t1 WHERE b>='d'
367 SELECT a,b,c FROM t1 WHERE b>='d' INTERSECT SELECT a,b,c FROM t1
379 SELECT a,b,c FROM t1 INTERSECT SELECT a,b,c FROM t1 WHERE b<'d'
385 SELECT a,b,c FROM t1 WHERE b<'d' INTERSECT SELECT a,b,c FROM t1
397 SELECT a,b,c FROM t1 INTERSECT SELECT a,b,c FROM t1 WHERE b>='d
[all...] |
| select4.test | 12 # focus of this file is testing UNION, INTERSECT and EXCEPT operators
200 # Intersect operator
205 INTERSECT
216 INTERSECT
226 INTERSECT
237 INTERSECT
248 (SELECT DISTINCT log FROM t1 INTERSECT
257 INTERSECT
262 } {1 {ORDER BY clause should come after INTERSECT not before}}
264 # Various error messages while processing UNION or INTERSECT
[all...] |
| /external/guava/guava-tests/test/com/google/common/collect/ |
| GeneralRangeTest.java | 137 range.intersect(GeneralRange.range(ORDERING, 2, OPEN, 4, CLOSED)));
144 range.intersect(GeneralRange.range(ORDERING, null, OPEN, 5, CLOSED)));
147 range.intersect(GeneralRange.range(ORDERING, 2, OPEN, 5, CLOSED)));
150 range.intersect(GeneralRange.range(ORDERING, 1, OPEN, 4, OPEN)));
156 range.intersect(GeneralRange.range(ORDERING, 3, CLOSED, 4, CLOSED)));
162 range.intersect(GeneralRange.range(ORDERING, 3, CLOSED, 5, CLOSED)));
164 range.intersect(GeneralRange.range(ORDERING, 1, OPEN, 3, OPEN)));
169 assertTrue(range.intersect(GeneralRange.range(ORDERING, 5, CLOSED, 6, CLOSED)).isEmpty());
170 assertTrue(range.intersect(GeneralRange.range(ORDERING, 1, OPEN, 2, OPEN)).isEmpty());
|
| /external/chromium_org/cc/base/ |
| region.h | 49 void Intersect(gfx::Rect rect);
50 void Intersect(const Region& region);
111 result.Intersect(b);
117 result.Intersect(b);
|
| tiling_data.h | 89 // Iterate through all indices whose bounds + border intersect with |rect|.
101 // Iterate through all indices whose bounds + border intersect with
102 // |consider| but which also do not intersect with |ignore|.
|
| /external/chromium_org/third_party/skia/include/utils/ |
| SkPictureUtils.h | 20 * of SkPixelRefs that might intersect that area. To keep the call fast,
|
| /external/skia/include/utils/ |
| SkPictureUtils.h | 20 * of SkPixelRefs that might intersect that area. To keep the call fast,
|
| /external/robolectric/src/main/java/com/xtremelabs/robolectric/shadows/ |
| ShadowRect.java | 99 public boolean intersect(Rect r) { method in class:ShadowRect
104 public boolean intersect(int left, int top, int right, int bottom) { method in class:ShadowRect
105 return intersect(new Rect(left, top, right, bottom));
|
| /external/chromium_org/native_client_sdk/src/examples/demo/flock/ |
| sprite.cc | 51 pp::Rect src_rect_clipped(src_rect.Intersect(src_bounds));
58 pp::Rect draw_rect_clipped(dest_bounds.Intersect(draw_rect));
|
