CloneSet1076


Clone Mass	Clones in CloneSet	Parameter Count	Clone Similarity	Syntax Category [Sequence Length]
19	2	0	1.000	statement_sequence[7]

Clone Abstraction

Parameter Bindings

Clone Instance (Click to see clone)	Line Count	Source Line	Source File
1	19	335	plugins/org.eclipse.jdt.core/compiler/org/eclipse/jdt/internal/compiler/ClassFile.java
2	19	411	plugins/org.eclipse.jdt.core/compiler/org/eclipse/jdt/internal/compiler/util/Util.java

Clone Instance
1

Line Count
19

Source Line
335

Source File

plugins/org.eclipse.jdt.core/compiler/org/eclipse/jdt/internal/compiler/ClassFile.java

                // this code is completely useless, but it is the same implementation than
                // org.eclipse.jdt.internal.compiler.problem.ProblemHandler.searchLineNumber(int[], int)
                // if (startLineIndexes == null)
                //      return 1;
                int length = startLineIndexes.length;
                if (length == 0)
                        return 1;
                int g = 0, d = length - 1;
                int m = 0, start;
                while (g <= d) {
                        m = (g + d) / 2;
                        if (position < (start = startLineIndexes[m])) {
                                d = m - 1;
                        }
                        else   if (position > start) {
                                g = m + 1;
                               }
                               else {
                                return m + 1;
                               }
                }
                if (position < startLineIndexes[m]) {
                        return m + 1;
                }
                return m + 2;

Clone Instance
2

Line Count
19

Source Line
411

Source File

plugins/org.eclipse.jdt.core/compiler/org/eclipse/jdt/internal/compiler/util/Util.java

                int length = startLineIndexes.length;
                if (length == 0)
                        return 1;
                int g = 0, d = length - 1;
                int m = 0, start;
                while (g <= d) {
                        m = (g + d) / 2;
                        if (position < (start = startLineIndexes[m])) {
                                d = m - 1;
                        }
                        else   if (position > start) {
                                g = m + 1;
                               }
                               else {
                                return m + 1;
                               }
                }
                if (position < startLineIndexes[m]) {
                        return m + 1;
                }
                return m + 2;

Clone Abstraction

Parameter Count: 0

Parameter Bindings

// this code is completely useless, but it is the same implementation than
// org.eclipse.jdt.internal.compiler.problem.ProblemHandler.searchLineNumber(int[], int)
// if (startLineIndexes == null)
//      return 1;
int length = startLineIndexes.length;
if (length == 0)
  return 1;
int g = 0, d = length - 1;
int m = 0, start;
while (g <= d) {
  m = (g + d) / 2;
  if (position < (start = startLineIndexes[m])) {
    d = m - 1;
  }
  else
    if (position > start) {
      g = m + 1;
    }
    else {
      return m + 1;
    }
}
if (position < startLineIndexes[m]) {
  return m + 1;
}
return m + 2;

CloneAbstraction

Parameter Bindings
Parameter Index	Clone Instance	Parameter Name	Value
None