/dports/biology/hhsuite/hh-suite-3.3.0/src/ |
H A D | hhhmm.h | 32 int ncons; // index of consensus sequence variable
|
H A D | hhhit.h | 78 int ncons; // index of consensus sequence variable
|
/dports/math/optpp/optpp-2.4/src/Constraints/ |
H A D | CompoundConstraint.C | 295 int i, j, ncons; in computeFeasibleInequalities() local 333 int i, j, index, ncons, nvars; in printConstraints() local
|
/dports/math/maxima/maxima-5.43.2/src/ |
H A D | clmacs.lisp | 259 (defmacro ncons (x) macro
|
/dports/biology/clustal-omega/clustal-omega-1.2.4/src/hhalign/ |
H A D | hhhmm.h | 35 int ncons; // index of consensus sequence variable
|
H A D | hhhit.h | 75 int ncons; // index of consensus sequence variable
|
/dports/devel/folly/folly-2021.12.27.00/folly/concurrency/test/ |
H A D | UnboundedQueueTest.cpp | 246 int ncons, in run_once() 299 void enq_deq_test(const int nprod, const int ncons) { in enq_deq_test() 441 uint64_t bench(const int nprod, const int ncons, const std::string& name) { in bench()
|
/dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/external/OPTPP/src/Constraints/ |
H A D | CompoundConstraint.C | 363 int i, j, ncons; in computeFeasibleInequalities() local 412 int i, j, index, ncons, nvars; in printConstraints() local
|
/dports/lang/yap/yap-6.2.2/C/ |
H A D | analyst.c | 294 int nxvar, nxval, nyvar, nyval, ncons, nlist, nstru, nmisc; member
|
/dports/math/cvc4/CVC4-1.7/src/theory/quantifiers/ |
H A D | sygus_sampler.cpp | 677 unsigned ncons = cindices.size(); in getSygusRandomValue() local 739 for (unsigned i = 0, ncons = dt.getNumConstructors(); i < ncons; i++) in registerSygusType() local
|
/dports/math/cvc4/CVC4-1.7/src/theory/quantifiers/sygus/ |
H A D | sygus_unif_strat.cpp | 227 for (unsigned j = 0, ncons = dt.getNumConstructors(); j < ncons; j++) in buildStrategyGraph() local 825 unsigned ncons = dt.getNumConstructors(), indexT = ncons, in staticLearnRedundantOps() local
|
H A D | sygus_repair_const.cpp | 83 for (unsigned i = 0, ncons = dt.getNumConstructors(); i < ncons; i++) in registerSygusType() local
|
H A D | ce_guided_single_inv_sol.cpp | 1410 for (unsigned i = 0, ncons = dt.getNumConstructors(); i < ncons; i++) in registerType() local 1514 for (unsigned i = index_start, ncons = dt.getNumConstructors(); i < ncons; in getMatch() local
|
H A D | sygus_enumerator.cpp | 193 for (unsigned i = 0, ncons = dt.getNumConstructors(); i < ncons; i++) in initialize() local
|
/dports/math/cvc4/CVC4-1.7/src/expr/ |
H A D | type_node.cpp | 200 for (unsigned i = 0, ncons = dt.getNumConstructors(); i < ncons; i++) in isClosedEnumerable() local
|
/dports/science/cp2k/cp2k-2e995eec7fd208c8a72d9544807bd8b8ba8cd1cc/src/ |
H A D | topology_input.F | 119 jg, msize, msize_old, n_rep, ncons, & local
|
/dports/science/xtb/xtb-6.4.1/src/gfnff/ |
H A D | shake_module.f90 | 21 integer :: ncons = 0 variable
|
/dports/science/cp2k-data/cp2k-7.1.0/src/ |
H A D | topology_input.F | 119 jg, msize, msize_old, n_rep, ncons, & local
|
/dports/math/cvc4/CVC4-1.7/src/theory/datatypes/ |
H A D | theory_datatypes.cpp | 1118 for (unsigned i = 0, ncons = dt.getNumConstructors(); i < ncons; i++) in addTester() local 1920 Node ncons = getEqcConstructor( c ); in separateBisimilar() local 2010 TNode ncons; in searchForCycle() local 2028 TNode ncons = getEqcConstructor( nn ); in searchForCycle() local
|
/dports/devel/apr1/apr-1.7.0/test/ |
H A D | testcond.c | 437 apr_uint32_t i, ncons = (apr_uint32_t)(NTHREADS * 0.70); in pipe_producer_consumer() local
|
/dports/graphics/opendx/dx-4.4.4/src/exec/dxmods/ |
H A D | _grid.c | 25 int ncons; member
|
/dports/math/reduce/Reduce-svn5758-src/csl/cslbase/ |
H A D | allocate.cpp | 335 LispObject ncons(LispObject a) in ncons() function
|
/dports/science/gromacs/gromacs-2021.4/src/gromacs/gmxana/ |
H A D | gmx_rms.cpp | 218 int ncons = 0; in gmx_rms() local
|
/dports/math/SCIP/scip-7.0.3/src/nlpi/ |
H A D | nlpi_filtersqp.c | 528 int ncons; in setupGradients() local 749 int ncons; in processSolveOutcome() local
|
/dports/math/cado-nfs/cado-nfs-f4284e2391121b2bfb97bc4880b6273c7250dc2f/utils/ |
H A D | filter_io.cpp | 1024 int ncons = 0; /* total number of consumers (levels >=1) */ in filter_rels2_inner() local 1168 int ncons = 0; /* total number of consumers (levels >=1) */ in filter_rels2() local
|