Transform ArrayList to LinkedList for Performance Improvement

Hi,
We find that there are several ArrayList objects which are not manipulated by random access. Due to the memory reallocation triggered in the successive insertions, the time complexity of add method of ArrayList is amortized O(1). We notice that these objects are only used for traversal and the retrieval for the first or the last element.

This functionality can be implemented by LinkedList. Moreover, the insertion of LinkedList is strictly O(1) time complexity because no memory reallocation occurs.

We discovered this inefficient usage of containers by our tool Ditto. The patch is submitted in #1444. Could you please check and accept it? We have tested the patch on our PC. The patched program works well.

Bests

Ditto

Start by reviewing the patch referenced as #1444 and the affected ArrayList usages. Confirm that each is used only for traversal or first/last-element retrieval and that the proposed LinkedList conversion preserves behavior; completion is acceptance of that patch.

Vom Indexierungsmodell aus dem Issue-Text verfasst.