HomeSort by relevance Sort by last modified time
    Searched refs:Intersect (Results 1 - 25 of 123) sorted by null

1 2 3 4 5

  /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/cc/resources/
layer_quad.cc 46 return gfx::QuadF(left_.Intersect(top_),
47 top_.Intersect(right_),
48 right_.Intersect(bottom_),
49 bottom_.Intersect(left_));
image_layer_updater.cc 45 clipped_source_rect.Intersect(image_rect);
picture_pile_impl.cc 113 content_rect.Intersect(canvas_rect);
119 deflated_content_rect.Intersect(canvas_rect);
152 content_rect.Intersect(canvas_rect);
219 raster_rect.Intersect(content_clip);
292 layer_rect.Intersect(gfx::Rect(tiling_.total_size()));
  /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);
region.cc 90 void Region::Intersect(gfx::Rect rect) {
94 void Region::Intersect(const Region& region) {
  /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...]
test-dataflow.cc 50 v.Intersect(w);
114 v.Intersect(w);
  /external/chromium_org/cc/trees/
occlusion_tracker.cc 101 transformed_rect.Intersect(clip_rect_in_new_target);
264 affected_area_in_target.Intersect(
442 clip_rect_in_target.Intersect(layer->clip_rect());
444 clip_rect_in_target.Intersect(
459 transformed_rect.Intersect(clip_rect_in_target);
492 transformed_rect.Intersect(clip_rect_in_target);
549 unoccluded_region_in_target_surface.Intersect(clip_rect_in_target);
559 unoccluded_region_in_target_surface.Intersect(
561 unoccluded_region_in_target_surface.Intersect(
619 unoccluded_region_in_target_surface.Intersect(clip_rect_in_target)
    [all...]
layer_tree_host_unittest_damage.cc 147 root_damage.Intersect(root_surface->content_rect());
209 root_damage.Intersect(root_surface->content_rect());
331 root_damage.Intersect(root_surface->content_rect());
  /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...]
range.h 90 // If they don't intersect, it returns an InvalidRange().
92 Range Intersect(const Range& range) const;
range.cc 69 Range Range::Intersect(const Range& range) const {
  /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));
  /external/v8/test/cctest/
test-dataflow.cc 51 v.Intersect(w);
115 v.Intersect(w);
  /external/chromium_org/remoting/base/
capabilities_unittest.cc 74 TEST(CapabilitiesTest, Intersect) {
  /external/chromium_org/ui/gfx/
rect_f.cc 36 result.Intersect(b);
  /external/openfst/src/bin/
fstintersect.cc 23 #include <fst/script/intersect.h>
83 s::Intersect(*ifst1, *ifst2, &ofst, opts);
  /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...]
  /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);
  /art/compiler/dex/
arena_bit_vector.h 99 void Intersect(const ArenaBitVector* src2);
  /external/chromium_org/content/browser/aura/
software_output_device_x11.cc 76 rect.Intersect(gfx::Rect(viewport_size_));
  /external/chromium_org/ui/snapshot/
snapshot_aura.cc 52 read_pixels_bounds_in_pixel.Intersect(gfx::Rect(compositor->size()));
  /external/chromium_org/v8/src/
types.h 92 // Note that the bitset representation is closed under both Union and Intersect.
155 static Type* Intersect(Handle<Type> type1, Handle<Type> type2);
315 handle(Type::Intersect(b1.upper, b2.upper), isl));
321 handle(Type::Intersect(b1.lower, b2.lower), isl),
329 return Bounds(b.lower, handle(Type::Intersect(b.upper, t), isl));

Completed in 4177 milliseconds

1 2 3 4 5