Refactor and optimize

[LeeWannacott]

stragers big O video: https://www.youtube.com/watch?v=7VHG6Y2QmtM&t=1s

If 50% of the column doesn't have a regex match we break; if 50% of the column has matches and applied a class we break; .

We also removed an outer loop of the inferSortClasses() function by moving it into the loop that makes each column sortable which is great because if the inferSortClasses() function has a critical failure the column wont become sortable (which improves performance even more)!

I refactored this probably about 5 times trying different approaches sadly I didn't commit them all which could of been interesting to see the different approaches. I settled on this...

Probably a completely premature optimization; that would only effect really massive tables...

[strager]

Suggested change

	if (Object.values(matches).every((match) => match === null)) {
	regexNotFoundCount++;
	continue;
	}
	for (let key of Object.keys(inferableClasses)) {
	if (matches[key] !== null) {
	inferableClasses[key].count++;
	}
	if (isoDatesMatch) {
	isoDatesCounter++;
	if (inferableClasses[key].count >= threshold) {
	th.classList.add(inferableClasses[key].class);
	classNameAdded = true;
	break;
	}
	}
	let foundMatch = false;
	for (let key of Object.keys(inferableClasses)) {
	let classRegexp = inferableClasses[key].regexp;
	if (tableColumn.innerText.match(classRegexp) !== null) {
	foundMatch = true;
	inferableClasses[key].count++;
	}
	if (inferableClasses[key].count >= threshold) {
	th.classList.add(inferableClasses[key].class);
	classNameAdded = true;
	break;
	}
	}
	if (!foundMatch) {
	regexNotFoundCount++;
	continue;
	}