Part of #60565. Make your time

Doing more null supressions rather than code changes in quickOpen since we will be migrating off this old code

Move some computations out of the inner loop into the outer loop to avoid repeated computation.

fixing simple cases of any[]

We compile using the alwaysStrict flag so these directives are not needed

* Don't sort scores in test

This test was a noop, because sort sorted `scores` as well. After this change,
the test fails. It passes after the following changes:

* hw should be a higher score than just H, since the w appears after a word
  separator.
* Same with ld and L.
* Change target so that L comes before l. The scorer algorithm is greedy, so
  will not match the upper case L otherwise, which is the point of that specific
  case.

* Use correct index for same case bonus

`indexOf` is the index into `target`, while `index` is the correct index into
`query`.

* Return early for query length larger than target