Package org.broadinstitute.gatk.engine.report

Examples of org.broadinstitute.gatk.engine.report.GATKReport.addRow()


        if (calculateFilteredDistribution) {
            report = GATKReport.newSimpleReport("BaseCoverageDistribution", "Coverage", "Count", "Filtered");
        } else {
            report = GATKReport.newSimpleReport("BaseCoverageDistribution", "Coverage", "Count");
            report.addRow(0, uncoveredBases); // preemptively add the uncovered bases row (since they'll never exist in the Map)
        }

        for (Map.Entry<Integer, ArrayList<Long>> entry : result.entrySet()) {
            final ArrayList<Long> values = entry.getValue();
            final int coverage = entry.getKey();
View Full Code Here


        for (Map.Entry<Integer, ArrayList<Long>> entry : result.entrySet()) {
            final ArrayList<Long> values = entry.getValue();
            final int coverage = entry.getKey();
            if (calculateFilteredDistribution) {
                if (coverage == 0) { // special case for the uncovered bases. The filtered pileups may have an entry, but the unfiltered ones won't.
                    report.addRow(coverage, uncoveredBases, uncoveredBases + values.get(1));
                } else {
                    report.addRow(coverage, values.get(0), values.get(1));
                }
            } else {
                report.addRow(coverage, values.get(0));
View Full Code Here

            final int coverage = entry.getKey();
            if (calculateFilteredDistribution) {
                if (coverage == 0) { // special case for the uncovered bases. The filtered pileups may have an entry, but the unfiltered ones won't.
                    report.addRow(coverage, uncoveredBases, uncoveredBases + values.get(1));
                } else {
                    report.addRow(coverage, values.get(0), values.get(1));
                }
            } else {
                report.addRow(coverage, values.get(0));
            }
        }
View Full Code Here

                    report.addRow(coverage, uncoveredBases, uncoveredBases + values.get(1));
                } else {
                    report.addRow(coverage, values.get(0), values.get(1));
                }
            } else {
                report.addRow(coverage, values.get(0));
            }
        }
        // In case the filtered distribution never had a pileup filtered down to zero coverage, output the overall uncovered bases for both
        if (calculateFilteredDistribution && !result.containsKey(0)) {
            report.addRow(0, uncoveredBases, uncoveredBases);
View Full Code Here

                report.addRow(coverage, values.get(0));
            }
        }
        // In case the filtered distribution never had a pileup filtered down to zero coverage, output the overall uncovered bases for both
        if (calculateFilteredDistribution && !result.containsKey(0)) {
            report.addRow(0, uncoveredBases, uncoveredBases);
        }
        report.print(out);
    }

    /**
 
View Full Code Here

            Map<CigarOperator, Long> operatorCount = entry.getValue();

            for (Map.Entry<CigarOperator, Long> subEntry: operatorCount.entrySet()) {
                String operator = subEntry.getKey().name();
                Long observations = subEntry.getValue();
                report.addRow(position, operator, observations);
            }
        }
        report.print(out);
    }
}
View Full Code Here

TOP
Copyright © 2018 www.massapi.com. All rights reserved.
All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.