69   EIGEN_DEVICE_FUNC inline explicit AlignedBox(Index _dim) : m_min(_dim), m_max(_dim)  in AlignedBox()
75 … AlignedBox(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()
85 …EIGEN_DEVICE_FUNC inline Index dim() const { return AmbientDimAtCompileTime==Dynamic ? m_min.size(…  in dim()
95   EIGEN_DEVICE_FUNC inline bool isEmpty() const { return (m_min.array() > m_max.array()).any(); }  in isEmpty()
101     m_min.setConstant( ScalarTraits::highest() );  in setEmpty()
106   EIGEN_DEVICE_FUNC inline const VectorType& (min)() const { return m_min; }
108   EIGEN_DEVICE_FUNC inline VectorType& (min)() { return m_min; }
117   { return (m_min+m_max)/RealScalar(2); }  in EIGEN_EXPR_BINARYOP_SCALAR_RETURN_TYPE()
124   { return m_max - m_min; }  in sizes()
156       else                res[d] = m_min[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()
203     m_min = m_min.cwiseMin(p_n);  in extend()
212     m_min = m_min.cwiseMin(b.m_min);  in extend()
222     m_min = m_min.cwiseMax(b.m_min);  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()
244     m_min += t;  in translate()
294     m_min = (other.min)().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;
321     if( m_min[k] > p[k] )  in squaredExteriorDistance()
323       aux = m_min[k] - p[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()