while ( iter.hasNext() ) { AuctionInfo ai = (AuctionInfo) iter.next(); System.out.println( "Auction: " + ai.getId() + " - " + ai.getDescription() + ", ends: " + ai.getEnds() + ", highest bid: " + ai.getMaxAmount()
while ( iter.hasNext() ) { AuctionItem auction = (AuctionItem) iter.next(); System.out.println( "Auction: " + auction.getId() + " - " + auction.getDescription() + ", ends: " + auction.getEnds() + ", bids: " + auction.getBids()
Clone fragments detected by clone detection tool
File path: /hibernate-distribution-3.3.2.GA/project/tutorials/eg/src/main/java/org/hibernate/auction/Main.java File path: /hibernate-distribution-3.3.2.GA/project/tutorials/eg/src/main/java/org/hibernate/auction/Main.java
Method name: Method name:
Number of AST nodes: 0 Number of AST nodes: 0
1
while ( iter.hasNext() ) {
1
while ( iter.hasNext() ) {
2
				AuctionInfo ai = (AuctionInfo) iter.next();
2
				AuctionItem auction = (AuctionItem) iter.next();
3
				System.out.println(
3
				System.out.println(
4
					"Auction: " + ai.getId() + " - " + ai.getDescription() +
4
					"Auction: " + auction.getId() + " - " + auction.getDescription() +
5
					", ends: " + ai.getEnds() +
5
					", ends: " + auction.getEnds() +
6
					", highest bid: " + ai.getMaxAmount()
6
					", bids: " + auction.getBids()
7
				
7
				
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