Home
last modified time | relevance | path

Searched refs:mMax (Results 1 – 25 of 371) sorted by relevance

12345678910>>...15

/dports/misc/openvdb/openvdb-9.0.0/openvdb/openvdb/math/
H A DBBox.h200 return (mMin[0] > mMax[0] || mMin[1] > mMax[1] || mMin[2] > mMax[2]); in empty()
202 return mMin[0] >= mMax[0] || mMin[1] >= mMax[1] || mMin[2] >= mMax[2]; in empty()
235 return (mMin[0] <= mMax[0] && mMin[1] <= mMax[1] && mMin[2] <= mMax[2]); in isSorted()
238 return (mMin[0] < (mMax[0] + t) && mMin[1] < (mMax[1] + t) && mMin[2] < (mMax[2] + t)); in isSorted()
337 mMax[i] = std::max(mMax[i], xyz[i]); in expand()
348 mMax[i] = std::max(mMax[i], b.max()[i]); in expand()
359 mMax[i] = std::max(mMax[i], xyzMin[i] + size); in expand()
369 mMax += dx; in translate()
383 bbox.expand(map.applyMap(Vec3R(mMax[0], mMax[1], mMin[2]))); in applyMap()
386 bbox.expand(map.applyMap(Vec3R(mMax[0], mMax[1], mMax[2]))); in applyMap()
[all …]
H A DCoord.h308 mMax[n] = (mMin[n] + mMax[n]) >> 1; in CoordBBox()
361 return (mMin[0] > mMax[0] || mMin[1] > mMax[1] || mMin[2] > mMax[2]); in empty()
390 bool is_divisible() const { return mMin[0]<mMax[0] && mMin[1]<mMax[1] && mMin[2]<mMax[2]; } in is_divisible()
407 return !(Coord::lessThan(b.mMin,mMin) || Coord::lessThan(mMax,b.mMax)); in isInside()
413 return !(Coord::lessThan(mMax,b.mMin) || Coord::lessThan(b.mMax,mMin)); in hasOverlap()
463 void moveMax(const Coord& max) { mMin += max - mMax; mMax = max; } in moveMax()
475 p->reset(mMin.x(), mMax.y(), mMax.z()); ++p; in getCornerPoints()
477 p->reset(mMax.x(), mMin.y(), mMax.z()); ++p; in getCornerPoints()
478 p->reset(mMax.x(), mMax.y(), mMin.z()); ++p; in getCornerPoints()
479 p->reset(mMax.x(), mMax.y(), mMax.z()); in getCornerPoints()
[all …]
H A DStats.h56 if (less(mMax, val)) mMax = val;
69 if (less(mMax, other.mMax)) mMax = other.mMax;
87 ValueType mMin, mMax;
101 , mMax(-mMin) in Extrema()
110 mMax = std::max<double>(val, mMax); in add()
118 mMax = std::max<double>(val, mMax); in add()
166 mMax = std::max<double>(mMax, other.mMax); in join()
170 double mMin, mMax; variable
269 using Extrema::mMax;
287 if ( mMax <= mMin ) {
[all …]
/dports/games/openjk/OpenJK-07675e2/code/Ravl/
H A DCBounds.cpp88 CVec3 Work(mMax); in LargestAxisSize()
102 if (p[0]>mMax[0]) in DistanceEstimate()
104 ret=p[0]-mMax[0]; in DistanceEstimate()
108 ret=mMax[0]-p[0]; in DistanceEstimate()
113 if (p[1]>mMax[1]) in DistanceEstimate()
115 ret+=p[1]-mMax[1]; in DistanceEstimate()
119 ret+=mMax[1]-p[1]; in DistanceEstimate()
124 if (p[2]>mMax[2]) in DistanceEstimate()
155 mMax.Min(b2.mMax); in Intersect()
165 mMax.Max(b2.mMax); in Union()
[all …]
H A DCBounds.h130 CBBox(float Radius) {mMin.Set(-Radius); mMax.Set(Radius);} in CBBox()
131 CBBox(const CVec3& t) {mMin=t; mMax=t;} in CBBox()
132 CBBox(const CVec3& min, const CVec3& max) {mMin=min; mMax=max;} in CBBox()
133 CBBox(const CBBox& t) {mMin=t.mMin; mMax=t.mMax;} in CBBox()
146 CVec3 Center() const {return (mMin+mMax)*0.5;} in Center()
151 void Translate(const CVec3 &f) {mMin+=f; mMax+=f;} in Translate()
152 void Expand(float x) {mMin-=x; mMax+=x;} in Expand()
153 void Expand(const CVec3 &f) {mMin-=f; mMax+=f;} in Expand()
160 float Volume() const {return (mMax[0]-mMin[0])*(mMax[1]-mMin[1])*(mMax[2]-mMin[2]);} in Volume()
161 float AxisSize(int axis) const {return (mMax[axis]-mMin[axis]);} in AxisSize()
[all …]
/dports/graphics/qgis/qgis-3.22.3/src/core/raster/
H A Dqgsrasterrange.cpp22 , mMax( max ) in QgsRasterRange()
32 const bool thisUpperInfinite = !std::isfinite( mMax ); in overlaps()
36 const bool otherUpperInfinite = !std::isfinite( other.mMax ); in overlaps()
40 … && ( ( thisIncludesUpper && otherIncludesUpper && ( mMax >= other.mMax || thisUpperInfinite ) ) || in overlaps()
41 …( ( !thisIncludesUpper || !otherIncludesUpper ) && ( mMax > other.mMax || thisUpperInfinite ) ) ) ) in overlaps()
46 … && ( ( thisIncludesUpper && otherIncludesLower && ( mMax >= other.mMin || thisUpperInfinite ) ) || in overlaps()
50 …if ( ( ( thisIncludesLower && otherIncludesUpper && ( mMin <= other.mMax || thisLowerInfinite ) ) … in overlaps()
52 … && ( ( thisIncludesUpper && otherIncludesUpper && ( mMax >= other.mMax || thisUpperInfinite ) ) || in overlaps()
53 …( ( !thisIncludesUpper || !otherIncludesUpper ) && ( mMax > other.mMax || thisUpperInfinite ) ) ) ) in overlaps()
62 if ( qgsDoubleNear( mMin, other.mMin ) && qgsDoubleNear( mMax, other.mMax ) ) in overlaps()
[all …]
H A Dqgsrasterrange.h71 double max() const { return mMax; } in max()
92 double setMax( double max ) { return mMax = max; } in setMax()
106 && ( ( std::isnan( mMax ) && std::isnan( o.mMax ) ) || qgsDoubleNear( mMax, o.mMax ) )
120 ( value < mMax in contains()
121 …|| ( !std::isnan( mMax ) && qgsDoubleNear( value, mMax ) && ( mType == IncludeMinAndMax || mType =… in contains()
122 || std::isnan( mMax ) ); in contains()
157 double mMax = std::numeric_limits<double>::quiet_NaN();
/dports/graphics/qgis-ltr/qgis-3.16.16/src/core/raster/
H A Dqgsrasterrange.cpp22 , mMax( max ) in QgsRasterRange()
32 bool thisUpperInfinite = !std::isfinite( mMax ); in overlaps()
36 bool otherUpperInfinite = !std::isfinite( other.mMax ); in overlaps()
40 … && ( ( thisIncludesUpper && otherIncludesUpper && ( mMax >= other.mMax || thisUpperInfinite ) ) || in overlaps()
41 …( ( !thisIncludesUpper || !otherIncludesUpper ) && ( mMax > other.mMax || thisUpperInfinite ) ) ) ) in overlaps()
46 … && ( ( thisIncludesUpper && otherIncludesLower && ( mMax >= other.mMin || thisUpperInfinite ) ) || in overlaps()
50 …if ( ( ( thisIncludesLower && otherIncludesUpper && ( mMin <= other.mMax || thisLowerInfinite ) ) … in overlaps()
52 … && ( ( thisIncludesUpper && otherIncludesUpper && ( mMax >= other.mMax || thisUpperInfinite ) ) || in overlaps()
53 …( ( !thisIncludesUpper || !otherIncludesUpper ) && ( mMax > other.mMax || thisUpperInfinite ) ) ) ) in overlaps()
62 if ( qgsDoubleNear( mMin, other.mMin ) && qgsDoubleNear( mMax, other.mMax ) ) in overlaps()
[all …]
H A Dqgsrasterrange.h71 double max() const { return mMax; } in max()
92 double setMax( double max ) { return mMax = max; } in setMax()
106 && ( ( std::isnan( mMax ) && std::isnan( o.mMax ) ) || qgsDoubleNear( mMax, o.mMax ) )
120 ( value < mMax in contains()
121 …|| ( !std::isnan( mMax ) && qgsDoubleNear( value, mMax ) && ( mType == IncludeMinAndMax || mType =… in contains()
122 || std::isnan( mMax ) ); in contains()
157 double mMax = std::numeric_limits<double>::quiet_NaN();
/dports/games/irrlamb/irrlamb-1.0.1/src/OPCODE/Ice/
H A DIceAABB.h52 Point mMax; member
114 if(p.x > mMax.x) mMax.x = p.x; in Extend()
117 if(p.y > mMax.y) mMax.y = p.y; in Extend()
120 if(p.z > mMax.z) mMax.z = p.z; in Extend()
163 if(mMax.x < a.mMin.x in Intersect()
164 || a.mMax.x < mMin.x in Intersect()
165 || mMax.y < a.mMin.y in Intersect()
166 || a.mMax.y < mMin.y in Intersect()
167 || mMax.z < a.mMin.z in Intersect()
183 if(mMax[axis] < a.mMin[axis] || a.mMax[axis] < mMin[axis]) return FALSE; in Intersect()
[all …]
/dports/games/xray_re-tools/xray_re-tools-52721d2/sources/utils/converter/opcode/Ice/
H A DIceAABB.h52 Point mMax; member
114 if(p.x > mMax.x) mMax.x = p.x; in Extend()
117 if(p.y > mMax.y) mMax.y = p.y; in Extend()
120 if(p.z > mMax.z) mMax.z = p.z; in Extend()
163 if(mMax.x < a.mMin.x in Intersect()
164 || a.mMax.x < mMin.x in Intersect()
165 || mMax.y < a.mMin.y in Intersect()
166 || a.mMax.y < mMin.y in Intersect()
167 || mMax.z < a.mMin.z in Intersect()
183 if(mMax[axis] < a.mMin[axis] || a.mMax[axis] < mMin[axis]) return FALSE; in Intersect()
[all …]
/dports/games/alienarena-data/alienarena-7.66/source/unix/odesrc/OPCODE/Ice/
H A DIceAABB.h52 Point mMax; member
114 if(p.x > mMax.x) mMax.x = p.x; in Extend()
117 if(p.y > mMax.y) mMax.y = p.y; in Extend()
120 if(p.z > mMax.z) mMax.z = p.z; in Extend()
163 if(mMax.x < a.mMin.x in Intersect()
164 || a.mMax.x < mMin.x in Intersect()
165 || mMax.y < a.mMin.y in Intersect()
166 || a.mMax.y < mMin.y in Intersect()
167 || mMax.z < a.mMin.z in Intersect()
183 if(mMax[axis] < a.mMin[axis] || a.mMax[axis] < mMin[axis]) return FALSE; in Intersect()
[all …]
/dports/games/alienarena/alienarena-7.66/source/unix/odesrc/OPCODE/Ice/
H A DIceAABB.h52 Point mMax; member
114 if(p.x > mMax.x) mMax.x = p.x; in Extend()
117 if(p.y > mMax.y) mMax.y = p.y; in Extend()
120 if(p.z > mMax.z) mMax.z = p.z; in Extend()
163 if(mMax.x < a.mMin.x in Intersect()
164 || a.mMax.x < mMin.x in Intersect()
165 || mMax.y < a.mMin.y in Intersect()
166 || a.mMax.y < mMin.y in Intersect()
167 || mMax.z < a.mMin.z in Intersect()
183 if(mMax[axis] < a.mMin[axis] || a.mMax[axis] < mMin[axis]) return FALSE; in Intersect()
[all …]
/dports/devel/ode/ode-0.13/OPCODE/Ice/
H A DIceAABB.h52 Point mMax; member
114 if(p.x > mMax.x) mMax.x = p.x; in Extend()
117 if(p.y > mMax.y) mMax.y = p.y; in Extend()
120 if(p.z > mMax.z) mMax.z = p.z; in Extend()
163 if(mMax.x < a.mMin.x in Intersect()
164 || a.mMax.x < mMin.x in Intersect()
165 || mMax.y < a.mMin.y in Intersect()
166 || a.mMax.y < mMin.y in Intersect()
167 || mMax.z < a.mMin.z in Intersect()
183 if(mMax[axis] < a.mMin[axis] || a.mMax[axis] < mMin[axis]) return FALSE; in Intersect()
[all …]
/dports/devel/bullet/bullet3-3.21/Extras/ConvexDecomposition/
H A Dsplitplane.cpp103 mMax[0] = bmax[0]; in Rect3d()
104 mMax[1] = bmax[1]; in Rect3d()
105 mMax[2] = bmax[2]; in Rect3d()
117 mMax[0] = bmax[0]; in SetMax()
131 mMax[0] = x; in SetMax()
132 mMax[1] = y; in SetMax()
133 mMax[2] = z; in SetMax()
137 float mMax[3]; member in ConvexDecomposition::Rect3d
150 b1.SetMax(midpoint[0], source.mMax[1], source.mMax[2]); in splitRect()
158 b1.SetMax(source.mMax[0], midpoint[1], source.mMax[2]); in splitRect()
[all …]
/dports/science/chrono/chrono-7.0.1/src/chrono/collision/gimpact/ConvexDecomposition/
H A Dsplitplane.cpp109 mMax[0] = bmax[0]; in Rect3d()
110 mMax[1] = bmax[1]; in Rect3d()
111 mMax[2] = bmax[2]; in Rect3d()
124 mMax[0] = bmax[0]; in SetMax()
138 mMax[0] = x; in SetMax()
139 mMax[1] = y; in SetMax()
140 mMax[2] = z; in SetMax()
144 float mMax[3]; member in ConvexDecomposition::Rect3d
157 b1.SetMax( midpoint[0], source.mMax[1], source.mMax[2] ); in splitRect()
165 b1.SetMax( source.mMax[0], midpoint[1], source.mMax[2] ); in splitRect()
[all …]
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/Extras/ConvexDecomposition/
H A Dsplitplane.cpp109 mMax[0] = bmax[0]; in Rect3d()
110 mMax[1] = bmax[1]; in Rect3d()
111 mMax[2] = bmax[2]; in Rect3d()
124 mMax[0] = bmax[0]; in SetMax()
138 mMax[0] = x; in SetMax()
139 mMax[1] = y; in SetMax()
140 mMax[2] = z; in SetMax()
144 float mMax[3]; member in ConvexDecomposition::Rect3d
157 b1.SetMax( midpoint[0], source.mMax[1], source.mMax[2] ); in splitRect()
165 b1.SetMax( source.mMax[0], midpoint[1], source.mMax[2] ); in splitRect()
[all …]
/dports/devel/py-bullet3/bullet3-3.21/Extras/ConvexDecomposition/
H A Dsplitplane.cpp103 mMax[0] = bmax[0]; in Rect3d()
104 mMax[1] = bmax[1]; in Rect3d()
105 mMax[2] = bmax[2]; in Rect3d()
117 mMax[0] = bmax[0]; in SetMax()
131 mMax[0] = x; in SetMax()
132 mMax[1] = y; in SetMax()
133 mMax[2] = z; in SetMax()
137 float mMax[3]; member in ConvexDecomposition::Rect3d
150 b1.SetMax(midpoint[0], source.mMax[1], source.mMax[2]); in splitRect()
158 b1.SetMax(source.mMax[0], midpoint[1], source.mMax[2]); in splitRect()
[all …]
/dports/sysutils/kcron/kcron-21.12.3/src/crontablib/
H A Dctunit.cpp18 mMax = _max; in CTUnit()
25 mMax = source.mMax; in CTUnit()
29 mInitialEnabled.reserve(mMax + 1); in CTUnit()
30 for (int i = 0; i <= mMax; i++) { in CTUnit()
50 mMax = unit.mMax; in operator =()
53 for (int i = 0; i <= mMax; i++) { in operator =()
64 for (int i = 0; i <= mMax; i++) { in initialize()
110 endat = mMax; in parse()
124 if (endat > mMax) { in parse()
125 endat = mMax; in parse()
[all …]
/dports/www/firefox-esr/firefox-91.8.0/layout/xul/tree/
H A DnsTreeSelection.cpp31 int32_t mMax; member
38 mMax(aSingleVal) {} in nsTreeRange()
44 mMax(aMax) {} in nsTreeRange()
65 if (aEnd < mMax) { in RemoveRange()
74 mMax = aStart - 1; in RemoveRange()
92 mMax = aStart - 1; in RemoveRange()
100 if (mMin == mMax) { in Remove()
111 mMax--; in Remove()
118 mMax = aIndex - 1; in Remove()
145 mMax = aIndex; in Add()
[all …]
/dports/www/firefox/firefox-99.0/layout/xul/tree/
H A DnsTreeSelection.cpp31 int32_t mMax; member
38 mMax(aSingleVal) {} in nsTreeRange()
44 mMax(aMax) {} in nsTreeRange()
65 if (aEnd < mMax) { in RemoveRange()
74 mMax = aStart - 1; in RemoveRange()
92 mMax = aStart - 1; in RemoveRange()
100 if (mMin == mMax) { in Remove()
111 mMax--; in Remove()
118 mMax = aIndex - 1; in Remove()
145 mMax = aIndex; in Add()
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/layout/xul/tree/
H A DnsTreeSelection.cpp31 int32_t mMax; member
38 mMax(aSingleVal) {} in nsTreeRange()
44 mMax(aMax) {} in nsTreeRange()
65 if (aEnd < mMax) { in RemoveRange()
74 mMax = aStart - 1; in RemoveRange()
92 mMax = aStart - 1; in RemoveRange()
100 if (mMin == mMax) { in Remove()
111 mMax--; in Remove()
118 mMax = aIndex - 1; in Remove()
145 mMax = aIndex; in Add()
[all …]
/dports/lang/spidermonkey78/firefox-78.9.0/layout/xul/tree/
H A DnsTreeSelection.cpp31 int32_t mMax; member
38 mMax(aSingleVal) {} in nsTreeRange()
44 mMax(aMax) {} in nsTreeRange()
65 if (aEnd < mMax) { in RemoveRange()
74 mMax = aStart - 1; in RemoveRange()
92 mMax = aStart - 1; in RemoveRange()
100 if (mMin == mMax) { in Remove()
111 mMax--; in Remove()
118 mMax = aIndex - 1; in Remove()
145 mMax = aIndex; in Add()
[all …]
/dports/science/code_saturne/code_saturne-7.1.0/src/cdo/
H A Dcs_cdo_anderson.h125 BFT_MALLOC(DG_, n_faces*mMax, cs_real_t); in aa_init()
126 BFT_MALLOC(Q_, n_faces*mMax, cs_real_t); in aa_init()
127 R_ = cs_sdm_square_create(mMax); in aa_init()
128 cs_sdm_square_init(mMax, R_); in aa_init()
129 BFT_MALLOC(gamma_, mMax, cs_real_t); in aa_init()
130 BFT_MALLOC(tempGamma_, mMax, cs_real_t); in aa_init()
155 for (int i=0 ; i<mMax-1 ; i++) in qrdelete()
167 if (i<mMax-2) in qrdelete()
169 for (int j=i+2 ; j<mMax ; j++) in qrdelete()
190 for (int i=0 ; i<mMax-1 ; i++){ in qrdelete()
[all …]
/dports/lang/spidermonkey60/firefox-60.9.0/layout/xul/tree/
H A DnsTreeSelection.cpp30 int32_t mMax; member
37 mMax(aSingleVal) {} in nsTreeRange()
43 mMax(aMax) {} in nsTreeRange()
64 if (aEnd < mMax) { in RemoveRange()
73 mMax = aStart - 1; in RemoveRange()
91 mMax = aStart - 1; in RemoveRange()
99 if (mMin == mMax) { in Remove()
110 mMax--; in Remove()
117 mMax = aIndex - 1; in Remove()
144 mMax = aIndex; in Add()
[all …]

12345678910>>...15