java覆盖率测试工具

				/*
				 * Cobertura - http://cobertura.sourceforge.net/
				 *
				 * Copyright (C) 2006 Jiri Mares
				 *
				 * Cobertura is free software; you can redistribute it and/or modify
				 * it under the terms of the GNU General Public License as published
				 * by the Free Software Foundation; either version 2 of the License,
				 * or (at your option) any later version.
				 *
				 * Cobertura is distributed in the hope that it will be useful, but
				 * WITHOUT ANY WARRANTY; without even the implied warranty of
				 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
				 * General Public License for more details.
				 *
				 * You should have received a copy of the GNU General Public License
				 * along with Cobertura; if not, write to the Free Software
				 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
				 * USA
				 */
				
				package net.sourceforge.cobertura.coveragedata;
				
				import java.io.Serializable;
				
				/**
				 * 
				 * This class implements HasBeenInstrumented so that when cobertura instruments
				 * itself, it will omit this class. It does this to avoid an infinite recursion
				 * problem because instrumented classes make use of this class.
				 * 
				 */
				public class JumpData implements BranchCoverageData, Comparable, Serializable,
						HasBeenInstrumented
				{
					private static final long serialVersionUID = 8;
				
					private int conditionNumber;
				
					private long trueHits;
				
					private long falseHits;
				
					JumpData(int conditionNumber)
					{
						super();
						this.conditionNumber = conditionNumber;
						this.trueHits = 0L;
						this.falseHits = 0L;
					}
				
					public int compareTo(Object o)
					{
						if (!o.getClass().equals(JumpData.class))
							return Integer.MAX_VALUE;
						return this.conditionNumber - ((JumpData) o).conditionNumber;
					}
				
					void touchBranch(boolean branch)
					{
						if (branch)
						{
							this.trueHits++;
						}
						else
						{
							this.falseHits++;
						}
					}
				
					public int getConditionNumber()
					{
						return this.conditionNumber;
					}
				
					public long getTrueHits()
					{
						return this.trueHits;
					}
				
					public long getFalseHits()
					{
						return this.falseHits;
					}
				
					public double getBranchCoverageRate()
					{
						return ((double) getNumberOfCoveredBranches()) / getNumberOfValidBranches();
					}
				
					public boolean equals(Object obj)
					{
						if (this == obj)
							return true;
						if ((obj == null) || !(obj.getClass().equals(this.getClass())))
							return false;
				
						JumpData branchData = (JumpData) obj;
						return (this.trueHits == branchData.trueHits)
								&& (this.falseHits == branchData.falseHits)
								&& (this.conditionNumber == branchData.conditionNumber);
					}
				
					public int hashCode()
					{
						return this.conditionNumber;
					}
				
					public int getNumberOfCoveredBranches()
					{
						return ((trueHits > 0) ? 1 : 0) + ((falseHits > 0) ? 1: 0);
					}
				
					public int getNumberOfValidBranches()
					{
						return 2;
					}
				
					public void merge(BranchCoverageData coverageData)
					{
						JumpData jumpData = (JumpData) coverageData;
						this.trueHits += jumpData.trueHits;
						this.falseHits += jumpData.falseHits;
					}
				
				}