performance optimization by Interleave

[1178615156]

Problem

query : ctx.run(table.filter(e => liftQuery(ids).contains(e.id)))
it will take long long time when ids size is big (E.g 100000)

Solution

scala collection complexity
because for List ; prepend is O(1) , append is O(n)
so use prepend replace append is more effectively

Checklist

• Unit test all changes
• Update README.md if applicable
• Add [WIP] to the pull request title if it's work in progress
• Squash commits that aren't meaningful changes
• Run sbt scalariformFormat test:scalariformFormat to make sure that the source files are formatted

@getquill/maintainers

[codecov-io]

Codecov Report

Merging #811 into master will not change coverage.
The diff coverage is 100%.

@@           Coverage Diff           @@
##           master     #811   +/-   ##
=======================================
  Coverage   93.51%   93.51%           
=======================================
  Files         134      134           
  Lines        2514     2514           
  Branches       37       33    -4     
=======================================
  Hits         2351     2351           
  Misses        163      163

Impacted Files	Coverage Δ
...e/src/main/scala/io/getquill/util/Interleave.scala	100% <100%> (ø)	⬆️

---

Continue to review full report at Codecov.

Legend - Click here to learn more
Δ = absolute <relative> (impact), ø = not affected, ? = missing data
Powered by Codecov. Last update 1705dca...a8fc2f1. Read the comment docs.

[jilen]

I am afraid reverse is also O(n)

[1178615156]

@jilen yes reverse is O(n)
but the complexity of the new method is :
O(n)(one iteration) * O(1)(prepend) + O(n)(reverse) + O(n)(append) = O(n)

before is O(n)(one iteration) * O(n)(append) = O(n^2)

[mosyp]

Great contribution, thank you!

[mxl]

@1178615156 We haven't merged PR yet. Please reopen it.