From 20a3287a9c274632b0c6e45508942f08efdbeb77 Mon Sep 17 00:00:00 2001 From: Tom Copeland Date: Tue, 20 Aug 2002 17:36:39 +0000 Subject: [PATCH] tweak git-svn-id: https://pmd.svn.sourceforge.net/svnroot/pmd/trunk@728 51baf565-9d33-0410-a72c-fc3788e3496d --- pmd/project.xml | 15 +++++++++++++++ pmd/xdocs/cpd.xml | 11 +++++------ 2 files changed, 20 insertions(+), 6 deletions(-) diff --git a/pmd/project.xml b/pmd/project.xml index ccfff0b26b..502076024f 100644 --- a/pmd/project.xml +++ b/pmd/project.xml @@ -90,6 +90,21 @@ dave@infoether.com Developer + + + Rich Kilmer + richkilmer + rich@infoether.com + Developer + + + + Don Leckie + donleckie + donleckie@users.sourceforge.net + Developer + + diff --git a/pmd/xdocs/cpd.xml b/pmd/xdocs/cpd.xml index 79a7952e3c..f832e3f80c 100644 --- a/pmd/xdocs/cpd.xml +++ b/pmd/xdocs/cpd.xml @@ -9,13 +9,12 @@

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

  • Make a PMD rule for CPD