An evaluation of the strategies of sorting, filtering, and grouping API methods for Code Completion

Authors:
Daqing Hou;David M. Pletcher
Affiliations:
Electrical and Computer Engineering, Clarkson University, Potsdam, NY USA 13699;Computer Science, Clarkson University, Potsdam, NY USA 13699
Venue:
ICSM '11 Proceedings of the 2011 27th IEEE International Conference on Software Maintenance
Year:
2011

Citing 0
Cited 4

On the naturalness of software

Proceedings of the 34th International Conference on Software Engineering
Active code completion

Proceedings of the 34th International Conference on Software Engineering
Improving IDE recommendations by considering global implications of existing recommendations

Proceedings of the 34th International Conference on Software Engineering
A statistical semantic language model for source code

Proceedings of the 2013 9th Joint Meeting on Foundations of Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Code Completion is one of the most popular IDE features for accessing APIs, freeing programmers from remembering specific details about an API and reducing keystrokes. We propose three ways to enhance the current code-completion systems to work more effectively with large APIs. First, we propose two methods for sorting APIs, by type hierarchy and by use count, and show that their use significantly reduces the number of API proposals a user must navigate while using Code Completion. Second, we show that context-specific filtering of inappropriate proposals can also reduce the number of proposals a user must navigate. Third, we propose to group API proposals by their functional roles, which can help maintain a well-ordered, meaningful list of API proposals in the presence of dynamic reordering. These functionalities are grouped into a research prototype, BCC (Better Code Completion). We evaluated fourteen configurations of BCC by simulating Code Completion nearly three million times on nine open-source Java projects that utilize AWT/Swing.