| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/packages/surfpack/src/surfaces/ |
| H A D | MarsModel.cpp | 107 max(3*n+5*max_bases+np,max(2*np,4*n)))+ in Create()
108 2*np+4*max_bases]; in Create()
109 double* dp = new double[2*(max(n*max_bases,(max_bases+1)*(max_bases+1))+ in Create()
110 max((max_bases+2)*(nmcv+3),4*max_bases))]; in Create()
120 memset( sp, 0, (2*(n*(max(max_bases+1,2)+3) + in Create()
121 max(3*n+5*max_bases+np,max(2*np,4*n))) + in Create()
122 2*np+4*max_bases) * sizeof(real) ); in Create()
123 memset( dp, 0, 2*(max(n*max_bases,(max_bases+1)*(max_bases+1))+ in Create()
124 max((max_bases+2)*(nmcv+3),4*max_bases))*sizeof(double) ); in Create()
169 max_interactions(2), max_bases(25) in MarsModelFactory()
[all …]
|
| H A D | MarsModel.h | 88 int max_bases; variable
|
| /dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
| H A D | ipa-modref-tree.h | 255 size_t max_bases; member
260 modref_tree (size_t max_bases, size_t max_refs, size_t max_accesses): in modref_tree()
262 max_bases (max_bases), in modref_tree()
288 if (bases && bases->length () >= max_bases)
440 other = modref_tree<T>::create_ggc (max_bases, max_refs, max_accesses); in merge()
516 static modref_tree<T> *create_ggc (size_t max_bases, size_t max_refs, in create_ggc()
520 modref_tree<T> (max_bases, max_refs, max_accesses); in create_ggc()
|
| /dports/lang/gcc11/gcc-11.2.0/gcc/ |
| H A D | ipa-modref-tree.h | 255 size_t max_bases; in ppc_supply_fpregset()
260 modref_tree (size_t max_bases, size_t max_refs, size_t max_accesses): in ppc_supply_fpregset()
262 max_bases (max_bases), in ppc_supply_fpregset()
288 if (bases && bases->length () >= max_bases) in ppc_supply_fpregset()
440 other = modref_tree<T>::create_ggc (max_bases, max_refs, max_accesses); in ppc_supply_fpregset()
516 static modref_tree<T> *create_ggc (size_t max_bases, size_t max_refs, in ppc_supply_fpregset()
520 modref_tree<T> (max_bases, max_refs, max_accesses); in ppc_supply_fpregset()
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
| H A D | ipa-modref-tree.h | 255 size_t max_bases; member
260 modref_tree (size_t max_bases, size_t max_refs, size_t max_accesses): in modref_tree()
262 max_bases (max_bases), in modref_tree()
288 if (bases && bases->length () >= max_bases)
440 other = modref_tree<T>::create_ggc (max_bases, max_refs, max_accesses); in merge()
516 static modref_tree<T> *create_ggc (size_t max_bases, size_t max_refs, in create_ggc()
520 modref_tree<T> (max_bases, max_refs, max_accesses); in create_ggc()
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
| H A D | ipa-modref-tree.h | 319 unsigned int max_bases,
336 if (base && bases && bases->length () >= max_bases)
366 bool insert (unsigned int max_bases, in insert()
415 = insert_base (base, ref, max_bases, &changed); in insert()
521 bool merge (unsigned int max_bases, in merge()
557 max_bases, &changed); in merge()
570 changed |= insert (max_bases, max_refs, max_accesses, in merge()
598 changed |= insert (max_bases, max_refs, max_accesses, in merge()
|
| /dports/biology/ugene/ugene-40.1/src/libs_3rdparty/samtools/src/samtools/ |
| H A D | cut_target.c | 20 int min_baseQ, tid, max_bases; member
33 if (n > g->max_bases) { // enlarge g->bases in gencns()
34 g->max_bases = n; in gencns()
35 kroundup32(g->max_bases); in gencns()
36 g->bases = realloc(g->bases, g->max_bases * 2); in gencns()
|
| H A D | bam2bcf.c | 51 if (bca->max_bases < _n) { in bcf_call_glfgen()
52 bca->max_bases = _n; in bcf_call_glfgen()
53 kroundup32(bca->max_bases); in bcf_call_glfgen()
54 bca->bases = (uint16_t*)realloc(bca->bases, 2 * bca->max_bases); in bcf_call_glfgen()
|
| H A D | bam2bcf.h | 17 int max_bases; member
|
| /dports/biology/stringtie/stringtie-2.1.1/samtools-0.1.18/ |
| H A D | cut_target.c | 20 int min_baseQ, tid, max_bases; member
33 if (n > g->max_bases) { // enlarge g->bases in gencns()
34 g->max_bases = n; in gencns()
35 kroundup32(g->max_bases); in gencns()
36 g->bases = realloc(g->bases, g->max_bases * 2); in gencns()
|
| /dports/biology/py-pysam/pysam-0.18.0/samtools/ |
| H A D | cut_target.c | 49 int min_baseQ, tid, max_bases; member
63 if (n > g->max_bases) { // enlarge g->bases in gencns()
64 g->max_bases = n; in gencns()
65 kroundup32(g->max_bases); in gencns()
66 g->bases = realloc(g->bases, (size_t) g->max_bases * 2); in gencns()
|
| H A D | cut_target.c.pysam.c | 51 int min_baseQ, tid, max_bases; member
65 if (n > g->max_bases) { // enlarge g->bases in gencns()
66 g->max_bases = n; in gencns()
67 kroundup32(g->max_bases); in gencns()
68 g->bases = realloc(g->bases, (size_t) g->max_bases * 2); in gencns()
|
| H A D | bam2bcf.h | 70 int max_bases; member
|
| H A D | bam2bcf.c | 164 if (bca->max_bases < _n) { in bcf_call_glfgen()
165 bca->max_bases = _n; in bcf_call_glfgen()
166 kroundup32(bca->max_bases); in bcf_call_glfgen()
167 bca->bases = (uint16_t*)realloc(bca->bases, 2 * bca->max_bases); in bcf_call_glfgen()
|
| H A D | bam2bcf.c.pysam.c | 166 if (bca->max_bases < _n) { in bcf_call_glfgen()
167 bca->max_bases = _n; in bcf_call_glfgen()
168 kroundup32(bca->max_bases); in bcf_call_glfgen()
169 bca->bases = (uint16_t*)realloc(bca->bases, 2 * bca->max_bases); in bcf_call_glfgen()
|
| /dports/biology/samtools/samtools-1.14/ |
| H A D | cut_target.c | 49 int min_baseQ, tid, max_bases; member
63 if (n > g->max_bases) { // enlarge g->bases in gencns()
64 g->max_bases = n; in gencns()
65 kroundup32(g->max_bases); in gencns()
66 g->bases = realloc(g->bases, (size_t) g->max_bases * 2); in gencns()
|
| H A D | bam2bcf.h | 70 int max_bases; member
|
| /dports/biology/seqan1/seqan-1.3.1/lib/samtools/ |
| H A D | bam2bcf.c | 47 if (bca->max_bases < _n) { in bcf_call_glfgen()
48 bca->max_bases = _n; in bcf_call_glfgen()
49 kroundup32(bca->max_bases); in bcf_call_glfgen()
50 bca->bases = (uint16_t*)realloc(bca->bases, 2 * bca->max_bases); in bcf_call_glfgen()
|
| H A D | bam2bcf.h | 14 int max_bases; member
|
| /dports/biology/bcftools/bcftools-1.14/ |
| H A D | bam2bcf.h | 93 int max_bases; member
|
| /dports/biology/bio-mocha/bcftools-1.14/ |
| H A D | bam2bcf.h | 93 int max_bases; member
|
| /dports/biology/py-pysam/pysam-0.18.0/bcftools/ |
| H A D | bam2bcf.h | 93 int max_bases; member
|
| /dports/science/dakota/dakota-6.13.0-release-public.src-UI/src/ |
| H A D | SurfpackApproximation.cpp | 249 short max_bases = problem_db.get_short("model.surrogate.mars_max_bases"); in SurfpackApproximation() local
250 if (max_bases > 0) { in SurfpackApproximation()
251 args["max_bases"] = toString<short>(max_bases); in SurfpackApproximation()
|
| /dports/biology/sra-tools/sra-tools-2.11.0/ncbi-vdb/libs/axf/ |
| H A D | refseq.c | 248 size_t const max_bases = ((last + 1) - first) * async->max_seq_len; in readNormalIncomplete() local
249 …uint8_t *const buffer = (max_bases <= len && start == rowToPosition(async, first)) ? dst : malloc(… in readNormalIncomplete()
|
| /dports/biology/ncbi-vdb/ncbi-vdb-2.11.0/libs/axf/ |
| H A D | refseq.c | 248 size_t const max_bases = ((last + 1) - first) * async->max_seq_len; in readNormalIncomplete() local
249 …uint8_t *const buffer = (max_bases <= len && start == rowToPosition(async, first)) ? dst : malloc(… in readNormalIncomplete()
|