Home
last modified time | relevance | path

Searched refs:idMax (Results 1 – 25 of 45) sorted by relevance

12

/dports/math/gecode/gecode-0916a1a/contribs/qecode/
H A Dmyspace.cc81 IntVarArgs MySpace::getIntVars(unsigned int idMax) { in getIntVars() argument
84 if (n<idMax) idMax=n; in getIntVars()
86 for (int i=0;i<idMax;i++) { in getIntVars()
91 for (i=0;i<idMax;i++) { in getIntVars()
101 BoolVarArgs MySpace::getBoolVars(unsigned int idMax) { in getBoolVars() argument
104 if (n<idMax) idMax=n; in getBoolVars()
106 for (int i=0;i<idMax;i++) { in getBoolVars()
111 for (i=0;i<idMax;i++) { in getBoolVars()
H A Dmyspace.hh69 QECODE_EXPORT IntVarArgs getIntVars(unsigned int idMax);
75 QECODE_EXPORT BoolVarArgs getBoolVars(unsigned int idMax);
/dports/biology/canu/canu-2.2/src/correction/
H A Dfalconsense.C273 uint32 idMax = UINT32_MAX; in main() local
326 decodeRange(argv[++arg], idMin, idMax); in main()
430 (seqStore->sqStore_lastReadID() < idMax)) // Limit the range of processing to the in main()
431 idMax = seqStore->sqStore_lastReadID(); // number of reads in the store. in main()
433 loadReadList(readListName, idMin, idMax, readList); // Further limit to a set of good reads. in main()
514 for (uint32 ii=idMin; ii<=idMax; ii++) { in main()
590 for (uint32 ii=idMin; ii<=idMax; ii++) { in main()
641 …fprintf(batFile, "%5u %9u %9u %7u %7.3f\n", batchNum, bgnID, idMax, nReads, memUsed / 1024.0 / 102… in main()
659 for (uint32 ii=idMin; ii<=idMax; ii++) { in main()
683 for (uint32 ii=idMin; ii<=idMax; ii++) { in main()
/dports/math/clasp/clasp-3.3.5/tests/
H A Ddependency_graph_test.cpp117 REQUIRE(bd.preds()[1]== idMax);
137 REQUIRE(body.preds()[1] == idMax);
139 REQUIRE(body.preds()[3] == idMax);
144 REQUIRE(a.succs()[0] == idMax);
147 REQUIRE(a.succs()[3] == idMax);
166 REQUIRE(body.preds()[2] == idMax);
169 REQUIRE(body.preds()[7] == idMax);
175 REQUIRE(a.succs()[0] == idMax);
178 REQUIRE(a.succs()[3] == idMax);
/dports/math/clingo/clingo-5.5.1/clasp/clasp-da10954/tests/
H A Ddependency_graph_test.cpp117 REQUIRE(bd.preds()[1]== idMax);
137 REQUIRE(body.preds()[1] == idMax);
139 REQUIRE(body.preds()[3] == idMax);
144 REQUIRE(a.succs()[0] == idMax);
147 REQUIRE(a.succs()[3] == idMax);
166 REQUIRE(body.preds()[2] == idMax);
169 REQUIRE(body.preds()[7] == idMax);
175 REQUIRE(a.succs()[0] == idMax);
178 REQUIRE(a.succs()[3] == idMax);
/dports/math/clingo/clingo-5.5.1/clasp/tests/
H A Ddependency_graph_test.cpp117 REQUIRE(bd.preds()[1]== idMax);
137 REQUIRE(body.preds()[1] == idMax);
139 REQUIRE(body.preds()[3] == idMax);
144 REQUIRE(a.succs()[0] == idMax);
147 REQUIRE(a.succs()[3] == idMax);
166 REQUIRE(body.preds()[2] == idMax);
169 REQUIRE(body.preds()[7] == idMax);
175 REQUIRE(a.succs()[0] == idMax);
178 REQUIRE(a.succs()[3] == idMax);
/dports/math/clingo/clingo-5.5.1/clasp/clasp/
H A Ddependency_graph.h166 for (; *s != idMax; ++s) { p(*s); } in visitSuccessors()
168 for (++s; *s != idMax; s += 2) { p(*s, *(s+1)); } in visitSuccessors()
224 for (const NodeId* x = preds(); *x != idMax; x += inc, ++idx) { in get_pred_idx()
227 return idMax; in get_pred_idx()
247 for (; *x != idMax; x += inc) { ++p; } in num_preds()
249 for (; *x != idMax; x += inc) { ++p; } in num_preds()
293 for (; *x != idMax; x += inc, ++i) { p(getAtom(*x).lit, i, false); } in visitBodyLiterals()
295 for (; *x != idMax; x += inc, ++i) { p(Literal::fromRep(*x), i, true); } in visitBodyLiterals()
/dports/math/clasp/clasp-3.3.5/clasp/
H A Ddependency_graph.h166 for (; *s != idMax; ++s) { p(*s); } in visitSuccessors()
168 for (++s; *s != idMax; s += 2) { p(*s, *(s+1)); } in visitSuccessors()
224 for (const NodeId* x = preds(); *x != idMax; x += inc, ++idx) { in get_pred_idx()
227 return idMax; in get_pred_idx()
247 for (; *x != idMax; x += inc) { ++p; } in num_preds()
249 for (; *x != idMax; x += inc) { ++p; } in num_preds()
293 for (; *x != idMax; x += inc, ++i) { p(getAtom(*x).lit, i, false); } in visitBodyLiterals()
295 for (; *x != idMax; x += inc, ++i) { p(Literal::fromRep(*x), i, true); } in visitBodyLiterals()
/dports/math/clingo/clingo-5.5.1/clasp/clasp-da10954/clasp/
H A Ddependency_graph.h166 for (; *s != idMax; ++s) { p(*s); } in visitSuccessors()
168 for (++s; *s != idMax; s += 2) { p(*s, *(s+1)); } in visitSuccessors()
224 for (const NodeId* x = preds(); *x != idMax; x += inc, ++idx) { in get_pred_idx()
227 return idMax; in get_pred_idx()
247 for (; *x != idMax; x += inc) { ++p; } in num_preds()
249 for (; *x != idMax; x += inc) { ++p; } in num_preds()
293 for (; *x != idMax; x += inc, ++i) { p(getAtom(*x).lit, i, false); } in visitBodyLiterals()
295 for (; *x != idMax; x += inc, ++i) { p(Literal::fromRep(*x), i, true); } in visitBodyLiterals()
/dports/biology/canu/canu-2.2/src/overlapBasedTrimming/
H A DtrimReads.C111 uint32 idMax = UINT32_MAX; in main() local
169 decodeRange(argv[++arg], idMin, idMax); in main()
243 if (idMax > seq->sqStore_lastReadID()) in main()
244 idMax = seq->sqStore_lastReadID(); in main()
248 idMax, in main()
252 for (uint32 id=idMin; id<=idMax; id++) { in main()
H A DsplitReads.C38 uint32 idMax = UINT32_MAX; in main() local
114 decodeRange(argv[++arg], idMin, idMax); in main()
202 if (idMax > seq->sqStore_lastReadID()) in main()
203 idMax = seq->sqStore_lastReadID(); in main()
207 idMax, in main()
211 for (uint32 id=idMin; id<=idMax; id++) { in main()
/dports/math/gismo/gismo-21.12.0/src/gsMSplines/
H A DgsWeightMapper.hpp41 const index_t idMax=mat.cols(); in getNonZeroInnerOfMatrix() local
45 curMin=idMax; in getNonZeroInnerOfMatrix()
63 if (curMin>=idMax) in getNonZeroInnerOfMatrix()
/dports/science/v_sim/v_sim-3.8.0/src/extraFunctions/
H A Dneighbours.c65 guint idMax; member
242 nei->priv->idMax = iter.idMax + 1; in _computeNeighbours()
244 nei->priv->keynei = g_realloc(nei->priv->keynei, sizeof(guint) * nei->priv->idMax * 2); in _computeNeighbours()
264 arr = g_malloc(sizeof(GArray*) * nei->priv->idMax); in _computeNeighbours()
347 iter->nodeId >= iter->nei->priv->idMax) in visu_node_neighbours_iter_next()
/dports/devel/upp/upp/uppsrc/ScatterDraw/
H A DDataSource.cpp69 int64 idMin, idMax; in MaxSubDataImp() local
79 for (idMax = maxId + 1; idMax < GetCount() && iw < width; idMax++) { in MaxSubDataImp()
80 if (IsNull(Membercall(getdataY)(idMax)) || IsNull(Membercall(getdataX)(idMax))) in MaxSubDataImp()
84 if (idMax >= GetCount()) in MaxSubDataImp()
85 idMax = GetCount() - 1; in MaxSubDataImp()
86 for (int64 i = idMin; i <= idMax; ++i) { in MaxSubDataImp()
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/constraints/geost/
H A DGeost.java491 int idMax = 0; in Geost() local
501 idMax = Math.max(o.no, idMax); in Geost()
521 objectConstraints = new Set[idMax + 1]; in Geost()
522 domainHolesConstraints = new DomainHoles[idMax + 1]; in Geost()
524 pruneIfGrounded = new boolean[idMax + 1]; in Geost()
535 fullyPruned = new boolean[idMax + 1]; in Geost()
/dports/math/g2o/g2o-20201223_git/g2o/examples/interactive_slam/g2o_interactive/
H A Dgenerate_commands.cpp178 int idMax = (max)(e->vertices()[0]->id(), e->vertices()[1]->id()); in main() local
179 if (maxInGraph < idMax && ! freshlyOptimized){ in main()
/dports/devel/upp/upp/bazaar/MathTools/
H A DDataHandling.cpp240 int idMax = (sep[0] == '.') ? 1 : 0; in GuessCsvSeparator() local
241 if (sepCount[idMax] > 0) in GuessCsvSeparator()
242 separator = sep[idMax]; in GuessCsvSeparator()
/dports/science/v_sim/v_sim-3.8.0/src/
H A Dgtk_move.c243 idmax = dataIter.idMax + 1; in visu_ui_interactive_move_initBuild()
981 iter.idMax + 1); in _setSpinRange()
983 gtk_spin_button_set_range(GTK_SPIN_BUTTON(spinABC[0]), 0, iter.idMax + 1); in _setSpinRange()
987 gtk_spin_button_set_range(GTK_SPIN_BUTTON(spinABC[1]), 0, iter.idMax + 1); in _setSpinRange()
991 gtk_spin_button_set_range(GTK_SPIN_BUTTON(spinABC[2]), 0, iter.idMax + 1); in _setSpinRange()
995 gtk_spin_button_set_range(GTK_SPIN_BUTTON(spinABC[3]), 0, iter.idMax + 1); in _setSpinRange()
/dports/biology/bbmap/bbmap/current/var2/
H A DVar.java218 idMax=Parse.parseInt(line, a, b); in Var()
407 v.idMax=idm; in fromVCF()
485 idMax=0; in clear()
527 idMax=Tools.max(idMax, b.idMax); in add()
576 idMax=Tools.max(idMax, id); in add()
1141 bb.append(idMax).tab(); in toText()
1366 bb.append("IDM=").append(idMax).append(';'); in toVCF()
1522 double idAvg=0.001f*(((identityAvg()+idMax))*0.5f); in identityScore()
2059 int idMax; field in Var
/dports/math/clasp/clasp-3.3.5/src/
H A Dunfounded_check.cpp514 for (; *x != idMax; x += inc, ++p) { in isValidSource()
522 for (++x; *x != idMax; x += inc, ++p) { in isValidSource()
535 for (const NodeId* x = n.node->preds(); *x != idMax; x += inc) { in addUnsourced()
645 for (const NodeId* x = n.node->preds(); *x != idMax && S >= 0; ++x) { in isExternal()
650 for (const NodeId* x = n.node->preds(); *x != idMax && S >= 0; x+=2) { in isExternal()
/dports/math/clingo/clingo-5.5.1/clasp/src/
H A Dunfounded_check.cpp514 for (; *x != idMax; x += inc, ++p) { in isValidSource()
522 for (++x; *x != idMax; x += inc, ++p) { in isValidSource()
535 for (const NodeId* x = n.node->preds(); *x != idMax; x += inc) { in addUnsourced()
647 for (const NodeId* x = n.node->preds(); *x != idMax && S >= 0; ++x) { in isExternal()
652 for (const NodeId* x = n.node->preds(); *x != idMax && S >= 0; x+=2) { in isExternal()
/dports/math/clingo/clingo-5.5.1/clasp/clasp-da10954/src/
H A Dunfounded_check.cpp514 for (; *x != idMax; x += inc, ++p) { in isValidSource()
522 for (++x; *x != idMax; x += inc, ++p) { in isValidSource()
535 for (const NodeId* x = n.node->preds(); *x != idMax; x += inc) { in addUnsourced()
647 for (const NodeId* x = n.node->preds(); *x != idMax && S >= 0; ++x) { in isExternal()
652 for (const NodeId* x = n.node->preds(); *x != idMax && S >= 0; x+=2) { in isExternal()
/dports/lang/ruby26/ruby-2.6.9/
H A Did.c69 REGISTER_SYMID(idMax, "max"); in Init_id()
/dports/security/snoopy/snoopy-2.4.14/tests/bin/
H A Dsnoopy-test-threads.c66 int randomNumberInclusive (int idMin, int idMax);
/dports/graphics/osg34/OpenSceneGraph-OpenSceneGraph-3.4.1/src/osgPlugins/txp/
H A Dtrpage_geom.cpp386 int idMax = 3*n+2; in GetVertex() local
387 if (id < 0 || (idMax >= (int)vertDataFloat.size() && idMax >= (int)vertDataDouble.size())) in GetVertex()

12