boolean shouldCheckout(String pName) { boolean includeIt = matchPatterns(getIncludes(), pName); boolean excludeIt = matchPatterns(getExcludes(), pName); return (includeIt && !excludeIt); } /** * Convenient method to see if a string match a one pattern in given set * of space-separated patterns. * * @param patterns the space-separated list of patterns. * @param pName the name to look for matching. * @return whether the name match at least one pattern. */ protected boolean matchPatterns(String patterns, String pName) { if (patterns == null) { return false; } StringTokenizer exStr = new StringTokenizer(patterns, " "); while (exStr.hasMoreTokens()) { if (DirectoryScanner.match(exStr.nextToken(), pName)) { return true; } } return false;
boolean shouldProcess(String pName) { boolean includeIt = matchPatterns(getIncludes(), pName); boolean excludeIt = matchPatterns(getExcludes(), pName); return (includeIt && !excludeIt); } /** * Convenience method to see if a string match a one pattern * in given set of space-separated patterns. * @param patterns the space-separated list of patterns. * @param pName the name to look for matching. * @return whether the name match at least one pattern. */ protected boolean matchPatterns(String patterns, String pName) { if (patterns == null) { return false; } StringTokenizer exStr = new StringTokenizer(patterns, ","); while (exStr.hasMoreTokens()) { if (DirectoryScanner.match(exStr.nextToken(), pName)) { return true; } } return false;
Clone fragments detected by clone detection tool
File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/scm/AntStarTeamCheckOut.java File path: /apache-ant-1.7.0/src/org/apache/tools/ant/taskdefs/optional/starteam/TreeBasedTask.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
boolean shouldCheckout(String pName) {
1
boolean shouldProcess(String pName) {
2
        boolean includeIt = matchPatterns(getIncludes(), pName);
2
        boolean includeIt = matchPatterns(getIncludes(), pName);
3
        boolean excludeIt = matchPatterns(getExcludes(), pName);
3
        boolean excludeIt = matchPatterns(getExcludes(), pName);
4
        return (includeIt && !excludeIt);
4
        return (includeIt && !excludeIt);
5
    }
5
    }
6
    /**
6
    /**
7
     * Convenient method to see if a string match a one pattern
7
     * Convenience method to see if a string match a one pattern
8
 in given set
8
     * in given set
9
     * of space-separated patterns.
9
 of space-separated patterns.
10
     *
11
     * @param patterns the space-separated list of patterns.
10
     * @param patterns the space-separated list of patterns.
12
     * @param pName the name to look for matching.
11
     * @param pName the name to look for matching.
13
     * @return whether the name match at least one pattern.
12
     * @return whether the name match at least one pattern.
14
     */
13
     */
15
    protected boolean matchPatterns(String patterns, String pName) {
14
    protected boolean matchPatterns(String patterns, String pName) {
16
        if (patterns == null) {
15
        if (patterns == null) {
17
            return false;
16
            return false;
18
        }
17
        }
19
        StringTokenizer exStr = new StringTokenizer(patterns, " ");
18
        StringTokenizer exStr = new StringTokenizer(patterns, ",");
20
        while (exStr.hasMoreTokens()) {
19
        while (exStr.hasMoreTokens()) {
21
            if (DirectoryScanner.match(exStr.nextToken(), pName)) {
20
            if (DirectoryScanner.match(exStr.nextToken(), pName)) {
22
                return true;
21
                return true;
23
            }
22
            }
24
        }
23
        }
25
        return false;
24
        return false;
26
    
25
    
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