/dports/math/coinmp/CoinMP-releases-1.8.4/CoinMP/examples/csharp/ |
H A D | ProblemAfiro.cs | 14 const double DBL_MAX = 1e+037; in Solve() 32 …double[] dcup = new double[NUM_COLS] {DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MA… in Solve() 33 … DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, in Solve() 34 … DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, in Solve() 35 DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX}; in Solve()
|
H A D | ProblemGamsSos2a.cs | 14 const double DBL_MAX = 1e37; in Solve() 29 double[] dclo = new double[NUM_COLS] {0.0, 0, 0, -DBL_MAX, -DBL_MAX, 0, 0}; in Solve() 30 double[] dcup = new double[NUM_COLS] {DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, in Solve() 31 DBL_MAX, DBL_MAX, DBL_MAX}; in Solve()
|
H A D | ProblemExMip1.cs | 16 const double DBL_MAX = 1e37; in Solve() 30 … double[] dcup = new double[NUM_COLS] {DBL_MAX, 4.1, DBL_MAX, DBL_MAX, 4, DBL_MAX, DBL_MAX, 4.3}; in Solve() 36 double[] drlo = {2.5, -DBL_MAX, -DBL_MAX, 1.8, 3.0}; in Solve() 37 double[] drup = {DBL_MAX, 2.1, 4.0, 5.0, 15.0}; in Solve()
|
/dports/math/igraph/igraph-0.9.5/vendor/glpk/draft/ |
H A D | glpios02.c | 302 if (L == -DBL_MAX || f->f_max == +DBL_MAX) in col_implied_bounds() 321 if (U == +DBL_MAX || f->f_min == -DBL_MAX) in col_implied_bounds() 346 *ll = -DBL_MAX, *uu = +DBL_MAX; else in col_implied_bounds() 349 { *ll = (ilb == -DBL_MAX ? -DBL_MAX : ilb / a[k]); in col_implied_bounds() 350 *uu = (iub == +DBL_MAX ? +DBL_MAX : iub / a[k]); in col_implied_bounds() 353 { *ll = (iub == +DBL_MAX ? -DBL_MAX : iub / a[k]); in col_implied_bounds() 354 *uu = (ilb == -DBL_MAX ? +DBL_MAX : ilb / a[k]); in col_implied_bounds() 504 if (!(lj == -DBL_MAX || uj == +DBL_MAX)) in check_col_bounds() 750 L[0] = -DBL_MAX, U[0] = +DBL_MAX; in ios_preprocess_node() 791 { if (L[i] == -DBL_MAX && U[i] == +DBL_MAX) in ios_preprocess_node() [all …]
|
/dports/math/glpk/glpk-5.0/src/draft/ |
H A D | glpios02.c | 302 if (L == -DBL_MAX || f->f_max == +DBL_MAX) in col_implied_bounds() 321 if (U == +DBL_MAX || f->f_min == -DBL_MAX) in col_implied_bounds() 346 *ll = -DBL_MAX, *uu = +DBL_MAX; else in col_implied_bounds() 349 { *ll = (ilb == -DBL_MAX ? -DBL_MAX : ilb / a[k]); in col_implied_bounds() 350 *uu = (iub == +DBL_MAX ? +DBL_MAX : iub / a[k]); in col_implied_bounds() 353 { *ll = (iub == +DBL_MAX ? -DBL_MAX : iub / a[k]); in col_implied_bounds() 354 *uu = (ilb == -DBL_MAX ? +DBL_MAX : ilb / a[k]); in col_implied_bounds() 504 if (!(lj == -DBL_MAX || uj == +DBL_MAX)) in check_col_bounds() 750 L[0] = -DBL_MAX, U[0] = +DBL_MAX; in ios_preprocess_node() 791 { if (L[i] == -DBL_MAX && U[i] == +DBL_MAX) in ios_preprocess_node() [all …]
|
/dports/audio/praat/praat-6.2.03/external/glpk/ |
H A D | glpios02.c | 304 if (L == -DBL_MAX || f->f_max == +DBL_MAX) 323 if (U == +DBL_MAX || f->f_min == -DBL_MAX) 348 *ll = -DBL_MAX, *uu = +DBL_MAX; else 351 { *ll = (ilb == -DBL_MAX ? -DBL_MAX : ilb / a[k]); 352 *uu = (iub == +DBL_MAX ? +DBL_MAX : iub / a[k]); 355 { *ll = (iub == +DBL_MAX ? -DBL_MAX : iub / a[k]); 356 *uu = (ilb == -DBL_MAX ? +DBL_MAX : ilb / a[k]); 506 if (!(lj == -DBL_MAX || uj == +DBL_MAX)) 752 L[0] = -DBL_MAX, U[0] = +DBL_MAX; 793 { if (L[i] == -DBL_MAX && U[i] == +DBL_MAX) [all …]
|
H A D | glpnpp03.c | 85 p->lb = -DBL_MAX, p->ub = +DBL_MAX; in npp_empty_row() 199 if (q->lb == -DBL_MAX && q->ub == +DBL_MAX) in npp_empty_col() 893 xassert(p->lb != -DBL_MAX || p->ub != +DBL_MAX); in npp_ineq_singlet() 932 { p->lb = -DBL_MAX, p->ub = +DBL_MAX; in npp_ineq_singlet() 1047 if (info->lb != -DBL_MAX && info->ub == +DBL_MAX) in rcv_ineq_singlet() 1501 xassert(p->lb != -DBL_MAX || p->ub != +DBL_MAX); in npp_implied_free() 1547 l = (alfa == -DBL_MAX ? -DBL_MAX : alfa / apq->val); in npp_implied_free() 1549 l = (beta == +DBL_MAX ? -DBL_MAX : beta / apq->val); in npp_implied_free() 1552 u = (beta == +DBL_MAX ? +DBL_MAX : beta / apq->val); in npp_implied_free() 1566 q->lb = -DBL_MAX, q->ub = +DBL_MAX; in npp_implied_free() [all …]
|
/dports/devel/vstr/vstr-1.0.15/tst/fmt/ |
H A D | tst_fmt_double.c | 40 -DBL_MAX, DBL_MAX); in tst() 42 -DBL_MAX, DBL_MAX); in tst() 48 -DBL_MAX, DBL_MAX, -DBL_MAX, DBL_MAX, in tst() 49 -DBL_MAX, DBL_MAX, -DBL_MAX, DBL_MAX); in tst() 51 -DBL_MAX, DBL_MAX, -DBL_MAX, DBL_MAX, in tst() 52 -DBL_MAX, DBL_MAX, -DBL_MAX, DBL_MAX); in tst() 58 -DBL_MAX, DBL_MAX, -DBL_MAX, DBL_MAX); in tst() 60 -DBL_MAX, DBL_MAX, -DBL_MAX, DBL_MAX); in tst()
|
/dports/math/igraph/igraph-0.9.5/vendor/glpk/npp/ |
H A D | npp3.c | 83 p->lb = -DBL_MAX, p->ub = +DBL_MAX; in npp_empty_row() 197 if (q->lb == -DBL_MAX && q->ub == +DBL_MAX) in npp_empty_col() 891 xassert(p->lb != -DBL_MAX || p->ub != +DBL_MAX); in npp_ineq_singlet() 930 { p->lb = -DBL_MAX, p->ub = +DBL_MAX; in npp_ineq_singlet() 1045 if (info->lb != -DBL_MAX && info->ub == +DBL_MAX) in rcv_ineq_singlet() 1499 xassert(p->lb != -DBL_MAX || p->ub != +DBL_MAX); in npp_implied_free() 1545 l = (alfa == -DBL_MAX ? -DBL_MAX : alfa / apq->val); in npp_implied_free() 1547 l = (beta == +DBL_MAX ? -DBL_MAX : beta / apq->val); in npp_implied_free() 1550 u = (beta == +DBL_MAX ? +DBL_MAX : beta / apq->val); in npp_implied_free() 1564 q->lb = -DBL_MAX, q->ub = +DBL_MAX; in npp_implied_free() [all …]
|
/dports/math/glpk/glpk-5.0/src/npp/ |
H A D | npp3.c | 83 p->lb = -DBL_MAX, p->ub = +DBL_MAX; in npp_empty_row() 197 if (q->lb == -DBL_MAX && q->ub == +DBL_MAX) in npp_empty_col() 891 xassert(p->lb != -DBL_MAX || p->ub != +DBL_MAX); in npp_ineq_singlet() 930 { p->lb = -DBL_MAX, p->ub = +DBL_MAX; in npp_ineq_singlet() 1045 if (info->lb != -DBL_MAX && info->ub == +DBL_MAX) in rcv_ineq_singlet() 1499 xassert(p->lb != -DBL_MAX || p->ub != +DBL_MAX); in npp_implied_free() 1545 l = (alfa == -DBL_MAX ? -DBL_MAX : alfa / apq->val); in npp_implied_free() 1547 l = (beta == +DBL_MAX ? -DBL_MAX : beta / apq->val); in npp_implied_free() 1550 u = (beta == +DBL_MAX ? +DBL_MAX : beta / apq->val); in npp_implied_free() 1564 q->lb = -DBL_MAX, q->ub = +DBL_MAX; in npp_implied_free() [all …]
|
/dports/cad/gmsh/gmsh-4.9.2-source/Geo/ |
H A D | SBoundingBox3d.h | 27 : MinPt(DBL_MAX, DBL_MAX, DBL_MAX), MaxPt(-DBL_MAX, -DBL_MAX, -DBL_MAX) in SBoundingBox3d() 38 if(MinPt.x() == DBL_MAX || MinPt.y() == DBL_MAX || MinPt.z() == DBL_MAX || in empty() 39 MaxPt.x() == -DBL_MAX || MaxPt.y() == -DBL_MAX || MaxPt.z() == -DBL_MAX) in empty() 45 MinPt = SPoint3(DBL_MAX, DBL_MAX, DBL_MAX); in reset() 46 MaxPt = SPoint3(-DBL_MAX, -DBL_MAX, -DBL_MAX); in reset()
|
/dports/graphics/openfx-misc/openfx-misc-3ab0531/CheckerBoard/ |
H A D | CheckerBoard.cpp | 605 param->setRange(1, 1, DBL_MAX, DBL_MAX); in describeInContext() 622 param->setRange(-DBL_MAX, -DBL_MAX, -DBL_MAX, -DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX); in describeInContext() 636 param->setRange(-DBL_MAX, -DBL_MAX, -DBL_MAX, -DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX); in describeInContext() 650 param->setRange(-DBL_MAX, -DBL_MAX, -DBL_MAX, -DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX); in describeInContext() 664 param->setRange(-DBL_MAX, -DBL_MAX, -DBL_MAX, -DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX); in describeInContext() 679 param->setRange(-DBL_MAX, -DBL_MAX, -DBL_MAX, -DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX); in describeInContext() 693 param->setRange(0., DBL_MAX); in describeInContext() 708 param->setRange(-DBL_MAX, -DBL_MAX, -DBL_MAX, -DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX, DBL_MAX); in describeInContext() 722 param->setRange(0., DBL_MAX); in describeInContext()
|
/dports/graphics/alembic/alembic-1.8.3/lib/Alembic/Abc/ |
H A D | ArchiveInfo.cpp | 89 double startTime = DBL_MAX; in GetArchiveStartAndEndTime() 90 double endTime = -DBL_MAX; in GetArchiveStartAndEndTime() 92 double startSingleTime = DBL_MAX; in GetArchiveStartAndEndTime() 93 double endSingleTime = -DBL_MAX; in GetArchiveStartAndEndTime() 95 double startDefaultTime = DBL_MAX; in GetArchiveStartAndEndTime() 96 double endDefaultTime = -DBL_MAX; in GetArchiveStartAndEndTime() 133 if ( startTime != DBL_MAX && endTime != -DBL_MAX ) in GetArchiveStartAndEndTime() 140 else if ( startSingleTime != DBL_MAX && endSingleTime != -DBL_MAX ) in GetArchiveStartAndEndTime() 147 else if ( startDefaultTime != DBL_MAX && endDefaultTime != -DBL_MAX ) in GetArchiveStartAndEndTime() 154 oStartTime = DBL_MAX; in GetArchiveStartAndEndTime() [all …]
|
/dports/cad/PrusaSlicer/PrusaSlicer-version_2.3.3/src/slic3r/GUI/ |
H A D | GUI_ObjectManipulation.hpp | 69 position = position_rounded = Vec3d(DBL_MAX, DBL_MAX, DBL_MAX); in reset() 70 rotation = rotation_rounded = Vec3d(DBL_MAX, DBL_MAX, DBL_MAX); in reset() 71 scale = scale_rounded = Vec3d(DBL_MAX, DBL_MAX, DBL_MAX); in reset() 72 size = size_rounded = Vec3d(DBL_MAX, DBL_MAX, DBL_MAX); in reset() 77 bool is_valid() const { return position != Vec3d(DBL_MAX, DBL_MAX, DBL_MAX); } in is_valid()
|
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/src/moab/ |
H A D | BoundBox.hpp | 13 BoundBox() : bMin(DBL_MAX), bMax(-DBL_MAX) {} in BoundBox() 18 BoundBox(std::vector<CartVect> points): bMin(DBL_MAX), bMax(-DBL_MAX) in BoundBox() 186 if (DBL_MAX == bMax[0] || DBL_MAX == bMax[1] || DBL_MAX == bMax[2] || in diagonal_length() 187 DBL_MAX == bMin[0] || DBL_MAX == bMin[1] || DBL_MAX == bMin[2]) return DBL_MAX; in diagonal_length() 193 if (DBL_MAX == bMax[0] || DBL_MAX == bMax[1] || DBL_MAX == bMax[2] || in diagonal_squared() 194 DBL_MAX == bMin[0] || DBL_MAX == bMin[1] || DBL_MAX == bMin[2]) return DBL_MAX; in diagonal_squared()
|
/dports/devel/icu/icu/source/test/intltest/ |
H A D | tsputil.cpp | 143 maxMinTest(pinf, DBL_MAX, pinf, TRUE); in testMaxMin() 149 maxMinTest(pinf, DBL_MAX, DBL_MAX, FALSE); in testMaxMin() 150 maxMinTest(pinf, -DBL_MAX, -DBL_MAX, FALSE); in testMaxMin() 153 maxMinTest(ninf, DBL_MAX, DBL_MAX, TRUE); in testMaxMin() 154 maxMinTest(ninf, -DBL_MAX, -DBL_MAX, TRUE); in testMaxMin() 163 maxMinTest(pzero, DBL_MAX, DBL_MAX, TRUE); in testMaxMin() 170 maxMinTest(pzero, -DBL_MAX, -DBL_MAX, FALSE); in testMaxMin() 173 maxMinTest(nzero, DBL_MAX, DBL_MAX, TRUE); in testMaxMin() 180 maxMinTest(nzero, -DBL_MAX, -DBL_MAX, FALSE); in testMaxMin() 259 if((pinf > DBL_MAX) != TRUE) { in testPositiveInfinity() [all …]
|
/dports/devel/icu-lx/icu/source/test/intltest/ |
H A D | tsputil.cpp | 143 maxMinTest(pinf, DBL_MAX, pinf, TRUE); in testMaxMin() 149 maxMinTest(pinf, DBL_MAX, DBL_MAX, FALSE); in testMaxMin() 150 maxMinTest(pinf, -DBL_MAX, -DBL_MAX, FALSE); in testMaxMin() 153 maxMinTest(ninf, DBL_MAX, DBL_MAX, TRUE); in testMaxMin() 154 maxMinTest(ninf, -DBL_MAX, -DBL_MAX, TRUE); in testMaxMin() 163 maxMinTest(pzero, DBL_MAX, DBL_MAX, TRUE); in testMaxMin() 170 maxMinTest(pzero, -DBL_MAX, -DBL_MAX, FALSE); in testMaxMin() 173 maxMinTest(nzero, DBL_MAX, DBL_MAX, TRUE); in testMaxMin() 180 maxMinTest(nzero, -DBL_MAX, -DBL_MAX, FALSE); in testMaxMin() 259 if((pinf > DBL_MAX) != TRUE) { in testPositiveInfinity() [all …]
|
/dports/math/igraph/igraph-0.9.5/vendor/glpk/simplex/ |
H A D | spxchuzr.c | 112 if (l[k] == -DBL_MAX || u[k] == +DBL_MAX) in spx_chuzr_std() 141 if (lk == -DBL_MAX) in spx_chuzr_std() 168 if (uk == +DBL_MAX) in spx_chuzr_std() 230 teta_min = DBL_MAX; in spx_chuzr_harris() 251 if (lk == -DBL_MAX) in spx_chuzr_harris() 277 if (uk == +DBL_MAX) in spx_chuzr_harris() 300 if (l[k] != -DBL_MAX && u[k] != +DBL_MAX) in spx_chuzr_harris() 308 if (teta_min == DBL_MAX) in spx_chuzr_harris() 336 if (lk == -DBL_MAX) in spx_chuzr_harris() 359 if (uk == +DBL_MAX) in spx_chuzr_harris() [all …]
|
H A D | spychuzc.c | 178 teta_min = DBL_MAX; in spy_chuzc_harris() 211 if (teta_min == DBL_MAX) in spy_chuzc_harris() 340 if (l[k] == -DBL_MAX || u[k] == +DBL_MAX) 356 if (l[k] != -DBL_MAX && u[k] != +DBL_MAX 390 xassert(-DBL_MAX < l[k] && l[k] < u[k] && u[k] < +DBL_MAX); 538 if (*slope == -DBL_MAX) in spy_ls_select_bp() 539 dz = -DBL_MAX; in spy_ls_select_bp() 545 if (dz == -DBL_MAX) in spy_ls_select_bp() 546 bp[t].dz = -DBL_MAX; in spy_ls_select_bp() 551 if (*slope != -DBL_MAX) in spy_ls_select_bp() [all …]
|
/dports/math/glpk/glpk-5.0/src/simplex/ |
H A D | spxchuzr.c | 112 if (l[k] == -DBL_MAX || u[k] == +DBL_MAX) in spx_chuzr_std() 141 if (lk == -DBL_MAX) in spx_chuzr_std() 168 if (uk == +DBL_MAX) in spx_chuzr_std() 230 teta_min = DBL_MAX; in spx_chuzr_harris() 251 if (lk == -DBL_MAX) in spx_chuzr_harris() 277 if (uk == +DBL_MAX) in spx_chuzr_harris() 300 if (l[k] != -DBL_MAX && u[k] != +DBL_MAX) in spx_chuzr_harris() 308 if (teta_min == DBL_MAX) in spx_chuzr_harris() 336 if (lk == -DBL_MAX) in spx_chuzr_harris() 359 if (uk == +DBL_MAX) in spx_chuzr_harris() [all …]
|
H A D | spychuzc.c | 178 teta_min = DBL_MAX; in spy_chuzc_harris() 211 if (teta_min == DBL_MAX) in spy_chuzc_harris() 340 if (l[k] == -DBL_MAX || u[k] == +DBL_MAX) 356 if (l[k] != -DBL_MAX && u[k] != +DBL_MAX 390 xassert(-DBL_MAX < l[k] && l[k] < u[k] && u[k] < +DBL_MAX); 538 if (*slope == -DBL_MAX) in spy_ls_select_bp() 539 dz = -DBL_MAX; in spy_ls_select_bp() 545 if (dz == -DBL_MAX) in spy_ls_select_bp() 546 bp[t].dz = -DBL_MAX; in spy_ls_select_bp() 551 if (*slope != -DBL_MAX) in spy_ls_select_bp() [all …]
|
/dports/math/igraph/igraph-0.9.5/vendor/glpk/api/ |
H A D | prrngs.c | 29 if (x == -DBL_MAX) in format() 31 else if (x == +DBL_MAX) in format() 175 coef1 = -DBL_MAX, coef2 = +DBL_MAX; in glp_print_ranges() 183 obj1 = +DBL_MAX; in glp_print_ranges() 185 obj1 = -DBL_MAX; in glp_print_ranges() 193 obj2 = -DBL_MAX; in glp_print_ranges() 195 obj2 = +DBL_MAX; in glp_print_ranges() 205 if (coef1 == -DBL_MAX) in glp_print_ranges() 207 obj1 = +DBL_MAX; in glp_print_ranges() 209 obj1 = -DBL_MAX; in glp_print_ranges() [all …]
|
/dports/math/glpk/glpk-5.0/src/api/ |
H A D | prrngs.c | 29 if (x == -DBL_MAX) in format() 31 else if (x == +DBL_MAX) in format() 175 coef1 = -DBL_MAX, coef2 = +DBL_MAX; in glp_print_ranges() 183 obj1 = +DBL_MAX; in glp_print_ranges() 185 obj1 = -DBL_MAX; in glp_print_ranges() 193 obj2 = -DBL_MAX; in glp_print_ranges() 195 obj2 = +DBL_MAX; in glp_print_ranges() 205 if (coef1 == -DBL_MAX) in glp_print_ranges() 207 obj1 = +DBL_MAX; in glp_print_ranges() 209 obj1 = -DBL_MAX; in glp_print_ranges() [all …]
|
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/neighbor_search/sort_policies/ |
H A D | furthest_neighbor_sort.hpp | 138 static inline double BestDistance() { return DBL_MAX; } in BestDistance() 145 if (a == DBL_MAX || b == DBL_MAX) in CombineBest() 146 return DBL_MAX; in CombineBest() 168 if (value == DBL_MAX || epsilon >= 1) in Relax() 169 return DBL_MAX; in Relax() 180 if (distance == DBL_MAX) in ConvertToScore() 183 return DBL_MAX; in ConvertToScore()
|
/dports/math/mlpack/mlpack-3.4.2/src/mlpack/methods/emst/ |
H A D | dtb_rules_impl.hpp | 89 return DBL_MAX; in Score() 97 ? DBL_MAX : distance; in Score() 108 ? DBL_MAX : oldScore; in Rescore() 120 return DBL_MAX; in Score() 128 return (bound < distance) ? DBL_MAX : distance; in Score() 137 return (oldScore > bound) ? DBL_MAX : oldScore; in Rescore() 146 double worstPointBound = -DBL_MAX; in CalculateBound() 147 double bestPointBound = DBL_MAX; in CalculateBound() 149 double worstChildBound = -DBL_MAX; in CalculateBound() 150 double bestChildBound = DBL_MAX; in CalculateBound() [all …]
|