public final float percentBasecodeA(){ float sa = subA.size() - subA.files.length; return bcmatchesA.tokensMatched() * 100 / sa; } public final float percentBasecodeB(){
int lengthA = structA.size()-1; // minus pivots! int lengthB = structB.size()-1; // minus pivots! AllBasecodeMatches allBasecodeMatches = new AllBasecodeMatches(subA,subB); int x = matches.matches[i].startA; // beginning in sequence A int y = matches.matches[i].startB; // beginning in sequence B allBasecodeMatches.addMatch(x, y, matches.matches[i].length);
for (int x = 0; x < bcmatch.size(); x++) { Match onematch = bcmatch.matches[x]; Token start = tokens[onematch.startA];
for (int x = 0; x < bcmatch.size(); x++) { onematch = bcmatch.matches[x]; Token start = tokens[onematch.startA];
public final float percentBasecodeB(){ float sb = subB.size() - subB.files.length; return bcmatchesB.tokensMatched() * 100 / sb; } public final float roundedPercentBasecodeA() {
public final float percent() { float sa, sb; if(bcmatchesB != null && bcmatchesA != null){ sa = subA.size() - subA.files.length - bcmatchesA.tokensMatched(); sb = subB.size() - subB.files.length - bcmatchesB.tokensMatched(); } else{ sa = subA.size() - subA.files.length; sb = subB.size() - subB.files.length; } return (200*(float)tokensMatched())/(sa+sb); } public final float percentA() {
public final float percentA() { int divisor; if(bcmatchesA != null) divisor = subA.size()-subA.files.length-bcmatchesA.tokensMatched(); else divisor = subA.size()-subA.files.length; return (divisor == 0 ? 0f : (tokensMatched()*100 / (float) divisor)); } public final float percentB() {
public final float percentB() { int divisor; if(bcmatchesB != null) divisor = subB.size()-subB.files.length-bcmatchesB.tokensMatched(); else divisor = subB.size()-subB.files.length; return (divisor == 0 ? 0f : (tokensMatched()*100 / (float) divisor)); }