Details
-
Bug
-
Resolution: Fixed
-
Major
-
6.5.0, Cheshire-Cat
-
Untriaged
-
Unknown
Description
Currently, the compute complexity of the method ComputeArrayEntriesWithCount is O(len(newKey) * len(oldKey)).
The function of this method seems to remove the common entries in both the arrays. This can be achieved using O(len(newKey) + len(oldKey))
Attachments
Issue Links
- is a backport of
-
MB-38631 Optimize ComputeArrayEntriesWithCount method
- Closed
For Gerrit Dashboard: MB-41641 | ||||||
---|---|---|---|---|---|---|
# | Subject | Branch | Project | Status | CR | V |
137208,4 | MB-41641 Array Indexing performance improvements | mad-hatter | indexing | Status: MERGED | +2 | +1 |
139075,3 | testing mb-41641 | master | testrunner | Status: ABANDONED | 0 | 0 |