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

1 2

  /external/libmojo/ui/gfx/range/
range.cc 16 Range Range::Intersect(const Range& range) const {
range_f.cc 17 RangeF RangeF::Intersect(const RangeF& range) const {
27 RangeF RangeF::Intersect(const Range& range) const {
29 return Intersect(range_f);
  /external/pdfium/core/fpdfdoc/
cpvt_wordrange.h 45 CPVT_WordRange Intersect(const CPVT_WordRange& that) const {
  /external/tensorflow/tensorflow/core/framework/
tensor_slice.cc 142 bool TensorSlice::Intersect(const TensorSlice& other,
  /prebuilts/go/darwin-x86/src/image/
geom.go 149 // Intersect returns the largest rectangle contained by both r and s. If the
151 func (r Rectangle) Intersect(s Rectangle) Rectangle {
  /prebuilts/go/linux-x86/src/image/
geom.go 149 // Intersect returns the largest rectangle contained by both r and s. If the
151 func (r Rectangle) Intersect(s Rectangle) Rectangle {
  /external/v8/src/base/
atomic-utils.h 232 void Intersect(const AtomicEnumSet& set) {
  /external/webrtc/talk/media/base/
codec.cc 67 void FeedbackParams::Intersect(const FeedbackParams& from) {
163 feedback_params.Intersect(other.feedback_params);
  /art/libartbase/base/
bit_vector.cc 118 void BitVector::Intersect(const BitVector* src) {
  /external/libmojo/ui/gfx/geometry/
rect.cc 177 void Rect::Intersect(const Rect& rect) {
323 result.Intersect(b);
rect_f.cc 100 void RectF::Intersect(const RectF& rect) {
235 result.Intersect(b);
  /external/mesa3d/src/gallium/drivers/swr/rasterizer/core/
api.h 65 SWR_RECT& Intersect(const SWR_RECT& other)
83 return Intersect(other);
  /external/protobuf/src/google/protobuf/util/
field_mask_util.cc 454 void FieldMaskUtil::Intersect(const FieldMask& mask1, const FieldMask& mask2,
  /external/v8/src/
bit-vector.h 131 void Intersect(const BitVector& other) {
  /external/v8/src/compiler/
machine-graph-verifier.cc 732 bool Intersect(MachineRepresentation lhs, MachineRepresentation rhs) {
store-store-elimination.cc 107 UnobservablesSet Intersect(UnobservablesSet other, Zone* zone) const;
440 cur_set = cur_set.Intersect(new_set, temp_zone());
484 UnobservablesSet UnobservablesSet::Intersect(UnobservablesSet other,
  /external/v8/src/crankshaft/
unique.h 235 UniqueSet<T>* Intersect(const UniqueSet<T>* that, Zone* zone) const {
  /external/webrtc/webrtc/modules/desktop_capture/
desktop_region.cc 96 // Iterate over all rows that may intersect with |rect| and add new rows when
170 // over rows of the two regions similar to how it works in Intersect().
176 void DesktopRegion::Intersect(const DesktopRegion& region1,
194 // Skip |it1| if it doesn't intersect |it2| at all.
242 // Skip |it1| if it doesn't intersect |it2| at all.
266 Intersect(old_region, region);
292 // Skip |row_a| if it doesn't intersect with the |row_b|.
439 // At this point [start, end] is the range of spans that intersect with the
476 // Iterate over all spans in |set_a| adding parts of it that do not intersect
486 // Iterate over |set_b| spans that may intersect with |it_a|
    [all...]
  /external/clang/lib/StaticAnalyzer/Core/
RangeConstraintManager.cpp 247 RangeSet Intersect(BasicValueFactory &BV, Factory &F,
390 if (Ranges->Intersect(BV, F, Zero, Zero).isEmpty())
430 Result = Result.Intersect(BV, F, ++IntType.getZeroValue(),
444 // do not have to worry about overflow; RangeSet::Intersect can handle such a
465 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, Upper, Lower);
480 RangeSet New = GetRange(St, Sym).Intersect(getBasicVals(), F, AdjInt, AdjInt);
509 return GetRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper);
545 return GetRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper);
581 return GetRange(St, Sym).Intersect(getBasicVals(), F, Lower, Upper);
617 return RS.Intersect(getBasicVals(), F, Lower, Upper)
    [all...]
  /external/pdfium/core/fxcrt/
fx_coordinates.cpp 36 void FX_RECT::Intersect(const FX_RECT& src) {
88 void CFX_FloatRect::Intersect(const CFX_FloatRect& other_rect) {
fx_coordinates.h 199 void Intersect(const FX_RECT& src);
200 void Intersect(int l, int t, int r, int b) { Intersect(FX_RECT(l, t, r, b)); }
247 void Intersect(const CFX_FloatRect& other_rect);
540 void Intersect(const RectType& rt) {
554 rect.Intersect(*this);
559 rect.Intersect(*this);
  /external/protobuf/python/google/protobuf/internal/
well_known_types.py 424 def Intersect(self, mask1, mask2):
  /external/tensorflow/tensorflow/core/kernels/
sample_distorted_bounding_box_op.cc 50 Rectangle Intersect(const Rectangle& r) const {
89 const float object_covered = crop.Intersect(bbox).Area() / object_area;
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/gdiplus/
gdiplustypes.h 233 static BOOL Intersect(Rect& c, const Rect& a, const Rect& b) {
246 BOOL Intersect(const Rect& rect) {
247 return Intersect(*this, *this, rect);
358 static BOOL Intersect(RectF& c, const RectF& a, const RectF& b) {
371 BOOL Intersect(const RectF& rect) {
372 return Intersect(*this, *this, rect);
  /external/v8/src/ast/
ast-types.cc 29 AstRangeType::Limits AstRangeType::Limits::Intersect(Limits lhs, Limits rhs) {
49 return !AstRangeType::Limits::Intersect(AstRangeType::Limits(lhs),
733 AstType* AstType::Intersect(AstType* type1, AstType* type2, Zone* zone) {
835 return AstRangeType::Limits::Intersect(range_lims, bitset_lims);
878 AstRangeType::Limits::Intersect(AstRangeType::Limits(lhs->AsRange()),
    [all...]

Completed in 877 milliseconds

1 2