CloneSet1076


Previous CloneSetNext CloneSetBack to Main Report
Clone
Mass
Clones in
CloneSet
Parameter
Count
Clone
Similarity
Syntax Category
[Sequence Length]
19201.000statement_sequence[7]
Clone AbstractionParameter Bindings
Clone Instance
(Click to see clone)
Line CountSource Line
Source File
119335
plugins/org.eclipse.jdt.core/compiler/org/eclipse/jdt/internal/compiler/ClassFile.java
219411
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 AbstractionParameter Count: 0Parameter 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