tdf#100244: sc:For non-lazy init ignore hashHEADmaster

The maMemberHash table gets huge in the non-lazy init case.
Don't use it in that case.

Fall back to a binary search of the array (and then as now
back to a linear search).

This saves just under 1GB, or about 30% on the tdf100244 test.

Note, all my debug so far shows the binary search finding the
required item 'n' at index 'n' in the array - maybe there
are some sort cases where that's not true, but it's interesting!

Change-Id: I2a521ca40c9a231c590ca0f016b41f3b2cdb7fc3
Reviewed-on: https://gerrit.libreoffice.org/c/core/+/202899
Tested-by: Jenkins
Reviewed-by: David Gilbert <freedesktop@treblig.org>

0 files changed, 0 insertions, 0 deletions