[FOP-1890] O(n^2) code for adding new pages

• Type: Improvement
• Status: Closed
• Resolution: Fixed
• Affects Version/s: 2.5
• Component/s: fo/unqualified
• Environment: Operating System: All; Platform: All
• External issue ID: 50636
• Assignee: fop-dev
• Reporter: Martin Koegler
• Created: 22/Jan/11 13:40
• Updated: 22/Jan/11 13:41
• Resolved: 01/Apr/12 06:18

Description

Adding a new page causes to iterate over all existing page sequnces and count their number of pages.

If there is a large number of page sequences, this can take a significant percentage of the fop running time.

I have the attached workaround in my tree for some time:
It caches the number of pages in the page sequences, so that adding a new page is only O(1).