[UIMA-1366] Binary heap annotation iterator implementation

• Type: Improvement
• Status: Closed
• Priority: Major
• Resolution: Fixed
• Fix Version/s: 2.3
• Component/s: Core Java Framework
• Assignee: Thilo Goetz
• Reporter: B Lambov (old handle)
• Created: 02/Jun/09 16:14
• Updated: 03/Jun/09 15:17
• Resolved: 03/Jun/09 14:32

Description

The attached patch is a logarithmic complexity implementation of FSIndexRepositoryImpl.PointerIterator. The implementation maintains a binary heap of indexes and a short sorted section before the start of the heap to avoid spending more time than the old UIMA iterator when a couple of types completely dominate the heap.

It offers small advantage when iterating over a small number of types and should be significantly faster for large numbers of types, as well as in situations where moveToNext() is not the only operation used on the iterator.

Issue Links

• incorporates: UIMA-1365 Code trying to ensure reverse iterators list items in the opposite order of forward ones is present but not working
• incorporates: UIMA-1363 Access to individual type index iterators
• incorporates: UIMA-1364 Concurrent modification checks dominate index iteration time.