This repository contains the code for the thesis project by Andrew Whalley at the University of Queensland, Australia: August 2015 - June 2016.

The code has been developed by Andrew Whalley. This code uses the open source PMD project to analyse Java files. The project is open source but incomplete. People are free to fork this project under the GNU license and use it as they wish. Any issues can be submitted to the issue tracker, but the project may not progress after June 2016.

This thesis is concerned with the analysis of how List implementations (ArrayLists and LinkedLists) are used in Java code. The aim is to perform a naive complexity analysis on the code in order to determine an approximation of the runtime complexity each implementation would have and hence form a recommendation as to which implementation would be more efficient. JDSA is short for Java Data Structure Advisor, but this term was removed in the late stages of development.

For more information, please refer to the thesis paper.

1. Get PMD for Eclipse
2. Fork this repository
3. Add the repository to Eclipse as a plugin development project
4. Execute DetectDataStructure as an Eclipse Application
5. In the new window edit the preferences of PMD
6. Add the DetectDataStructure rule to PMD
7. On the source code to be analysed, right-click and select PMD->Check Code
8. Information about the analysis is displayed to standard out in the original Eclipse runtime window