Improving code completion based on repetitive code completion operations

• OMORI Takayuki

  Department of Computer Science, Ritsumeikan University

• KUWABARA Hiroaki

  Department of Computer Science, Ritsumeikan University

• MARUYAMA Katsuhisa

  Department of Computer Science, Ritsumeikan University

Bibliographic Information

Other Title

• 繰り返しコード補完操作に基づくコード補完の改善

Abstract

Although code completion is inevitable for effective code editing on integrated development environments, existing code completion tools can be improved. A previous study noted that developers sometimes perform ineffective repetitions of the same code completion operations. Hence, this paper introduces a statement, “A more recently inserted code completion candidate should be given a higher rank among previously inserted items in the candidate list.” To confirm this statement, this paper examines the following three points. First, an experiment using operation histories is presented to reconfirm that developers more frequently repeat recent code completion operations. Second, a tool called RCC Candidate Sorter is presented. It alters the sorting algorithm of the default Eclipse code completion tool to prioritize candidates inserted by recent code completion. Finally, an experiment is conducted to evaluate the performance of the tool. The experimental result shows that it outperforms an existing method.

Journal

• Computer Software

  Computer Software 32 (1), 1_120-1_135, 2015

  Japan Society for Software Science and Technology

Details

• CRID: 1390282679715354752
• NII Article ID: 130004892313
• DOI: 10.11309/jssst.32.1_120
• ISSN: 02896540
• Text Lang: ja
• Data Source:
  • JaLC
  • CiNii Articles
  • KAKEN
• Abstract License Flag: Disallowed