| /dports/biology/canu/canu-2.2/src/bogart/ |
| H A D | AS_BAT_ChunkGraph.C | 114 ChunkGraph::countFullWidth(ReadEnd firstEnd, uint32 *endPathLen, FILE *chunkLog) { in countFullWidth() argument
115 uint64 firstIdx = getIndex(firstEnd); in countFullWidth()
117 assert(firstEnd.readId() != 0); in countFullWidth()
122 firstEnd.readId(), in countFullWidth()
123 (firstEnd.read3p()) ? 3 : 5, in countFullWidth()
130 ReadEnd lastEnd = firstEnd; in countFullWidth()
189 ReadEnd currEnd = firstEnd; in countFullWidth()
206 currEnd = firstEnd; in countFullWidth()
211 firstEnd.readId(), in countFullWidth()
212 (firstEnd.read3p()) ? 3 : 5, in countFullWidth()
|
| H A D | AS_BAT_ChunkGraph.H | 39 uint32 countFullWidth(ReadEnd firstEnd, uint32 *pathLen, FILE *chunkLog);
|
| /dports/biology/gatk/gatk-4.2.0.0/src/main/java/org/broadinstitute/hellbender/utils/read/mergealignment/ |
| H A D | MostDistantPrimaryAlignmentSelectionStrategy.java | 42 for (final SAMRecord firstEnd : firstEnds) { in pickPrimaryAlignment()
43 pairBest.considerBest(firstEnd, secondEnd); in pickPrimaryAlignment()
142 public void considerBest(final SAMRecord firstEnd, final SAMRecord secondEnd) { in considerBest() argument
143 …final int thisPairMapq = SAMUtils.combineMapqs(firstEnd.getMappingQuality(), secondEnd.getMappingQ… in considerBest()
144 …final int thisDistance = CoordMath.getLength(Math.min(firstEnd.getAlignmentStart(), secondEnd.getA… in considerBest()
145 Math.max(firstEnd.getAlignmentEnd(), secondEnd.getAlignmentEnd())); in considerBest()
150 bestAlignmentPairs.add(new AbstractMap.SimpleEntry<>(firstEnd, secondEnd)); in considerBest()
152 bestAlignmentPairs.add(new AbstractMap.SimpleEntry<>(firstEnd, secondEnd)); in considerBest()
|
| H A D | HitsForInsert.java | 220 public NumPrimaryAlignmentState tallyPrimaryAlignments(final boolean firstEnd) { in tallyPrimaryAlignments() argument
221 if (firstEnd) return tallyPrimaryAlignments(firstOfPairOrFragment); in tallyPrimaryAlignments()
|
| /dports/cad/ktechlab/ktechlab-0.50.0/microbe/ |
| H A D | expression.cpp | 258 int firstEnd = 0; in buildTree() local
273 firstEnd = equpos; in buildTree()
279 firstEnd = neqpos; in buildTree()
298 firstEnd = lepos; in buildTree()
304 firstEnd = gepos; in buildTree()
310 firstEnd = ltpos; in buildTree()
316 firstEnd = gtpos; in buildTree()
331 firstEnd = subpos; in buildTree()
337 firstEnd = addpos; in buildTree()
352 firstEnd = divpos; in buildTree()
[all …]
|
| /dports/devel/kdevelop/kdevelop-21.12.3/kdevplatform/language/util/ |
| H A D | setrepository.cpp | 606 uint firstEnd = first->end(), secondStart = second->start(); in set_union() local
608 if (secondStart >= firstEnd) in set_union()
614 uint newEnd = firstEnd > secondEnd ? firstEnd : secondEnd; in set_union()
641 } else if (splitPosition > firstStart && splitPosition < firstEnd) { in set_union()
670 if (firstEnd <= splitPosition) { in set_union()
711 uint newEnd = firstEnd > secondEnd ? firstEnd : secondEnd; in set_intersect()
746 } else if (splitPosition > firstStart && splitPosition < firstEnd) { in set_intersect()
773 if (firstEnd <= splitPosition) { in set_intersect()
822 uint newEnd = firstEnd > secondEnd ? firstEnd : secondEnd; in set_subtract()
857 } else if (splitPosition > firstStart && splitPosition < firstEnd) { in set_subtract()
[all …]
|
| /dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/ |
| H A D | DeoptimizationGroupingPhase.java | 76 EndNode firstEnd = graph.add(new EndNode()); in run() local
81 merge.addForwardEnd(firstEnd); in run()
84 target.replaceAtPredecessor(firstEnd); in run()
86 exitLoops((AbstractDeoptimizeNode) target, firstEnd, cfg); in run()
|
| /dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/ |
| H A D | DeoptimizationGroupingPhase.java | 77 EndNode firstEnd = graph.add(new EndNode()); in run() local
82 merge.addForwardEnd(firstEnd); in run()
85 first.replaceAtPredecessor(firstEnd); in run()
86 exitLoops(first, firstEnd, cfg); in run()
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/ |
| H A D | DeoptimizationGroupingPhase.java | 77 EndNode firstEnd = graph.add(new EndNode()); in run() local
82 merge.addForwardEnd(firstEnd); in run()
85 first.replaceAtPredecessor(firstEnd); in run()
86 exitLoops(first, firstEnd, cfg); in run()
|
| /dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/ |
| H A D | DeoptimizationGroupingPhase.java | 76 EndNode firstEnd = graph.add(new EndNode()); in run() local
81 merge.addForwardEnd(firstEnd); in run()
84 target.replaceAtPredecessor(firstEnd); in run()
86 exitLoops((AbstractDeoptimizeNode) target, firstEnd, cfg); in run()
|
| /dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/ |
| H A D | DeoptimizationGroupingPhase.java | 76 EndNode firstEnd = graph.add(new EndNode()); in run() local
81 merge.addForwardEnd(firstEnd); in run()
84 target.replaceAtPredecessor(firstEnd); in run()
86 exitLoops((AbstractDeoptimizeNode) target, firstEnd, cfg); in run()
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/ |
| H A D | DeoptimizationGroupingPhase.java | 77 EndNode firstEnd = graph.add(new EndNode()); in run() local
82 merge.addForwardEnd(firstEnd); in run()
85 first.replaceAtPredecessor(firstEnd); in run()
86 exitLoops(first, firstEnd, cfg); in run()
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/ |
| H A D | DeoptimizationGroupingPhase.java | 77 EndNode firstEnd = graph.add(new EndNode()); in run() local
82 merge.addForwardEnd(firstEnd); in run()
85 first.replaceAtPredecessor(firstEnd); in run()
86 exitLoops(first, firstEnd, cfg); in run()
|
| /dports/math/brial/BRiAl-1.2.10/libbrial/include/polybori/diagram/ |
| H A D | CCuddDDFacade.h | 391 std::copy(rhs.firstBegin(), rhs.firstEnd(), outiter); in divideFirst()
416 first_iterator firstEnd() const { in firstEnd() function
434 std::vector<idx_type> indices( std::distance(firstBegin(), firstEnd()) ); in firstMultiples()
436 std::copy( firstBegin(), firstEnd(), indices.begin() ); in firstMultiples()
447 std::vector<idx_type> indices( std::distance(firstBegin(), firstEnd()) ); in firstDivisors()
449 std::copy( firstBegin(), firstEnd(), indices.begin() ); in firstDivisors()
|
| /dports/math/py-brial/BRiAl-1.2.10/libbrial/include/polybori/diagram/ |
| H A D | CCuddDDFacade.h | 391 std::copy(rhs.firstBegin(), rhs.firstEnd(), outiter); in divideFirst()
416 first_iterator firstEnd() const { in firstEnd() function
434 std::vector<idx_type> indices( std::distance(firstBegin(), firstEnd()) ); in firstMultiples()
436 std::copy( firstBegin(), firstEnd(), indices.begin() ); in firstMultiples()
447 std::vector<idx_type> indices( std::distance(firstBegin(), firstEnd()) ); in firstDivisors()
449 std::copy( firstBegin(), firstEnd(), indices.begin() ); in firstDivisors()
|
| /dports/devel/eric6/eric6-21.11/eric/eric6/UI/ |
| H A D | PythonAstViewer.py | 446 firstEnd = first[2:]
451 (firstStart < secondStart and firstEnd > secondEnd) or
452 (firstStart == secondStart and firstEnd > secondEnd) or
453 (firstStart < secondStart and firstEnd == secondEnd)
|
| /dports/math/brial/BRiAl-1.2.10/libbrial/include/polybori/ |
| H A D | BoolePolynomial.h | 391 first_iterator firstEnd() const;
605 return std::includes(firstBegin(), firstEnd(), in firstReducibleBy()
606 rhs.firstBegin(), rhs.firstEnd()); in firstReducibleBy()
|
| H A D | BooleMonomial.h | 133 const_iterator end() const { return m_poly.firstEnd(); } in end()
147 return std::distance(m_poly.firstBegin(),m_poly.firstEnd()); in deg()
|
| /dports/math/py-brial/BRiAl-1.2.10/libbrial/include/polybori/ |
| H A D | BoolePolynomial.h | 391 first_iterator firstEnd() const;
605 return std::includes(firstBegin(), firstEnd(),
606 rhs.firstBegin(), rhs.firstEnd());
|
| H A D | BooleMonomial.h | 133 const_iterator end() const { return m_poly.firstEnd(); } in end()
147 return std::distance(m_poly.firstBegin(),m_poly.firstEnd()); in deg()
|
| /dports/databases/libodbc++/libodbc++-0.2.5/isql++/ |
| H A D | isql++.cpp | 535 string::size_type firstEnd= in extractStatement() local
538 if(firstEnd!=string::npos || in extractStatement()
547 (firstEnd==string::npos || firstEnd>eosp)) { in extractStatement()
548 firstEnd=eosp; in extractStatement()
551 string cmd=buffer_.substr(first,firstEnd-first); in extractStatement()
|
| /dports/math/py-brial/BRiAl-1.2.10/libbrial/src/ |
| H A D | BoolePolynomial.cc | 338 return std::distance(firstBegin(), firstEnd()); in lexLeadDeg()
458 BoolePolynomial::firstEnd() const { in firstEnd() function in BoolePolynomial
461 return m_dd.firstEnd(); in firstEnd()
|
| H A D | LexOrder.cc | 132 std::copy(poly.firstBegin(), poly.firstEnd(), outiter); in leadExp()
|
| /dports/math/brial/BRiAl-1.2.10/libbrial/src/ |
| H A D | BoolePolynomial.cc | 338 return std::distance(firstBegin(), firstEnd()); in lexLeadDeg()
458 BoolePolynomial::firstEnd() const { in firstEnd() function in BoolePolynomial
461 return m_dd.firstEnd(); in firstEnd()
|
| H A D | LexOrder.cc | 132 std::copy(poly.firstBegin(), poly.firstEnd(), outiter); in leadExp()
|