Follow up: Investigate dynamic sized search string array buffer for FastSearch

[hannojg]

This is a follow up from this PR:

• Search suffix tree implementation #48652

which was created for this issue ticket originally:

• [Performance] Typing in search is very laggy for big accounts #46591

This is a follow up task.

Currently in FastSearch we create an array buffer which represents large string of all search values. We hard coded a length of 400k:

App/src/libs/FastSearch.ts

Lines 28 to 32 in 13f41cb

	function createFastSearch<T>(dataSets: Array<SearchableData<T>>) {
	Timing.start(CONST.TIMING.SEARCH_CONVERT_SEARCH_VALUES);
	const maxNumericListSize = 400_000;
	// The user might provide multiple data sets, but internally, the search values will be stored in this one list:
	let concatenatedNumericList = new Uint8Array(maxNumericListSize);

This has a few drawbacks:

• It can take too much memory (and instantiation time) to create the array if the search string won't be that long
• If the search string is very long (over 400k characters, which is an unlikely use-case, but still) we would miss any search value that comes after the 400k chars

We want to investigate how this can be improved.