public boolean move(int index) { // move read position [index] clicks from 'charAt(0)' boolean retval = true; while (retval && (index-- > 0)) retval = next(); return retval; } public boolean isValid() { return (cached != OUT_OF_BOUNDS);
public boolean move(int index) { // move read position [index] clicks from 'charAt(0)' boolean retval = true; while (retval && (index-- > 0)) retval = next(); return retval; } public boolean isValid() { return (cached != OUT_OF_BOUNDS);
Clone fragments detected by clone detection tool
File path: /jEdit-4.2/src/gnu/regexp/CharIndexedInputStream.java File path: /jEdit-4.2/src/gnu/regexp/CharIndexedReader.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
public boolean move(int index) {
1
public boolean move(int index) {
2
	// move read position [index] clicks from 'charAt(0)'
2
	// move read position [index] clicks from 'charAt(0)'
3
	boolean retval = true;
3
	boolean retval = true;
4
	while (retval && (index-- > 0)) retval = next();
4
	while (retval && (index-- > 0)) retval = next();
5
	return retval;
5
	return retval;
6
    }
6
    }
7
    
7
    
8
    public boolean isValid() {
8
    public boolean isValid() {
9
	return (cached != OUT_OF_BOUNDS);
9
	return (cached != OUT_OF_BOUNDS);
Summary
Number of common nesting structure subtrees0
Number of refactorable cases0
Number of non-refactorable cases0
Time elapsed for finding largest common nesting structure subtrees (ms)0.0
Clones location
Number of node comparisons0