mirror of
https://github.com/nextapps-de/flexsearch.git
synced 2025-10-04 00:51:52 +02:00
bundle pre-release
This commit is contained in:
Thomas Wilkerling
442
dist/module-debug/document/search.js
vendored
Normal file
442
dist/module-debug/document/search.js
vendored
Normal file
@@ -0,0 +1,442 @@
|
||||
|
||||
|
||||
import { DocumentSearchOptions } from "../type.js";
|
||||
import { create_object, is_array, is_object, is_string } from "../common.js";
|
||||
import { intersect_union } from "../intersect.js";
|
||||
import Document from "../document.js";
|
||||
|
||||
let debug = /* suggest */ /* append: */ /* enrich */!1;
|
||||
|
||||
/**
|
||||
* @param {!string|DocumentSearchOptions} query
|
||||
* @param {number|DocumentSearchOptions=} limit
|
||||
* @param {DocumentSearchOptions=} options
|
||||
* @param {Array<Array>=} _resolve For internal use only.
|
||||
* @returns {Promise|Array}
|
||||
*/
|
||||
|
||||
Document.prototype.search = function (query, limit, options, _resolve) {
|
||||
|
||||
if (!options) {
|
||||
if (!limit && is_object(query)) {
|
||||
options = /** @type {DocumentSearchOptions} */query;
|
||||
query = "";
|
||||
} else if (is_object(limit)) {
|
||||
options = /** @type {DocumentSearchOptions} */limit;
|
||||
limit = 0;
|
||||
}
|
||||
}
|
||||
|
||||
let result = [],
|
||||
result_field = [],
|
||||
pluck,
|
||||
enrich,
|
||||
merge,
|
||||
suggest,
|
||||
field,
|
||||
tag,
|
||||
offset,
|
||||
count = 0;
|
||||
|
||||
|
||||
if (options) {
|
||||
|
||||
// todo remove support?
|
||||
if (is_array(options)) {
|
||||
field = options;
|
||||
options = null;
|
||||
} else {
|
||||
|
||||
query = options.query || query;
|
||||
pluck = options.pluck;
|
||||
merge = options.merge;
|
||||
field = pluck || options.field || options.index;
|
||||
tag = this.tag && options.tag;
|
||||
enrich = this.store && options.enrich;
|
||||
suggest = options.suggest;
|
||||
limit = options.limit || limit;
|
||||
offset = options.offset || 0;
|
||||
limit || (limit = 100);
|
||||
|
||||
if (tag && (!this.db || !_resolve)) {
|
||||
|
||||
if (tag.constructor !== Array) {
|
||||
tag = [tag];
|
||||
}
|
||||
|
||||
// Tag-Search
|
||||
// -----------------------------
|
||||
|
||||
let pairs = [];
|
||||
|
||||
for (let i = 0, field; i < tag.length; i++) {
|
||||
field = tag[i];
|
||||
if (is_string(field)) {
|
||||
throw new Error("A tag option can't be a string, instead it needs a { field: tag } format.");
|
||||
}
|
||||
// default array notation
|
||||
if (field.field && field.tag) {
|
||||
const value = field.tag;
|
||||
if (value.constructor === Array) {
|
||||
for (let k = 0; k < value.length; k++) {
|
||||
pairs.push(field.field, value[k]);
|
||||
}
|
||||
} else {
|
||||
pairs.push(field.field, value);
|
||||
}
|
||||
}
|
||||
// shorter object notation
|
||||
else {
|
||||
const keys = Object.keys(field);
|
||||
for (let j = 0, key, value; j < keys.length; j++) {
|
||||
key = keys[j];
|
||||
value = field[key];
|
||||
if (value.constructor === Array) {
|
||||
for (let k = 0; k < value.length; k++) {
|
||||
pairs.push(key, value[k]);
|
||||
}
|
||||
} else {
|
||||
pairs.push(key, value);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (!pairs.length) {
|
||||
throw new Error("Your tag definition within the search options is probably wrong. No valid tags found.");
|
||||
}
|
||||
|
||||
// tag used as pairs from this point
|
||||
tag = pairs;
|
||||
|
||||
// when tags is used and no query was set,
|
||||
// then just return the tag indexes
|
||||
if (!query) {
|
||||
|
||||
let promises = [];
|
||||
if (pairs.length) for (let j = 0; j < pairs.length; j += 2) {
|
||||
let ids;
|
||||
if (this.db) {
|
||||
const index = this.index.get(pairs[j]);
|
||||
if (!index) {
|
||||
console.warn("Tag '" + pairs[j] + ":" + pairs[j + 1] + "' will be skipped because there is no field '" + pairs[j] + "'.");
|
||||
|
||||
continue;
|
||||
}
|
||||
|
||||
promises.push(ids = index.db.tag(pairs[j + 1], limit, offset, enrich));
|
||||
} else {
|
||||
ids = get_tag.call(this, pairs[j], pairs[j + 1], limit, offset, enrich);
|
||||
}
|
||||
result.push({
|
||||
field: pairs[j],
|
||||
tag: pairs[j + 1],
|
||||
result: ids
|
||||
});
|
||||
}
|
||||
|
||||
if (promises.length) {
|
||||
return Promise.all(promises).then(function (promises) {
|
||||
for (let j = 0; j < promises.length; j++) {
|
||||
result[j].result = promises[j];
|
||||
}
|
||||
return result;
|
||||
});
|
||||
}
|
||||
|
||||
return result;
|
||||
}
|
||||
}
|
||||
|
||||
// extend to multi field search by default
|
||||
if (is_string(field)) {
|
||||
field = [field];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
field || (field = this.field);
|
||||
let promises = !_resolve && (this.worker || this.async) && [],
|
||||
db_tag_search;
|
||||
|
||||
|
||||
// multi field search
|
||||
// field could be a custom set of selected fields by this query
|
||||
// db tag indexes are also included in this field list
|
||||
for (let i = 0, res, key, len; i < field.length; i++) {
|
||||
|
||||
key = field[i];
|
||||
|
||||
if (this.db && this.tag) {
|
||||
// tree is missing when it is a tag-only index (db)
|
||||
if (!this.tree[i]) {
|
||||
continue;
|
||||
}
|
||||
}
|
||||
|
||||
let field_options;
|
||||
|
||||
if (!is_string(key)) {
|
||||
field_options = key;
|
||||
key = field_options.field;
|
||||
query = field_options.query || query;
|
||||
limit = field_options.limit || limit;
|
||||
//offset = field_options.offset || offset;
|
||||
suggest = field_options.suggest || suggest;
|
||||
//enrich = SUPPORT_STORE && this.store && (field_options.enrich || enrich);
|
||||
}
|
||||
|
||||
if (_resolve) {
|
||||
res = _resolve[i];
|
||||
} else {
|
||||
let opt = field_options || options,
|
||||
index = this.index.get(key);
|
||||
|
||||
|
||||
if (tag) {
|
||||
if (this.db) {
|
||||
opt.tag = tag;
|
||||
db_tag_search = index.db.support_tag_search;
|
||||
opt.field = field;
|
||||
}
|
||||
if (!db_tag_search) {
|
||||
opt.enrich = !1;
|
||||
}
|
||||
}
|
||||
if (promises) {
|
||||
promises[i] = index.searchAsync(query, limit, opt);
|
||||
// restore enrich state
|
||||
opt && enrich && (opt.enrich = enrich);
|
||||
// just collect and continue
|
||||
continue;
|
||||
} else {
|
||||
res = index.search(query, limit, opt);
|
||||
// restore enrich state
|
||||
opt && enrich && (opt.enrich = enrich);
|
||||
}
|
||||
}
|
||||
|
||||
len = res && res.length;
|
||||
|
||||
// todo when no term was matched but tag was retrieved extend suggestion to tags
|
||||
// every field has to intersect against all selected tag fields
|
||||
if (tag && len) {
|
||||
|
||||
const arr = [];
|
||||
let count = 0;
|
||||
|
||||
// tags are only applied in resolve phase when it's a db
|
||||
if (this.db && _resolve) {
|
||||
if (!db_tag_search) {
|
||||
|
||||
// retrieve tag results assigned to it's field
|
||||
for (let y = field.length; y < _resolve.length; y++) {
|
||||
let ids = _resolve[y],
|
||||
len = ids && ids.length;
|
||||
|
||||
|
||||
if (len) {
|
||||
count++;
|
||||
arr.push(ids);
|
||||
} else if (!suggest) {
|
||||
// no tags found
|
||||
return result;
|
||||
}
|
||||
}
|
||||
}
|
||||
} else {
|
||||
|
||||
// tag[] are pairs at this line
|
||||
for (let y = 0, ids, len; y < tag.length; y += 2) {
|
||||
ids = this.tag.get(tag[y]);
|
||||
|
||||
if (!ids) {
|
||||
console.warn("Tag '" + tag[y] + ":" + tag[y + 1] + "' will be skipped because there is no field '" + tag[y] + "'.");
|
||||
|
||||
if (suggest) {
|
||||
continue;
|
||||
} else {
|
||||
return result;
|
||||
}
|
||||
}
|
||||
|
||||
ids = ids && ids.get(tag[y + 1]);
|
||||
len = ids && ids.length;
|
||||
|
||||
if (len) {
|
||||
count++;
|
||||
arr.push(ids);
|
||||
} else if (!suggest) {
|
||||
// no tags found
|
||||
return result;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (count) {
|
||||
res = intersect_union(res, arr); // intersect(arr, limit, offset)
|
||||
len = res.length;
|
||||
if (!len && !suggest) {
|
||||
// nothing matched
|
||||
return result;
|
||||
}
|
||||
// move counter back by 1
|
||||
count--;
|
||||
}
|
||||
}
|
||||
|
||||
if (len) {
|
||||
result_field[count] = key;
|
||||
result.push(res);
|
||||
count++;
|
||||
} else if (1 === field.length) {
|
||||
// fast path: nothing matched
|
||||
return result;
|
||||
}
|
||||
}
|
||||
|
||||
if (promises) {
|
||||
if (this.db) {
|
||||
// todo when a tag index is never a search index this could be extracted
|
||||
// push tag promises to the end
|
||||
if (tag && tag.length && !db_tag_search) {
|
||||
for (let y = 0; y < tag.length; y += 2) {
|
||||
// it needs to retrieve data from tag pairs
|
||||
const index = this.index.get(tag[y]);
|
||||
if (!index) {
|
||||
console.warn("Tag '" + tag[y] + ":" + tag[y + 1] + "' was not found because there is no field '" + tag[y] + "'.");
|
||||
|
||||
if (suggest) {
|
||||
continue;
|
||||
} else {
|
||||
return result;
|
||||
}
|
||||
}
|
||||
|
||||
promises.push(index.db.tag(tag[y + 1], limit, offset, !1));
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
const self = this;
|
||||
|
||||
// TODO unroll this recursion
|
||||
return Promise.all(promises).then(function (result) {
|
||||
return result.length ? self.search(query, limit, options, /* resolve: */result) : result;
|
||||
});
|
||||
}
|
||||
|
||||
if (!count) {
|
||||
return result;
|
||||
}
|
||||
if (pluck && (!enrich || !this.store)) {
|
||||
return result[0];
|
||||
}
|
||||
|
||||
promises = [];
|
||||
|
||||
for (let i = 0, res; i < result_field.length; i++) {
|
||||
|
||||
res = result[i];
|
||||
|
||||
if (enrich && res.length && !res[0].doc) {
|
||||
if (!this.db) {
|
||||
if (res.length) {
|
||||
res = apply_enrich.call(this, res);
|
||||
}
|
||||
} else {
|
||||
promises.push(res = this.index.get(this.field[0]).db.enrich(res));
|
||||
}
|
||||
}
|
||||
|
||||
if (pluck) {
|
||||
return res;
|
||||
}
|
||||
|
||||
result[i] = {
|
||||
field: result_field[i],
|
||||
result: res
|
||||
};
|
||||
}
|
||||
|
||||
if (enrich && /* tag? */ /* stringify */ /* stringify */ /* skip update: */ /* append: */ /* skip update: */ /* skip_update: */!0 /*await rows.hasNext()*/ /*await rows.hasNext()*/ /*await rows.hasNext()*/ && this.db && promises.length) {
|
||||
return Promise.all(promises).then(function (promises) {
|
||||
for (let j = 0; j < promises.length; j++) {
|
||||
result[j].result = promises[j];
|
||||
}
|
||||
return merge ? merge_fields(result, limit, offset) : result;
|
||||
});
|
||||
}
|
||||
|
||||
return merge ? merge_fields(result, limit, offset) : result;
|
||||
};
|
||||
|
||||
// todo support Resolver
|
||||
// todo when searching through multiple fields each term should
|
||||
// be found at least by one field to get a valid match without
|
||||
// using suggestion explicitly
|
||||
|
||||
function merge_fields(fields, limit) {
|
||||
const final = [],
|
||||
set = create_object();
|
||||
|
||||
for (let i = 0, field, res; i < fields.length; i++) {
|
||||
field = fields[i];
|
||||
res = field.result;
|
||||
for (let j = 0, id, entry, tmp; j < res.length; j++) {
|
||||
entry = res[j];
|
||||
id = entry.id;
|
||||
tmp = set[id];
|
||||
if (!tmp) {
|
||||
// offset was already applied on field indexes
|
||||
// if(offset){
|
||||
// offset--;
|
||||
// continue;
|
||||
// }
|
||||
// apply limit from last round, because just fields could
|
||||
// be pushed without adding new results
|
||||
if (final.length === limit) {
|
||||
return final;
|
||||
}
|
||||
entry.field = set[id] = [field.field];
|
||||
final.push(entry);
|
||||
} else {
|
||||
tmp.push(field.field);
|
||||
}
|
||||
}
|
||||
}
|
||||
return final;
|
||||
}
|
||||
|
||||
/**
|
||||
* @this Document
|
||||
*/
|
||||
|
||||
function get_tag(tag, key, limit, offset) {
|
||||
let res = this.tag.get(tag);
|
||||
if (!res) {
|
||||
console.warn("Tag '" + tag + "' was not found");
|
||||
return [];
|
||||
}
|
||||
res = res && res.get(key);
|
||||
res && res.length - offset;
|
||||
}
|
||||
|
||||
/**
|
||||
* @this Document
|
||||
*/
|
||||
|
||||
function apply_enrich(res) {
|
||||
|
||||
const arr = Array(res.length);
|
||||
|
||||
for (let x = 0, id; x < res.length; x++) {
|
||||
id = res[x];
|
||||
arr[x] = {
|
||||
id: id,
|
||||
doc: this.store.get(id)
|
||||
};
|
||||
}
|
||||
|
||||
return arr;
|
||||
}
|
||||
Reference in New Issue
Block a user