Lines Matching refs:m_max
69 EIGEN_DEVICE_FUNC inline explicit AlignedBox(Index _dim) : m_min(_dim), m_max(_dim) in AlignedBox()
75 …lignedBox(const OtherVectorType1& _min, const OtherVectorType2& _max) : m_min(_min), m_max(_max) {} in AlignedBox()
79 …EIGEN_DEVICE_FUNC inline explicit AlignedBox(const MatrixBase<Derived>& p) : m_min(p), m_max(m_min) in AlignedBox()
95 EIGEN_DEVICE_FUNC inline bool isEmpty() const { return (m_min.array() > m_max.array()).any(); } in isEmpty()
102 m_max.setConstant( ScalarTraits::lowest() ); in setEmpty()
110 EIGEN_DEVICE_FUNC inline const VectorType& (max)() const { return m_max; }
112 EIGEN_DEVICE_FUNC inline VectorType& (max)() { return m_max; }
117 { return (m_min+m_max)/RealScalar(2); } in EIGEN_EXPR_BINARYOP_SCALAR_RETURN_TYPE()
124 { return m_max - m_min; } in sizes()
155 if( mult & corner ) res[d] = m_max[d]; in corner()
171 r[d] = m_min[d] + (m_max[d]-m_min[d]) in sample()
175 r[d] = internal::random(m_min[d], m_max[d]); in sample()
185 return (m_min.array()<=p_n.array()).all() && (p_n.array()<=m_max.array()).all(); in contains()
190 { return (m_min.array()<=(b.min)().array()).all() && ((b.max)().array()<=m_max.array()).all(); } in contains()
195 { return (m_min.array()<=(b.max)().array()).all() && ((b.min)().array()<=m_max.array()).all(); } in intersects()
204 m_max = m_max.cwiseMax(p_n); in extend()
213 m_max = m_max.cwiseMax(b.m_max); in extend()
223 m_max = m_max.cwiseMin(b.m_max); in clamp()
231 {return AlignedBox(m_min.cwiseMax(b.m_min), m_max.cwiseMin(b.m_max)); } in intersection()
237 { return AlignedBox(m_min.cwiseMin(b.m_min), m_max.cwiseMax(b.m_max)); } in merged()
245 m_max += t; in translate()
295 m_max = (other.max)().template cast<Scalar>(); in AlignedBox()
303 { return m_min.isApprox(other.m_min, prec) && m_max.isApprox(other.m_max, prec); }
307 VectorType m_min, m_max;
326 else if( p[k] > m_max[k] ) in squaredExteriorDistance()
328 aux = p[k] - m_max[k]; in squaredExteriorDistance()
342 if( m_min[k] > b.m_max[k] ) in squaredExteriorDistance()
344 aux = m_min[k] - b.m_max[k]; in squaredExteriorDistance()
347 else if( b.m_min[k] > m_max[k] ) in squaredExteriorDistance()
349 aux = b.m_min[k] - m_max[k]; in squaredExteriorDistance()