Joonas Kylmälä fa0665ad92 Bug 31455: (QA follow-up) Make table creation O(N) ... We can insert the indices before the main loop to a hash, this way we don't have to look up during each loop iteration the index from an array which in the worst case might take O(N) thus making the total time complexity O(N^2). Signed-off-by: Joonas Kylmälä <joonas.kylmala@iki.fi> Signed-off-by: Tomas Cohen Arazi <tomascohen@theke.io> (cherry picked from commit 223d9d3a99) Signed-off-by: Lucas Gass <lucas@bywatersolutions.com> (cherry picked from commit b2a66cd307) Signed-off-by: Arthur Suzuki <arthur.suzuki@biblibre.com>		2022-09-21 11:17:54 +02:00
..
Items.pm	Bug 31455: (QA follow-up) Make table creation O(N)	2022-09-21 11:17:54 +02:00