Community
Participate
Working Groups
When looking for update between our "to" and "from" list of IUs our current algorithm is O(n^2). With a hash lookup this could be O(n). See: OperationGenerator.generateUpdates (line 82)
Created attachment 106979 [details] patch This adds the use of a hashmap by Id to allow us to lookup matching update sources quickly.
I've committed to the 3.5 stream to allow further testing.
Marking fixed along with bug 238312