if (regexp != null && regexp.length > 0) {
INCPTRN = regexp;
this.PTRNFILTER = true;
// now we create the compiled pattern and
// add it to the arraylist
for (int idx = 0; idx < INCPTRN.length; idx++) {
this.INCPATTERNS.add(this.createPattern(INCPTRN[idx]));
if (regexp != null && regexp.length > 0) {
EXCPTRN = regexp;
this.PTRNFILTER = true;
// now we create the compiled pattern and
// add it to the arraylist
for (int idx = 0; idx < EXCPTRN.length; idx++) {
this.EXCPATTERNS.add(this.createPattern(EXCPTRN[idx]));
Clone fragments detected by clone detection tool
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/protocol/http/util/accesslog/LogFilter.java
|
|
File path: /jakarta-jmeter-2.3.2/src/org/apache/jmeter/protocol/http/util/accesslog/LogFilter.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | if (regexp != null && regexp.length > 0) {↵ | | 1 | if (regexp != null && regexp.length > 0) {↵
|
2 | INCPTRN = regexp;↵ | | 2 | EXCPTRN = regexp;↵
|
3 | this.PTRNFILTER = true;↵ | | 3 | this.PTRNFILTER = true;↵
|
4 | // now we create the compiled pattern and↵ | | 4 | // now we create the compiled pattern and↵
|
5 | // add it to the arraylist↵ | | 5 | // add it to the arraylist↵
|
6 | for (int idx = 0; idx < INCPTRN.length; idx++) {↵ | | 6 | for (int idx = 0; idx < EXCPTRN.length; idx++) {↵
|
7 | this.INCPATTERNS.add(this.createPattern(INCPTRN[idx]));↵ | | 7 | this.EXCPATTERNS.add(this.createPattern(EXCPTRN[idx]));↵
|
8 | | | 8 |
|
See real code fragment |
|
See real code fragment |
Summary
Number of common nesting structure subtrees | 0 |
Number of refactorable cases | 0 |
Number of non-refactorable cases | 0 |
Time elapsed for finding largest common nesting structure subtrees (ms) | 0.0 |
Clones location | |
Number of node comparisons | 0 |