Home
last modified time | relevance | path

Searched refs:topf (Results 1 – 25 of 377) sorted by relevance

12345678910>>...16

/dports/biology/bowtie2/bowtie2-2.4.4/
H A Daligner_seed2.cpp287 nelt_ += (botf - topf); in reportAlignment()
336 topf_ = topf; in init()
629 TIndexOffU topf = pf[d].topf[j], botf = pf[d].botf[j]; in recalcOutgoing() local
685 TIndexOffU topf = pf[d].topf[j], botf = pf[d].botf[j]; in recalcOutgoing() local
766 TIndexOffU topf = pf[d].topf[j], botf = pf[d].botf[j]; in recalcOutgoing() local
1152 topf = topf_; in followBestOutgoing()
1164 topf = pf[d].topf[chr]; in followBestOutgoing()
1173 topf = pf[d].topf[chr]; in followBestOutgoing()
1180 assert_eq(topf, e.topf); in followBestOutgoing()
1496 pf[id].topf[l2r_ ? c_l2r : c_r2l] = topf; in followMatches()
[all …]
H A Daligner_cache.h282 SAVal() : topf(), topb(), i(), len(OFF_MASK) { } in SAVal()
306 topf = tf; in init()
312 TIndexOffU topf; // top in BWT member
335 key = k; topf = tf; topb = tb; offs = o; in init()
344 topf = (TIndexOffU)(src.topf + first); in init()
373 return topf < o.topf;
382 return topf > o.topf;
386 return key == o.key && topf == o.topf && topb == o.topb && offs == o.offs;
407 TIndexOffU topf; // top in BWT index variable
623 assert(b1.key != b2.key || b1.topf != b2.topf || b1.offs != b2.offs); in queryQvalImpl()
[all …]
H A Daligner_seed2.h409 topf = botf = 0; in reset()
422 topf = topf_; in init()
435 if(topf < o.topf) return true;
436 if(topf > o.topf) return false;
521 TIndexOffU topf, in check() argument
560 TIndexOffU topf, in contains() argument
837 topf[0] = topf[1] = topf[2] = topf[3] = 0; in reset()
934 topf = topf_; in init()
1409 topf = botf = 0; in reset()
1429 topf = topf_; in init()
[all …]
H A Daligner_cache.cpp58 TIndexOffU topf, // top range elt in BWT index in addOnTheFlyImpl() argument
69 qv.addRange(botf-topf); // update tally for # ranges and # elts in addOnTheFlyImpl()
88 s->payload.len = botf - topf; in addOnTheFlyImpl()
89 s->payload.topf = topf; in addOnTheFlyImpl()
91 for(size_t j = 0; j < (botf-topf); j++) { in addOnTheFlyImpl()
109 TIndexOffU topf, // top range elt in BWT index in addOnTheFly() argument
117 return addOnTheFlyImpl(qv, sak, topf, botf, topb, botb); in addOnTheFly()
119 return addOnTheFlyImpl(qv, sak, topf, botf, topb, botb); in addOnTheFly()
/dports/biology/hisat2/hisat2-2.2.1/
H A Daligner_seed2.h422 topf = topf_; in init()
435 if(topf < o.topf) return true;
436 if(topf > o.topf) return false;
797 topf[0] = topf[1] = topf[2] = topf[3] = 0; in reset()
894 topf = topf_; in init()
1387 topf = topf_; in init()
3648 topf = pf[d].topf[chr]; in followBestOutgoing()
3657 topf = pf[d].topf[chr]; in followBestOutgoing()
3664 assert_eq(topf, e.topf); in followBestOutgoing()
3982 pf[id].topf[l2r_ ? c_l2r : c_r2l] = topf; in followMatches()
[all …]
H A Daligner_cache.h309 topf = tf; in init()
315 index_t topf; // top in BWT member
348 topf = (index_t)(src.topf + first); in init()
377 return topf < o.topf;
386 return topf > o.topf;
390 return key == o.key && topf == o.topf && topb == o.topb && offs == o.offs;
411 index_t topf; // top in BWT index variable
497 assert(b1.key != b2.key || b1.topf != b2.topf || b1.offs != b2.offs);
850 eltsn_ += (botf-topf);
995 s->payload.len = botf - topf; in addOnTheFly()
[all …]
H A Daligner_seed2.cpp416 last_topf = dr.sink()[0].topf; in main()
491 last_topf = dr.sink()[0].topf; in main()
642 cerr << dr.sink()[0].topf << ", " << dr.sink()[0].botf << endl; in main()
644 last_topf = dr.sink()[0].topf; in main()
727 last_topf = dr.sink()[0].topf; in main()
809 last_topf = dr.sink()[0].topf; in main()
880 last_topf = dr.sink()[0].topf; in main()
957 last_topf = dr.sink()[0].topf; in main()
1032 last_topf = dr.sink()[0].topf; in main()
1150 last_topf = dr.sink()[0].topf; in main()
[all …]
/dports/math/py-brial/BRiAl-1.2.10/cudd/
H A DcuddAddIte.c189 topf = cuddI(dd,f->index); in cuddAddScalarInverseRecur()
206 if (topf <= v) { in cuddAddScalarInverseRecur()
263 unsigned int topf,topg;
283 topf = cuddI(dd,f->index);
293 if (topf <= topg) {
298 if (topg <= topf) {
399 topf = cuddI(dd,f->index);
401 if (topf <= topg) {
406 if (topg <= topf) {
475 topf = cuddI(dd,f->index);
[all …]
H A DcuddBddIte.c261 if (topf <= v) { in Cudd_bddIteConstant()
694 if (topf <= topg) { in Cudd_bddLeq()
703 if (topg <= topf) { in Cudd_bddLeq()
816 if (topf <= v) { in cuddBddIteRecur()
914 if (topf <= topg) { in cuddBddIntersectRecur()
927 if (topg <= topf) { in cuddBddIntersectRecur()
1045 if (topf <= topg) { in cuddBddAndRecur()
1058 if (topg <= topf) { in cuddBddAndRecur()
1306 if ((topf > toph) || (topf == toph && f > h)) { in bddVarToCanonical()
1317 if ((topf > topg) || (topf == topg && f > g)) { in bddVarToCanonical()
[all …]
H A DcuddLiteral.c159 unsigned int topf, topg, comple; in cuddBddLiteralSetIntersectionRecur() local
176 topf = cuddI(dd,F->index); in cuddBddLiteralSetIntersectionRecur()
181 while (topf != topg) { in cuddBddLiteralSetIntersectionRecur()
182 if (topf < topg) { /* move down on f */ in cuddBddLiteralSetIntersectionRecur()
191 topf = cuddI(dd,F->index); in cuddBddLiteralSetIntersectionRecur()
192 } else if (topg < topf) { in cuddBddLiteralSetIntersectionRecur()
/dports/math/cudd/cudd-3.0.0/cudd/
H A DcuddAddIte.c148 int topf,topg,toph,v; in Cudd_addIteConstant() local
170 topf = cuddI(dd,f->index); in Cudd_addIteConstant()
187 if (topf <= v) { in Cudd_addIteConstant()
244 int topf,topg; in Cudd_addEvalConst() local
274 if (topf <= topg) { in Cudd_addEvalConst()
279 if (topg <= topf) { in Cudd_addEvalConst()
362 int topf, topg, res; in Cudd_addLeq() local
385 if (topf <= topg) { in Cudd_addLeq()
390 if (topg <= topf) { in Cudd_addLeq()
431 int topf,topg,toph,v; in cuddAddIteRecur() local
[all …]
H A DcuddBddIte.c226 if (topf <= v) { in Cudd_bddIteConstant()
671 if (topf <= topg) { in Cudd_bddLeq()
680 if (topg <= topf) { in Cudd_bddLeq()
793 if (topf <= v) { in cuddBddIteRecur()
863 int topf, topg; in cuddBddIntersectRecur() local
890 if (topf <= topg) { in cuddBddIntersectRecur()
977 int topf, topg; in cuddBddAndRecur() local
1107 int topf, topg; in cuddBddXorRecur() local
1284 if ((topf > toph) || (topf == toph && f > h)) { in bddVarToCanonical()
1295 if ((topf > topg) || (topf == topg && f > g)) { in bddVarToCanonical()
[all …]
H A DcuddLiteral.c148 int topf, topg, comple; in cuddBddLiteralSetIntersectionRecur() local
165 topf = cuddI(dd,F->index); in cuddBddLiteralSetIntersectionRecur()
170 while (topf != topg) { in cuddBddLiteralSetIntersectionRecur()
171 if (topf < topg) { /* move down on f */ in cuddBddLiteralSetIntersectionRecur()
180 topf = cuddI(dd,F->index); in cuddBddLiteralSetIntersectionRecur()
181 } else if (topg < topf) { in cuddBddLiteralSetIntersectionRecur()
/dports/math/brial/BRiAl-1.2.10/cudd/
H A DcuddAddIte.c189 topf = cuddI(dd,f->index); in Cudd_addIteConstant()
206 if (topf <= v) { in Cudd_addIteConstant()
263 unsigned int topf,topg; in Cudd_addEvalConst() local
283 topf = cuddI(dd,f->index); in Cudd_addEvalConst()
293 if (topf <= topg) { in Cudd_addEvalConst()
298 if (topg <= topf) { in Cudd_addEvalConst()
399 topf = cuddI(dd,f->index); in Cudd_addLeq()
401 if (topf <= topg) { in Cudd_addLeq()
406 if (topg <= topf) { in Cudd_addLeq()
475 topf = cuddI(dd,f->index); in cuddAddIteRecur()
[all …]
H A DcuddBddIte.c261 if (topf <= v) { in Cudd_bddIteConstant()
694 if (topf <= topg) { in Cudd_bddLeq()
703 if (topg <= topf) { in Cudd_bddLeq()
816 if (topf <= v) { in cuddBddIteRecur()
914 if (topf <= topg) { in cuddBddIntersectRecur()
927 if (topg <= topf) { in cuddBddIntersectRecur()
1045 if (topf <= topg) { in cuddBddAndRecur()
1058 if (topg <= topf) { in cuddBddAndRecur()
1306 if ((topf > toph) || (topf == toph && f > h)) { in bddVarToCanonical()
1317 if ((topf > topg) || (topf == topg && f > g)) { in bddVarToCanonical()
[all …]
H A DcuddLiteral.c159 unsigned int topf, topg, comple; in cuddBddLiteralSetIntersectionRecur() local
176 topf = cuddI(dd,F->index); in cuddBddLiteralSetIntersectionRecur()
181 while (topf != topg) { in cuddBddLiteralSetIntersectionRecur()
182 if (topf < topg) { /* move down on f */ in cuddBddLiteralSetIntersectionRecur()
191 topf = cuddI(dd,F->index); in cuddBddLiteralSetIntersectionRecur()
192 } else if (topg < topf) { in cuddBddLiteralSetIntersectionRecur()
/dports/cad/abc/abc-a4518e6f833885c905964f1233d11e5b941ec24c/src/bdd/cudd/
H A DcuddAddIte.c193 topf = cuddI(dd,f->index); in Cudd_addIteConstant()
210 if (topf <= v) { in Cudd_addIteConstant()
267 unsigned int topf,topg; in Cudd_addEvalConst() local
287 topf = cuddI(dd,f->index); in Cudd_addEvalConst()
297 if (topf <= topg) { in Cudd_addEvalConst()
302 if (topg <= topf) { in Cudd_addEvalConst()
403 topf = cuddI(dd,f->index); in Cudd_addLeq()
405 if (topf <= topg) { in Cudd_addLeq()
410 if (topg <= topf) { in Cudd_addLeq()
479 topf = cuddI(dd,f->index); in cuddAddIteRecur()
[all …]
H A DcuddBddIte.c225 if (topf <= v) { in Cudd_bddIteConstant()
585 if (topf <= topg) { in Cudd_bddLeq()
594 if (topg <= topf) { in Cudd_bddLeq()
707 if (topf <= v) { in cuddBddIteRecur()
805 if (topf <= topg) { in cuddBddIntersectRecur()
818 if (topg <= topf) { in cuddBddIntersectRecur()
939 if (topf <= topg) { in cuddBddAndRecur()
952 if (topg <= topf) { in cuddBddAndRecur()
1200 if ((topf > toph) || (topf == toph && cuddF2L(f) > cuddF2L(h))) { in bddVarToCanonical()
1211 if ((topf > topg) || (topf == topg && cuddF2L(f) > cuddF2L(g))) { in bddVarToCanonical()
[all …]
H A DcuddLiteral.c163 unsigned int topf, topg, comple; in cuddBddLiteralSetIntersectionRecur() local
180 topf = cuddI(dd,F->index); in cuddBddLiteralSetIntersectionRecur()
185 while (topf != topg) { in cuddBddLiteralSetIntersectionRecur()
186 if (topf < topg) { /* move down on f */ in cuddBddLiteralSetIntersectionRecur()
195 topf = cuddI(dd,F->index); in cuddBddLiteralSetIntersectionRecur()
196 } else if (topg < topf) { in cuddBddLiteralSetIntersectionRecur()
/dports/graphics/blender/blender-2.91.0/source/blender/imbuf/intern/
H A Drotate.c65 float *topf = NULL, *bottomf = NULL, *linef = NULL; in IMB_flipy() local
70 topf = ibuf->rect_float; in IMB_flipy()
71 bottomf = topf + 4 * ((y - 1) * x); in IMB_flipy()
77 memcpy(linef, topf, 4 * x * sizeof(float)); in IMB_flipy()
78 memcpy(topf, bottomf, 4 * x * sizeof(float)); in IMB_flipy()
81 topf += 4 * x; in IMB_flipy()
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/testsuite/g++.dg/ipa/
H A Dpr60600.C10 virtual int topf();
14 int topf() /* override */ { return 0; } in topf() function
20 data d(topf()); in childf()
/dports/lang/gcc9/gcc-9.4.0/gcc/testsuite/g++.dg/ipa/
H A Dpr60600.C10 virtual int topf();
14 int topf() /* override */ { return 0; } in topf() function
20 data d(topf()); in childf()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/testsuite/g++.dg/ipa/
H A Dpr60600.C9 virtual int topf();
13 int topf() /* override */ { return 0; } in topf() function
19 data d(topf()); in childf()
/dports/devel/avr-gcc/gcc-10.2.0/gcc/testsuite/g++.dg/ipa/
H A Dpr60600.C10 virtual int topf();
14 int topf() /* override */ { return 0; } in topf() function
20 data d(topf()); in childf()
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/testsuite/g++.dg/ipa/
H A Dpr60600.C10 virtual int topf();
14 int topf() /* override */ { return 0; } in topf() function
20 data d(topf()); in childf()

12345678910>>...16