Home
last modified time | relevance | path

Searched refs:upperLimit (Results 1 – 25 of 671) sorted by relevance

12345678910>>...27

/dports/graphics/povray38/povunix-v3.8.0-beta.2-src/source/base/
H A Dmathutil.h103 inline T wrap(T val, T upperLimit) in wrap() argument
105 T tempVal = fmod(val, upperLimit); in wrap()
113 tempVal += upperLimit; in wrap()
119 if (forcePrecision<double>(tempVal) >= upperLimit) in wrap()
131 inline T2 wrapInt(T1 val, T2 upperLimit) in wrapInt() argument
133 T1 tempVal = val % upperLimit; in wrapInt()
139 tempVal += upperLimit; in wrapInt()
151 inline void setWrapInt(T1& val, T2 upperLimit) in setWrapInt() argument
153 val %= upperLimit; in setWrapInt()
159 val += upperLimit; in setWrapInt()
[all …]
/dports/audio/libopenmpt/libopenmpt-0.6.0+release.autotools/common/
H A DmptBaseUtils.h75 inline void Limit(T& val, const C lowerLimit, const C upperLimit) in Limit() argument
77 if(lowerLimit > upperLimit) return; in Limit()
79 else if(val > upperLimit) val = upperLimit; in Limit()
85 inline T Clamp(T val, const C lowerLimit, const C upperLimit) in Clamp() argument
88 else if(val > upperLimit) return upperLimit; in Clamp()
94 inline void LimitMax(T& val, const C upperLimit) in LimitMax() argument
96 if(val > upperLimit) in LimitMax()
97 val = upperLimit; in LimitMax()
/dports/audio/carla/Carla-2.4.1/source/modules/water/maths/
H A DMathsFunctions.h170 const Type upperLimit, in jlimit() argument
174 CARLA_SAFE_ASSERT_RETURN(lowerLimit <= upperLimit, lowerLimit); in jlimit()
177 : ((upperLimit < valueToConstrain) ? upperLimit in jlimit()
187 bool isPositiveAndBelow (Type valueToTest, Type upperLimit) noexcept in isPositiveAndBelow() argument
190 CARLA_SAFE_ASSERT_RETURN(Type() <= upperLimit, false); in isPositiveAndBelow()
192 return Type() <= valueToTest && valueToTest < upperLimit; in isPositiveAndBelow()
199 CARLA_SAFE_ASSERT_RETURN(upperLimit >= 0, false); in isPositiveAndBelow()
210 bool isPositiveAndNotGreaterThan (Type valueToTest, Type upperLimit) noexcept in isPositiveAndNotGreaterThan() argument
213 CARLA_SAFE_ASSERT_RETURN(Type() <= upperLimit, false); in isPositiveAndNotGreaterThan()
215 return Type() <= valueToTest && valueToTest <= upperLimit; in isPositiveAndNotGreaterThan()
[all …]
/dports/audio/carla/Carla-2.4.1/source/modules/juce_core/containers/
H A Djuce_HashMap.h37 …tatic int generateHash (uint32 key, int upperLimit) noexcept { return (int) (key % (uint… in generateHash()
39 …tic int generateHash (int32 key, int upperLimit) noexcept { return generateHash ((uint3… in generateHash()
41 …tatic int generateHash (uint64 key, int upperLimit) noexcept { return (int) (key % (uint… in generateHash()
43 …tic int generateHash (int64 key, int upperLimit) noexcept { return generateHash ((uint6… in generateHash()
45 …nerateHash (const String& key, int upperLimit) noexcept { return generateHash ((uint32) key.has… in generateHash()
47 …int generateHash (const var& key, int upperLimit) noexcept { return generateHash (key.toStri… in generateHash()
49 …teHash (const void* key, int upperLimit) noexcept { return generateHash ((uint64) (pointer_si… in generateHash()
51 …c int generateHash (const Uuid& key, int upperLimit) noexcept { return generateHash (key.hash… in generateHash()
/dports/devel/juce/JUCE-f37e9a1/modules/juce_core/containers/
H A Djuce_HashMap.h37 …tatic int generateHash (uint32 key, int upperLimit) noexcept { return (int) (key % (uint… in generateHash()
39 …tic int generateHash (int32 key, int upperLimit) noexcept { return generateHash ((uint3… in generateHash()
41 …tatic int generateHash (uint64 key, int upperLimit) noexcept { return (int) (key % (uint… in generateHash()
43 …tic int generateHash (int64 key, int upperLimit) noexcept { return generateHash ((uint6… in generateHash()
45 …nerateHash (const String& key, int upperLimit) noexcept { return generateHash ((uint32) key.has… in generateHash()
47 …int generateHash (const var& key, int upperLimit) noexcept { return generateHash (key.toStri… in generateHash()
49 …teHash (const void* key, int upperLimit) noexcept { return generateHash ((uint64) (pointer_si… in generateHash()
51 …c int generateHash (const Uuid& key, int upperLimit) noexcept { return generateHash (key.hash… in generateHash()
/dports/audio/libopenshot-audio/libopenshot-audio-0.2.2/JuceLibraryCode/modules/juce_core/containers/
H A Djuce_HashMap.h37 …tatic int generateHash (uint32 key, int upperLimit) noexcept { return (int) (key % (uint… in generateHash()
39 …tic int generateHash (int32 key, int upperLimit) noexcept { return generateHash ((uint3… in generateHash()
41 …tatic int generateHash (uint64 key, int upperLimit) noexcept { return (int) (key % (uint… in generateHash()
43 …tic int generateHash (int64 key, int upperLimit) noexcept { return generateHash ((uint6… in generateHash()
45 …nerateHash (const String& key, int upperLimit) noexcept { return generateHash ((uint32) key.has… in generateHash()
47 …int generateHash (const var& key, int upperLimit) noexcept { return generateHash (key.toStri… in generateHash()
49 …teHash (const void* key, int upperLimit) noexcept { return generateHash ((uint64) (pointer_si… in generateHash()
51 …c int generateHash (const Uuid& key, int upperLimit) noexcept { return generateHash (key.hash… in generateHash()
/dports/cad/graywolf/graywolf-0.1.6-4-gf47937b/src/mc_compact/
H A Dycompact.c132 upperLimit = NULL ; in buildYGraph()
148 upperLimit = curPick ; in buildYGraph()
190 } else if( upperLimit ){ in buildYGraph()
374 upperLimit = upperLimit->next ; in update_ypicket()
386 if( curPick == upperLimit ){ in update_ypicket()
404 temp->next = upperLimit ; in update_ypicket()
405 upperLimit->prev = temp ; in update_ypicket()
409 ASSERT( tileNodeG[upperLimit->node]->l <= upperLimit->pt2.lft && in update_ypicket()
410 upperLimit->pt2.lft <= tileNodeG[upperLimit->node]->r, in update_ypicket()
413 if( upperLimit->pt1.rght == upperLimit->pt2.lft ){ in update_ypicket()
[all …]
H A Dxcompact.c124 upperLimit = NULL ; in buildXGraph()
141 upperLimit = curPick ; in buildXGraph()
168 } else if( upperLimit ){ in buildXGraph()
350 if( lowerLimit != upperLimit ){ in update_xpicket()
358 upperLimit = upperLimit->next ; in update_xpicket()
369 if( curPick == upperLimit ){ in update_xpicket()
381 upperLimit->pt2.bot = newtile->t ; in update_xpicket()
387 temp->next = upperLimit ; in update_xpicket()
388 upperLimit->prev = temp ; in update_xpicket()
390 if( upperLimit->pt1.top == upperLimit->pt2.bot ){ in update_xpicket()
[all …]
/dports/lang/seed7/seed7/lib/
H A Dforloop.s7i103 while variable <= upperLimit do
116 variable := upperLimit;
134 * or above ''upperLimit''.
140 to (in aType: upperLimit)
150 if variable < upperLimit then
160 to (in aType: upperLimit)
170 if variable < upperLimit then
186 variable := upperLimit;
206 variable := upperLimit;
240 if variable < upperLimit then
[all …]
/dports/cad/graywolf/graywolf-0.1.6-4-gf47937b/src/Ylib/
H A Dset.c77 YSETPTR Yset_init( lowerLimit, upperLimit ) in Yset_init() argument
78 INT lowerLimit, upperLimit ; in Yset_init()
89 if( lowerLimit > upperLimit ){
93 sizeSet = upperLimit - lowerLimit + 1 ;
102 set->upperLimit = upperLimit ;
131 if( node >= set->lowerLimit && node <= set->upperLimit ){
151 if( node >= set->lowerLimit && node <= set->upperLimit ){
184 ASSERTNRETURN( node >= set->lowerLimit && node <= set->upperLimit, in Yset_delete()
244 upper = set->upperLimit ;
/dports/science/eccodes/eccodes-2.23.0-Source/tests/
H A Dgrib_ecc-1150.sh29 grib_check_key_equals $tempGrib lowerLimit,upperLimit 'MISSING 0'
34 transient ulim_missing = missing(upperLimit);
48 grib_check_key_equals $tempGrib lowerLimit,upperLimit '0 MISSING'
53 transient ulim_missing = missing(upperLimit);
63 ${tools_dir}/grib_set -s upperLimit=missing,lowerLimit=missing $tempGrib $temp2
64 grib_check_key_equals $temp2 lowerLimit,upperLimit 'MISSING MISSING'
/dports/math/rocs/rocs-21.12.3/libgraphtheory/modifiers/
H A Dvalueassign.cpp77 …s(const QVector<T> &list, const QString &property, int lowerLimit, int upperLimit, int seed, bool … in assignRandomIntegers() argument
79 if (lowerLimit > upperLimit) { in assignRandomIntegers()
86 boost::uniform_int<> distribution(lowerLimit, upperLimit); in assignRandomIntegers()
96 …t QVector<NodePtr> &list, const QString &property, int lowerLimit, int upperLimit, int seed, bool …
97 …t QVector<EdgePtr> &list, const QString &property, int lowerLimit, int upperLimit, int seed, bool …
101 …nst QVector<T> &list, const QString &property, qreal lowerLimit, qreal upperLimit, int seed, bool … in assignRandomReals() argument
103 if (lowerLimit > upperLimit) { in assignRandomReals()
110 boost::uniform_real<> distribution(lowerLimit, upperLimit); in assignRandomReals()
120 …ector<NodePtr> &list, const QString &property, qreal lowerLimit, qreal upperLimit, int seed, bool …
121 …ector<EdgePtr> &list, const QString &property, qreal lowerLimit, qreal upperLimit, int seed, bool …
/dports/graphics/art/ART-1.9.3/rtengine/
H A Ddeconvautoradius.cc39 …er(const float * const *rawData, int W, int H, float lowerLimit, float upperLimit, const unsigned … in calcRadiusBayer() argument
58 … if (rtengine::max(rawData[row - 1][col - 1], rawData[row - 1][col + 1], val1p1) >= upperLimit) { in calcRadiusBayer()
62 …ax(rawData[row][col - 2], val00, rawData[row + 2][col - 2], rawData[row + 2][col]) >= upperLimit) { in calcRadiusBayer()
76 … if (rtengine::max(rawData[row - 1][col - 1], rawData[row - 1][col + 1], val1p1) >= upperLimit) { in calcRadiusBayer()
80 …ax(val00, rawData[row][col + 2], rawData[row + 2][col], rawData[row + 2][col + 2]) >= upperLimit) { in calcRadiusBayer()
102 …ns(const float * const *rawData, int W, int H, float lowerLimit, float upperLimit, unsigned int st… in calcRadiusXtrans() argument
112 …p1, rawData[row + 1][col + 2], rawData[row + 2][col + 1], rawData[row + 2][col + 2]) >= upperLimit; in calcRadiusXtrans()
114 …eenSolitary > 1.f && std::max(rawData[row - 1][col - 1], rawData[row - 1][col + 1]) < upperLimit) { in calcRadiusXtrans()
115 if (greenSolitary < upperLimit) { in calcRadiusXtrans()
150 …gine::max(greenSolitaryRight, rawData[row + 4][col + 2], rawData[row + 4][col + 4]) < upperLimit) { in calcRadiusXtrans()
[all …]
/dports/games/openxcom/OpenXcom-1.0/src/Geoscape/
H A DGraphsState.cpp629 int upperLimit = 0; in drawCountryLines() local
674 upperLimit = total; in drawCountryLines()
688 upperLimit = check * grids; in drawCountryLines()
699 range = upperLimit - lowerLimit; in drawCountryLines()
808 int upperLimit = 0; in drawRegionLines() local
845 upperLimit = total; in drawRegionLines()
858 upperLimit = check * 9; in drawRegionLines()
868 range = upperLimit - lowerLimit; in drawRegionLines()
958 int upperLimit = 0; in drawFinanceLines() local
1040 upperLimit = check * 9; in drawFinanceLines()
[all …]
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/JEGA/FrontEnd/Core/src/
H A DConfigHelper.cpp349 con_val_t upperLimit, in AddLinearInequalityConstraint() argument
395 con_val_t upperLimit, in AddLinearTwoSidedInequalityConstraint() argument
411 con_val_t upperLimit in AddNonlinearInequalityConstraint() argument
454 con_val_t upperLimit in AddNonlinearTwoSidedInequalityConstraint() argument
692 con_val_t upperLimit, in GetLinearInequalityConstraint() argument
742 con_val_t upperLimit, in GetLinearTwoSidedInequalityConstraint() argument
760 con_val_t upperLimit in GetNonlinearInequalityConstraint() argument
807 con_val_t upperLimit in GetNonlinearTwoSidedInequalityConstraint() argument
902 con_val_t upperLimit in GetInequalityConstraintType() argument
909 theType->SetUpperValue(upperLimit); in GetInequalityConstraintType()
[all …]
H A DProblemConfig.cpp368 con_val_t upperLimit, in AddLinearInequalityConstraint() argument
374 this->_theTarget, label, upperLimit, coeffs in AddLinearInequalityConstraint()
409 con_val_t upperLimit, in AddLinearTwoSidedInequalityConstraint() argument
415 this->_theTarget, label, lowerLimit, upperLimit, coeffs in AddLinearTwoSidedInequalityConstraint()
422 con_val_t upperLimit in AddNonlinearInequalityConstraint() argument
427 this->_theTarget, label, upperLimit in AddNonlinearInequalityConstraint()
460 con_val_t upperLimit in AddNonlinearTwoSidedInequalityConstraint() argument
465 this->_theTarget, label, lowerLimit, upperLimit in AddNonlinearTwoSidedInequalityConstraint()
/dports/audio/carla/Carla-2.4.1/source/modules/water/containers/
H A DHashMap.h46 …t generateHash (const int key, const int upperLimit) const noexcept { return std::abs (key)… in generateHash()
48 …nerateHash (const int64 key, const int upperLimit) const noexcept { return std::abs ((int) ke… in generateHash()
50 …(const String& key, const int upperLimit) const noexcept { return (int) (((uint32) key.hashCode… in generateHash()
52 …ateHash (const var& key, const int upperLimit) const noexcept { return generateHash (key.toS… in generateHash()
54 … void* key, const int upperLimit) const noexcept { return (int)(((pointer_sized_uint) key) % … in generateHash()
/dports/devel/juce/JUCE-f37e9a1/modules/juce_core/maths/
H A Djuce_MathsFunctions.h263 Type upperLimit, in jlimit() argument
266 …jassert (lowerLimit <= upperLimit); // if these are in the wrong order, results are unpredictable.. in jlimit()
269 : (upperLimit < valueToConstrain ? upperLimit in jlimit()
279 bool isPositiveAndBelow (Type1 valueToTest, Type2 upperLimit) noexcept in isPositiveAndBelow() argument
282 return Type1() <= valueToTest && valueToTest < static_cast<Type1> (upperLimit); in isPositiveAndBelow()
286 bool isPositiveAndBelow (int valueToTest, Type upperLimit) noexcept in isPositiveAndBelow() argument
289 return static_cast<unsigned int> (valueToTest) < static_cast<unsigned int> (upperLimit); in isPositiveAndBelow()
298 bool isPositiveAndNotGreaterThan (Type1 valueToTest, Type2 upperLimit) noexcept in isPositiveAndNotGreaterThan() argument
301 return Type1() <= valueToTest && valueToTest <= static_cast<Type1> (upperLimit); in isPositiveAndNotGreaterThan()
305 bool isPositiveAndNotGreaterThan (int valueToTest, Type upperLimit) noexcept in isPositiveAndNotGreaterThan() argument
[all …]
/dports/audio/carla/Carla-2.4.1/source/modules/juce_core/maths/
H A Djuce_MathsFunctions.h263 Type upperLimit, in jlimit() argument
266 …jassert (lowerLimit <= upperLimit); // if these are in the wrong order, results are unpredictable.. in jlimit()
269 : (upperLimit < valueToConstrain ? upperLimit in jlimit()
279 bool isPositiveAndBelow (Type1 valueToTest, Type2 upperLimit) noexcept in isPositiveAndBelow() argument
282 return Type1() <= valueToTest && valueToTest < static_cast<Type1> (upperLimit); in isPositiveAndBelow()
286 bool isPositiveAndBelow (int valueToTest, Type upperLimit) noexcept in isPositiveAndBelow() argument
289 return static_cast<unsigned int> (valueToTest) < static_cast<unsigned int> (upperLimit); in isPositiveAndBelow()
298 bool isPositiveAndNotGreaterThan (Type1 valueToTest, Type2 upperLimit) noexcept in isPositiveAndNotGreaterThan() argument
301 return Type1() <= valueToTest && valueToTest <= static_cast<Type1> (upperLimit); in isPositiveAndNotGreaterThan()
305 bool isPositiveAndNotGreaterThan (int valueToTest, Type upperLimit) noexcept in isPositiveAndNotGreaterThan() argument
[all …]
/dports/audio/libopenshot-audio/libopenshot-audio-0.2.2/JuceLibraryCode/modules/juce_core/maths/
H A Djuce_MathsFunctions.h220 Type upperLimit, in jlimit() argument
223 …jassert (lowerLimit <= upperLimit); // if these are in the wrong order, results are unpredictable.. in jlimit()
226 : (upperLimit < valueToConstrain ? upperLimit in jlimit()
236 bool isPositiveAndBelow (Type1 valueToTest, Type2 upperLimit) noexcept in isPositiveAndBelow() argument
239 return Type1() <= valueToTest && valueToTest < static_cast<Type1> (upperLimit); in isPositiveAndBelow()
243 bool isPositiveAndBelow (int valueToTest, Type upperLimit) noexcept in isPositiveAndBelow() argument
246 return static_cast<unsigned int> (valueToTest) < static_cast<unsigned int> (upperLimit); in isPositiveAndBelow()
255 bool isPositiveAndNotGreaterThan (Type1 valueToTest, Type2 upperLimit) noexcept in isPositiveAndNotGreaterThan() argument
258 return Type1() <= valueToTest && valueToTest <= static_cast<Type1> (upperLimit); in isPositiveAndNotGreaterThan()
262 bool isPositiveAndNotGreaterThan (int valueToTest, Type upperLimit) noexcept in isPositiveAndNotGreaterThan() argument
[all …]
/dports/math/vampire/vampire-4.5.1/Indexing/
H A DArithmeticIndex.cpp46 InterpretedType upperLimit;
80 if( ci->hasUpperLimit && (ci->upperLimit < val ||
81 (ci->strongUpperLimit && ci->upperLimit==val) ) ) {
119 if( ci->hasUpperLimit && (ci->upperLimit > val ||
120 (ci->strongUpperLimit && ci->upperLimit==val) ) ) {
201 if( !ctr->hasUpperLimit || ctr->upperLimit > num ||
202 (strong && !ctr->strongUpperLimit && ctr->upperLimit==num) ) {
205 ctr->upperLimit=num;
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/JEGA/FrontEnd/Managed/src/
H A DMProblemConfig.cpp330 con_val_t upperLimit,
336 ToStdStr(label), upperLimit, ToStdDoubleVector(coeffs)
358 double upperLimit,
364 ToStdStr(label), lowerLimit, upperLimit, ToStdDoubleVector(coeffs)
384 double upperLimit
389 ToStdStr(label), upperLimit
410 double upperLimit
415 ToStdStr(label), lowerLimit, upperLimit
/dports/graphics/reactphysics3d/reactphysics3d-0.8.0/include/reactphysics3d/mathematics/
H A Dmathematics_functions.h59 inline int clamp(int value, int lowerLimit, int upperLimit) { in clamp() argument
60 assert(lowerLimit <= upperLimit); in clamp()
61 return std::min(std::max(value, lowerLimit), upperLimit); in clamp()
66 inline decimal clamp(decimal value, decimal lowerLimit, decimal upperLimit) { in clamp() argument
67 assert(lowerLimit <= upperLimit); in clamp()
68 return std::min(std::max(value, lowerLimit), upperLimit); in clamp()
/dports/math/jags/JAGS-4.3.0/src/lib/graph/
H A DScalarStochasticNode.cc44 double const *u = upperLimit(chain); in logDensity()
53 double const *u = upperLimit(chain); in deterministicSample()
62 double const *u = upperLimit(chain); in randomSample()
76 double const *u = upperLimit(chain); in truncatedSample()
89 double const *u = upperLimit(chain); in checkParentValues()
137 lowerLimit(ch1), upperLimit(ch1), in KL()
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/JEGA/FrontEnd/Core/include/
H A DConfigHelper.hpp539 con_val_t upperLimit = 0.0,
620 con_val_t upperLimit,
642 con_val_t upperLimit = 0.0
711 con_val_t upperLimit
1044 con_val_t upperLimit = 0.0,
1131 con_val_t upperLimit,
1156 con_val_t upperLimit = 0.0
1231 con_val_t upperLimit
1359 con_val_t upperLimit
1383 con_val_t upperLimit

12345678910>>...27