We've expanded our news coverage and improved our search! Visit
oreilly.com for the latest or search for all things across O'Reilly!
Article:
 |
|
Detecting Duplicate Code with PMD's CPD
|
| Subject: |
|
Thanks to Brian Ewins.... |
| Date: |
|
2003-03-28 13:02:42 |
| From: |
|
tcopeland
|
|
|
|
...for rewriting the CPD algorithm. He used a completely different approach - the Burrows-Wheeler Transform - and the Ant source code can now be processed in about ten seconds.
Thanks also to Andy Glover who wrote an Ant task for CPD.
Check it out at http://pmd.sf.net/cpd.html
Yours,
Tom
|