eresearchqut / ddb-repository / 26987305743

98%

push

github

perf: use Map for O(n) GSI item ordering in getItems and getItemsPage

The previous implementation used Array.find() to match each key from
batchGetItems results back to the GSI query order. This is O(n*m) where
n is the result set size and m is the batchGetItems response size - for
typical cases O(n²).

Replace with a Map keyed on the composite primary key (hashKey + optional
rangeKey, null-byte separated). Building the Map is O(n) and each lookup
is O(1), so the reordering step is O(n) overall.

Both getItems and getItemsPage use the same GSI→batchGetItems→reorder
pattern and receive the same fix.

Co-authored-by: Copilot <223556219+Copilot@users.noreply.github.com>

200 of 213 branches covered (93.9%)

Branch coverage included in aggregate %.

10 of 10 new or added lines in 1 file covered. (100.0%)

333 of 333 relevant lines covered (100.0%)

90.25 hits per line