public void addAll(List<ISearchResult> result) {
Iterator<ISearchResult> it = result.iterator();
while (it.hasNext()) {
listModel.addElement(it.next());
}
}
public void add(ISearchResult result) {
listModel.addElement(result);
}
public void clear() {
listModel.clear()
public void addAll(List<ISearchResult> result) {
Iterator<ISearchResult> it = result.iterator();
while (it.hasNext()) {
listModel.addElement(it.next());
}
}
public void add(ISearchResult result) {
listModel.addElement(result);
}
public void clear() {
listModel.clear()
Clone fragments detected by clone detection tool
File path: /columba-1.4-src/calendar/src/main/java/org/columba/calendar/ui/search/SearchResultList.java
|
|
File path: /columba-1.4-src/mail/src/main/java/org/columba/mail/gui/search/ResultList.java
|
Method name:
|
|
Method name:
|
Number of AST nodes: 0
|
|
Number of AST nodes: 0
|
|
1 | public void addAll(List<ISearchResult> result) {↵ | | 1 | public void addAll(List<ISearchResult> result) {↵
|
2 | Iterator<ISearchResult> it = result.iterator();↵ | | 2 | Iterator<ISearchResult> it = result.iterator();↵
|
3 | while (it.hasNext()) {↵ | | 3 | while (it.hasNext()) {↵
|
4 | listModel.addElement(it.next());↵ | | 4 | listModel.addElement(it.next());↵
|
5 | }↵ | | 5 | }↵
|
6 | }↵ | | 6 | }↵
|
|
7 | public void add(ISearchResult result) {↵ | | 7 | public void add(ISearchResult result) {↵
|
8 | listModel.addElement(result);↵ | | 8 | listModel.addElement(result);↵
|
9 | }↵ | | 9 | }↵
|
|
10 | public void clear() {↵ | | 10 | public void clear() {↵
|
11 | listModel.clear() | | 11 | listModel.clear()
|
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 |