HomeSort by relevance Sort by last modified time
    Searched refs:m_max (Results 1 - 9 of 9) sorted by null

  /external/eigen/Eigen/src/Eigen2Support/Geometry/
AlignedBox.h 41 inline explicit AlignedBox(int _dim) : m_min(_dim), m_max(_dim)
45 inline AlignedBox(const VectorType& _min, const VectorType& _max) : m_min(_min), m_max(_max) {}
48 inline explicit AlignedBox(const VectorType& p) : m_min(p), m_max(p) {}
56 inline bool isNull() const { return (m_min.cwise() > m_max).any(); }
62 m_max.setConstant(-(std::numeric_limits<Scalar>::max)());
70 inline const VectorType& (max)() const { return m_max; }
72 inline VectorType& (max)() { return m_max; }
76 { return (m_min.cwise()<=p).all() && (p.cwise()<=m_max).all(); }
80 { return (m_min.cwise()<=(b.min)()).all() && ((b.max)().cwise()<=m_max).all(); }
84 { m_min = (m_min.cwise().min)(p); m_max = (m_max.cwise().max)(p); return *this;
141 VectorType m_min, m_max; member in class:Eigen::AlignedBox
    [all...]
  /external/qemu/memcheck/
memcheck_common.h 380 int m_max = addr_array->num - 1; local
385 while (m_min <= m_max) {
386 const int m = (m_min + m_max) >> 1;
392 m_max = m - 1;
412 int m_max; local
430 m_max = addr_array->num - 1;
431 while (m_min <= m_max) {
432 const int m = (m_min + m_max) >> 1;
438 m_max = m - 1;
443 if (m_max < 0)
    [all...]
  /external/eigen/Eigen/src/Geometry/
AlignedBox.h 63 inline explicit AlignedBox(Index _dim) : m_min(_dim), m_max(_dim)
68 inline AlignedBox(const OtherVectorType1& _min, const OtherVectorType2& _max) : m_min(_min), m_max(_max) {}
76 m_max = p;
91 inline bool isEmpty() const { return (m_min.array() > m_max.array()).any(); }
97 m_max.setConstant( ScalarTraits::lowest() );
105 inline const VectorType& (max)() const { return m_max; }
107 inline VectorType& (max)() { return m_max; }
113 { return (m_min+m_max)/2; }
120 { return m_max - m_min; }
151 if( mult & corner ) res[d] = m_max[d]
290 VectorType m_min, m_max; member in class:Eigen::AlignedBox
    [all...]
  /external/emma/core/java12/com/vladium/util/
ByteArrayIStream.java 40 m_max = length;
47 if (m_pos >= m_max)
61 final int max = m_max;
81 return m_max - m_pos;
86 if (m_pos + n > m_max) n = m_max - m_pos;
119 private final int m_max; field in class:ByteArrayIStream
  /external/qemu/
exec-all.h 230 unsigned int m_max = (tb->tpc2gpc_pairs - 1) << 1; local
235 while (m_min <= m_max) {
236 const unsigned int m = ((m_min + m_max) >> 1) & ~1;
238 m_max = m - 2;
239 } else if (m == m_max || tb_pc < tb->tpc2gpc[m + 2]) {
245 return tb->tpc2gpc[m_max + 1];
exec.c 1269 int m_min, m_max, m; local
    [all...]
  /external/chromium_org/third_party/WebKit/Source/core/xml/
XPathFunctions.cpp 63 int m_max; member in class:WebCore::XPath::Interval
265 : m_min(Inf), m_max(Inf)
270 : m_min(value), m_max(value)
275 : m_min(min), m_max(max)
281 if (m_min == Inf && m_max == Inf)
285 return value <= m_max;
287 if (m_max == Inf)
290 return value >= m_min && value <= m_max;
  /external/qemu/tcg/
tcg.c 828 int m, m_min, m_max; local
840 m_max = s->nb_helpers - 1;
841 while (m_min <= m_max) {
842 m = (m_min + m_max) >> 1;
848 m_max = m - 1;
    [all...]
  /external/emma/lib/
emma.jar 

Completed in 256 milliseconds