mirror of
https://github.com/philomena-dev/philomena.git
synced 2025-02-22 05:13:09 +01:00
Fixed local autocompleter returning aliases even when tag is matched by prefix
Patch from @liamwhite
This commit is contained in:
parent
988ba6b019
commit
235d7ab362
2 changed files with 24 additions and 9 deletions
|
@ -100,6 +100,13 @@ export class LocalAutocompleter {
|
||||||
return tagPointer;
|
return tagPointer;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
/**
|
||||||
|
* Return whether the tag pointed to by the reference index is an alias.
|
||||||
|
*/
|
||||||
|
private tagReferenceIsAlias(i: TagReferenceIndex): boolean {
|
||||||
|
return this.view.getInt32(this.referenceStart + i * 8 + 4, true) < 0;
|
||||||
|
}
|
||||||
|
|
||||||
/**
|
/**
|
||||||
* Get the images count for the given reference index.
|
* Get the images count for the given reference index.
|
||||||
*/
|
*/
|
||||||
|
@ -173,6 +180,7 @@ export class LocalAutocompleter {
|
||||||
getResult: (i: number) => TagReferenceIndex,
|
getResult: (i: number) => TagReferenceIndex,
|
||||||
compare: (result: TagReferenceIndex) => number,
|
compare: (result: TagReferenceIndex) => number,
|
||||||
hasFilteredAssociation: (result: TagReferenceIndex) => boolean,
|
hasFilteredAssociation: (result: TagReferenceIndex) => boolean,
|
||||||
|
isAlias: (result: TagReferenceIndex) => boolean,
|
||||||
results: UniqueHeap<TagReferenceIndex>,
|
results: UniqueHeap<TagReferenceIndex>,
|
||||||
) {
|
) {
|
||||||
const filter = !store.get('unfilter_tag_suggestions');
|
const filter = !store.get('unfilter_tag_suggestions');
|
||||||
|
@ -207,7 +215,7 @@ export class LocalAutocompleter {
|
||||||
}
|
}
|
||||||
|
|
||||||
// Nothing was filtered, so add
|
// Nothing was filtered, so add
|
||||||
results.append(referenceIndex);
|
results.append(referenceIndex, !isAlias(referenceIndex));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -230,18 +238,19 @@ export class LocalAutocompleter {
|
||||||
// Set up filter context
|
// Set up filter context
|
||||||
const hiddenTags = new Set(window.booru.hiddenTagList);
|
const hiddenTags = new Set(window.booru.hiddenTagList);
|
||||||
const hasFilteredAssociation = this.isFilteredByReference.bind(this, hiddenTags);
|
const hasFilteredAssociation = this.isFilteredByReference.bind(this, hiddenTags);
|
||||||
|
const isAlias = this.tagReferenceIsAlias.bind(this);
|
||||||
|
|
||||||
// Find tags ordered by full name
|
// Find tags ordered by full name
|
||||||
const prefixMatch = (i: TagReferenceIndex) =>
|
const prefixMatch = (i: TagReferenceIndex) =>
|
||||||
strcmp(this.referenceToName(i, false).slice(0, prefix.length), prefix);
|
strcmp(this.referenceToName(i, false).slice(0, prefix.length), prefix);
|
||||||
const referenceToNameIndex = (i: number) => i;
|
const referenceToNameIndex = (i: number) => i;
|
||||||
this.scanResults(referenceToNameIndex, prefixMatch, hasFilteredAssociation, results);
|
this.scanResults(referenceToNameIndex, prefixMatch, hasFilteredAssociation, isAlias, results);
|
||||||
|
|
||||||
// Find tags ordered by name in namespace
|
// Find tags ordered by name in namespace
|
||||||
const namespaceMatch = (i: TagReferenceIndex) =>
|
const namespaceMatch = (i: TagReferenceIndex) =>
|
||||||
strcmp(nameInNamespace(this.referenceToName(i, false)).slice(0, prefix.length), prefix);
|
strcmp(nameInNamespace(this.referenceToName(i, false)).slice(0, prefix.length), prefix);
|
||||||
const referenceToAliasIndex = this.getSecondaryResultAt.bind(this);
|
const referenceToAliasIndex = this.getSecondaryResultAt.bind(this);
|
||||||
this.scanResults(referenceToAliasIndex, namespaceMatch, hasFilteredAssociation, results);
|
this.scanResults(referenceToAliasIndex, namespaceMatch, hasFilteredAssociation, isAlias, results);
|
||||||
|
|
||||||
// Convert top K from heap into result array
|
// Convert top K from heap into result array
|
||||||
return results.topK(k).map((i: TagReferenceIndex) => ({
|
return results.topK(k).map((i: TagReferenceIndex) => ({
|
||||||
|
|
|
@ -1,28 +1,34 @@
|
||||||
export type Compare<T> = (a: T, b: T) => number;
|
export type Compare<T> = (a: T, b: T) => number;
|
||||||
export type Unique<T> = (a: T) => unknown;
|
export type Unique<T> = (a: T) => unknown;
|
||||||
export type Collection<T> = { [index: number]: T; length: number };
|
export type Collection<T> = {
|
||||||
|
[index: number]: T;
|
||||||
|
length: number;
|
||||||
|
};
|
||||||
|
|
||||||
export class UniqueHeap<T> {
|
export class UniqueHeap<T> {
|
||||||
private keys: Set<unknown>;
|
private keys: Map<unknown, number>;
|
||||||
private values: Collection<T>;
|
private values: Collection<T>;
|
||||||
private length: number;
|
private length: number;
|
||||||
private compare: Compare<T>;
|
private compare: Compare<T>;
|
||||||
private unique: Unique<T>;
|
private unique: Unique<T>;
|
||||||
|
|
||||||
constructor(compare: Compare<T>, unique: Unique<T>, values: Collection<T>) {
|
constructor(compare: Compare<T>, unique: Unique<T>, values: Collection<T>) {
|
||||||
this.keys = new Set();
|
this.keys = new Map();
|
||||||
this.values = values;
|
this.values = values;
|
||||||
this.length = 0;
|
this.length = 0;
|
||||||
this.compare = compare;
|
this.compare = compare;
|
||||||
this.unique = unique;
|
this.unique = unique;
|
||||||
}
|
}
|
||||||
|
|
||||||
append(value: T) {
|
append(value: T, forceReplace: boolean = false) {
|
||||||
const key = this.unique(value);
|
const key = this.unique(value);
|
||||||
|
const prevIndex = this.keys.get(key);
|
||||||
|
|
||||||
if (!this.keys.has(key)) {
|
if (prevIndex === undefined) {
|
||||||
this.keys.add(key);
|
this.keys.set(key, this.length);
|
||||||
this.values[this.length++] = value;
|
this.values[this.length++] = value;
|
||||||
|
} else if (forceReplace) {
|
||||||
|
this.values[prevIndex] = value;
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in a new issue