But it can be hard to find, especially in a large project. So we wrote a utility - CPD - to find it for us. - CPD uses (more or less) Michael Wise's Greedy String Tiling algorithm to find duplicate code. Here's - a screenshot of CPD after running on itself. Looks like we've got - some refactoring to do....
+ CPD uses (more or less) Michael Wise's Greedy String Tiling algorithm to find duplicate code. +Here's a screenshot of CPD after running on the JDK java.lang package.
To run CPD as a JNLP application, click here.
-As a reference point, running the CPD GUI against the JDK 1.4 java.net package on a - Pentium III 1.1 GHz machine with 512 MB of RAM took 6 minutes 22 seconds. It found some nice duplicates which - you can see here - the largest ones are at the bottom of the page.
+As a reference point, running the CPD GUI against the JDK 1.4 java packages (1178 files, 13.4 MB of data)on a + Celeron 1.13 GHz machine with 256 MB of RAM took 19 hours and 59 minutes. It found some nice duplicates which + you can see here - the largest ones are at the bottom of the page.
Future plans
