fix(scoring): normalise key weights in object and keyless-logical search

_searchObjectList and the keyless branch of _searchLogical scored off
FuseIndex.keys, which holds the raw user-supplied weights. Only KeyStore
normalises weights to sum to 1, so large weights pushed
Math.pow(Number.EPSILON, weight * norm) to underflow to 0, and absolute
scores diverged between plain-string, keyed-logical, and keyless-logical
queries over identical data.

Add _normalizedKeys(), which resolves each index key to its normalised
KeyStore counterpart by id, kept aligned to positional item[keyIndex] so
a pre-built index whose key order differs from options.keys still scores
correctly. Use it in both scoring paths, matching how the keyed logical
path already reads from the KeyStore.

Result ordering is unchanged (normalised score = raw^(1/T) for a global
constant T); only absolute scores for weights that do not sum to 1 shift,
and underflow is eliminated.

Closes #833

Author: krisk

dist/fuse.basic.cjs

@@ -993,6 +993,9 @@ var Fuse = class {
 	getIndex() {
 		return this._myIndex;
 	}
+	_normalizedKeys() {
+		return this._myIndex.keys.map((key) => this._keyStore.get(key.id) || key);
+	}
 	search(query, options) {
 		const { limit = -1 } = options || {};
 		const { includeMatches, includeScore, shouldSort, sortFn, ignoreFieldNorm } = this.options;
@@ -1070,7 +1073,8 @@ var Fuse = class {
 	_searchObjectList(query, { heap, ignoreFieldNorm } = {}) {
 		const searcher = this._getSearcher(query);
 		const requireAllTokens = this.options.useTokenSearch && this.options.tokenMatch === "all";
-		const { keys, records } = this._myIndex;
+		const { records } = this._myIndex;
+		const keys = this._normalizedKeys();
 		const results = heap ? null : [];
 		records.forEach(({ $: item, i: idx }) => {
 			if (!isDefined(item)) return;

dist/fuse.basic.min.cjs

@@ -992,6 +992,9 @@ var Fuse = class {
 	getIndex() {
 		return this._myIndex;
 	}
+	_normalizedKeys() {
+		return this._myIndex.keys.map((key) => this._keyStore.get(key.id) || key);
+	}
 	search(query, options) {
 		const { limit = -1 } = options || {};
 		const { includeMatches, includeScore, shouldSort, sortFn, ignoreFieldNorm } = this.options;
@@ -1069,7 +1072,8 @@ var Fuse = class {
 	_searchObjectList(query, { heap, ignoreFieldNorm } = {}) {
 		const searcher = this._getSearcher(query);
 		const requireAllTokens = this.options.useTokenSearch && this.options.tokenMatch === "all";
-		const { keys, records } = this._myIndex;
+		const { records } = this._myIndex;
+		const keys = this._normalizedKeys();
 		const results = heap ? null : [];
 		records.forEach(({ $: item, i: idx }) => {
 			if (!isDefined(item)) return;

dist/fuse.basic.min.mjs

@@ -1374,6 +1374,9 @@ var Fuse = class {
 	getIndex() {
 		return this._myIndex;
 	}
+	_normalizedKeys() {
+		return this._myIndex.keys.map((key) => this._keyStore.get(key.id) || key);
+	}
 	search(query, options) {
 		const { limit = -1 } = options || {};
 		const { includeMatches, includeScore, shouldSort, sortFn, ignoreFieldNorm } = this.options;
@@ -1447,13 +1450,14 @@ var Fuse = class {
 	}
 	_searchLogical(query) {
 		const expression = parse(query, this.options);
+		const keys = this._normalizedKeys();
 		const evaluate = (node, item, idx) => {
 			if (!("children" in node)) {
 				const { keyId, searcher } = node;
 				let matches;
 				if (keyId === null) {
 					matches = [];
-					this._myIndex.keys.forEach((key, keyIndex) => {
+					keys.forEach((key, keyIndex) => {
 						matches.push(...this._findMatches({
 							key,
 							value: item[keyIndex],
@@ -1508,7 +1512,8 @@ var Fuse = class {
 	_searchObjectList(query, { heap, ignoreFieldNorm } = {}) {
 		const searcher = this._getSearcher(query);
 		const requireAllTokens = this.options.useTokenSearch && this.options.tokenMatch === "all";
-		const { keys, records } = this._myIndex;
+		const { records } = this._myIndex;
+		const keys = this._normalizedKeys();
 		const results = heap ? null : [];
 		records.forEach(({ $: item, i: idx }) => {
 			if (!isDefined(item)) return;

dist/fuse.basic.mjs

@@ -335,6 +335,7 @@ declare class Fuse<T> {
   removeAt(idx: number): T;
   _invalidateSearcherCache(): void;
   getIndex(): FuseIndex<T>;
+  _normalizedKeys(): KeyObject[];
   search(query: string | Expression, options?: FuseSearchOptions): FuseResult<T>[];
   _searchStringList(query: string, {
     heap,

dist/fuse.cjs

@@ -335,6 +335,7 @@ declare class Fuse<T> {
   removeAt(idx: number): T;
   _invalidateSearcherCache(): void;
   getIndex(): FuseIndex<T>;
+  _normalizedKeys(): KeyObject[];
   search(query: string | Expression, options?: FuseSearchOptions): FuseResult<T>[];
   _searchStringList(query: string, {
     heap,

dist/fuse.d.cts

@@ -1373,6 +1373,9 @@ var Fuse = class {
 	getIndex() {
 		return this._myIndex;
 	}
+	_normalizedKeys() {
+		return this._myIndex.keys.map((key) => this._keyStore.get(key.id) || key);
+	}
 	search(query, options) {
 		const { limit = -1 } = options || {};
 		const { includeMatches, includeScore, shouldSort, sortFn, ignoreFieldNorm } = this.options;
@@ -1446,13 +1449,14 @@ var Fuse = class {
 	}
 	_searchLogical(query) {
 		const expression = parse(query, this.options);
+		const keys = this._normalizedKeys();
 		const evaluate = (node, item, idx) => {
 			if (!("children" in node)) {
 				const { keyId, searcher } = node;
 				let matches;
 				if (keyId === null) {
 					matches = [];
-					this._myIndex.keys.forEach((key, keyIndex) => {
+					keys.forEach((key, keyIndex) => {
 						matches.push(...this._findMatches({
 							key,
 							value: item[keyIndex],
@@ -1507,7 +1511,8 @@ var Fuse = class {
 	_searchObjectList(query, { heap, ignoreFieldNorm } = {}) {
 		const searcher = this._getSearcher(query);
 		const requireAllTokens = this.options.useTokenSearch && this.options.tokenMatch === "all";
-		const { keys, records } = this._myIndex;
+		const { records } = this._myIndex;
+		const keys = this._normalizedKeys();
 		const results = heap ? null : [];
 		records.forEach(({ $: item, i: idx }) => {
 			if (!isDefined(item)) return;