Press n or j to go to the next uncovered block, b, p or k for the previous block.
| 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 | 72x 36x 36x 3916x 3906x 3906x 3906x 31x 3906x 3916x 3916x 3916x 3x 3x 3916x 3915x 3915x 3915x 3915x 3916x 3906x 3x 3x 38x 38x 38x 9x 29x 29x 29x 29x 29x 2x 28x 28x 15x 41x 41x 13x 62x 62x 6x 6x 1x 5x 56x 137x 62x 28x 22x 58x 6x 2x 7x 7x 11x 11x 5x 1x 4x 17x 17x 34x 17x 34x 34x 34x 34x 34x 34x 152x 128x 34x 13x 17x 17x 34x 25x 25x 6x 2x 2x 25x 23x 9x 11x 34x 40x 34x 34x 34x 28x 28x 28x 38x 6x 27x 38x 38x 38x 5x 40x 40x 40x 40x 40x 39x 39x 39x 59x 51x 59x 59x 39x 40x 34x 34x 34x 34x 34x 34x 25x 68x 68x 40x 9x 31x 34x 34x 34x 34x 3x 34x | /**
* sifter.js
* Copyright (c) 2013–2020 Brian Reavis & contributors
*
* Licensed under the Apache License, Version 2.0 (the "License"); you may not use this
* file except in compliance with the License. You may obtain a copy of the License at:
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software distributed under
* the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF
* ANY KIND, either express or implied. See the License for the specific language
* governing permissions and limitations under the License.
*
* @author Brian Reavis <brian@thirdroute.com>
*/
// @ts-ignore TS2691 "An import path cannot end with a '.ts' extension"
import { scoreValue, getAttr, getAttrNesting, escape_regex, propToArray, iterate, cmp } from './utils.ts';
// @ts-ignore TS2691 "An import path cannot end with a '.ts' extension"
import { diacriticRegexPoints } from './diacritics.ts';
// @ts-ignore TS2691 "An import path cannot end with a '.ts' extension"
import * as T from 'types.ts';
export default class Sifter{
public items; // []|{};
public settings: T.Settings;
/**
* Textually searches arrays and hashes of objects
* by property (or multiple properties). Designed
* specifically for autocomplete.
*
*/
constructor(items:any, settings:T.Settings) {
this.items = items;
this.settings = settings || {diacritics: true};
};
/**
* Splits a search string into an array of individual
* regexps to be used to match results.
*
*/
tokenize(query:string, respect_word_boundaries?:boolean, weights?:T.Weights ):T.Token[] {
if (!query || !query.length) return [];
const tokens:T.Token[] = [];
const words = query.split(/\s+/);
var field_regex:RegExp;
if( weights ){
field_regex = new RegExp( '^('+ Object.keys(weights).map(escape_regex).join('|')+')\:(.*)$');
}
words.forEach((word:string) => {
let field_match;
let field:null|string = null;
let regex:null|string = null;
// look for "field:query" tokens
if( field_regex && (field_match = word.match(field_regex)) ){
field = field_match[1];
word = field_match[2];
}
if( word.length > 0 ){
regex = escape_regex(word);
Eif( this.settings.diacritics ){
regex = diacriticRegexPoints(regex);
}
if( respect_word_boundaries ) regex = "\\b"+regex;
}
tokens.push({
string : word,
regex : regex ? new RegExp(regex,'iu') : null,
field : field,
});
});
return tokens;
};
/**
* Returns a function to be used to score individual results.
*
* Good matches will have a higher score than poor matches.
* If an item is not a match, 0 will be returned by the function.
*
* @returns {function}
*/
getScoreFunction(query:string, options:T.Options ){
var search = this.prepareSearch(query, options);
return this._getScoreFunction(search);
}
_getScoreFunction(search:T.PrepareObj ){
const tokens = search.tokens,
token_count = tokens.length;
if (!token_count) {
return function() { return 0; };
}
const fields = search.options.fields,
weights = search.weights,
field_count = fields.length,
getAttrFn = search.getAttrFn;
if (!field_count) {
return function() { return 1; };
}
/**
* Calculates the score of an object
* against the search query.
*
*/
const scoreObject = (function() {
if (field_count === 1) {
return function(token:T.Token, data:{}) {
const field = fields[0].field;
return scoreValue(getAttrFn(data, field), token, weights[field]);
};
}
return function(token:T.Token, data:{}) {
var sum = 0;
// is the token specific to a field?
if( token.field ){
const value = getAttrFn(data, token.field);
if( !token.regex && value ){
sum += (1/field_count);
}else{
sum += scoreValue(value, token, 1);
}
}else{
iterate(weights, (weight:number, field:string) => {
sum += scoreValue(getAttrFn(data, field), token, weight);
});
}
return sum / field_count;
};
})();
if (token_count === 1) {
return function(data:{}) {
return scoreObject(tokens[0], data);
};
}
if (search.options.conjunction === 'and') {
return function(data:{}) {
var i = 0, score, sum = 0;
for (; i < token_count; i++) {
score = scoreObject(tokens[i], data);
if (score <= 0) return 0;
sum += score;
}
return sum / token_count;
};
} else {
return function(data:{}) {
var sum = 0;
iterate(tokens,(token:T.Token)=>{
sum += scoreObject(token, data);
});
return sum / token_count;
};
}
};
/**
* Returns a function that can be used to compare two
* results, for sorting purposes. If no sorting should
* be performed, `null` will be returned.
*
* @return function(a,b)
*/
getSortFunction(query:string, options:T.Options) {
var search = this.prepareSearch(query, options);
return this._getSortFunction(search);
}
_getSortFunction(search:T.PrepareObj){
var i, n, implicit_score;
const self = this,
options = search.options,
sort = (!search.query && options.sort_empty) ? options.sort_empty : options.sort,
sort_flds:T.Sort[] = [],
multipliers:number[] = [];
/**
* Fetches the specified sort field value
* from a search result item.
*
*/
const get_field = function(name:string, result:T.ResultItem):string|number {
if (name === '$score') return result.score;
return search.getAttrFn(self.items[result.id], name);
};
// parse options
if (sort) {
for (i = 0, n = sort.length; i < n; i++) {
Eif (search.query || sort[i].field !== '$score') {
sort_flds.push(sort[i]);
}
}
}
// the "$score" field is implied to be the primary
// sort field, unless it's manually specified
if (search.query) {
implicit_score = true;
for (i = 0, n = sort_flds.length; i < n; i++) {
if (sort_flds[i].field === '$score') {
implicit_score = false;
break;
}
}
if (implicit_score) {
sort_flds.unshift({field: '$score', direction: 'desc'});
}
} else {
for (i = 0, n = sort_flds.length; i < n; i++) {
Iif (sort_flds[i].field === '$score') {
sort_flds.splice(i, 1);
break;
}
}
}
for (i = 0, n = sort_flds.length; i < n; i++) {
multipliers.push(sort_flds[i].direction === 'desc' ? -1 : 1);
}
// build function
const sort_flds_count = sort_flds.length;
Iif (!sort_flds_count) {
return null;
} else if (sort_flds_count === 1) {
const sort_fld = sort_flds[0].field;
const multiplier = multipliers[0];
return function(a:T.ResultItem, b:T.ResultItem) {
return multiplier * cmp(
get_field(sort_fld, a),
get_field(sort_fld, b)
);
};
} else {
return function(a:T.ResultItem, b:T.ResultItem) {
var i, result, field;
for (i = 0; i < sort_flds_count; i++) {
field = sort_flds[i].field;
result = multipliers[i] * cmp(
get_field(field, a),
get_field(field, b)
);
if (result) return result;
}
return 0;
};
}
};
/**
* Parses a search query and returns an object
* with tokens and fields ready to be populated
* with results.
*
*/
prepareSearch(query:string, optsUser:T.Options):T.PrepareObj {
const weights:T.Weights = {};
var options = Object.assign({},optsUser);
propToArray(options,'sort');
propToArray(options,'sort_empty');
// convert fields to new format
if( options.fields ){
propToArray(options,'fields');
const fields:T.Field[] = [];
options.fields.forEach((field:string|T.Field) => {
if( typeof field == 'string' ){
field = {field:field,weight:1};
}
fields.push(field);
weights[field.field] = ('weight' in field) ? field.weight : 1;
});
options.fields = fields;
}
return {
options : options,
query : query.toLowerCase().trim(),
tokens : this.tokenize(query, options.respect_word_boundaries, weights),
total : 0,
items : [],
weights : weights,
getAttrFn : (options.nesting) ? getAttrNesting : getAttr,
};
};
/**
* Searches through all items and returns a sorted array of matches.
*
*/
search(query:string, options:T.Options) : T.PrepareObj {
var self = this, score, search:T.PrepareObj;
search = this.prepareSearch(query, options);
options = search.options;
query = search.query;
// generate result scoring function
const fn_score = options.score || self._getScoreFunction(search);
// perform search and sort
if (query.length) {
iterate(self.items, (item:T.ResultItem, id:string|number) => {
score = fn_score(item);
if (options.filter === false || score > 0) {
search.items.push({'score': score, 'id': id});
}
});
} else {
iterate(self.items, (item:T.ResultItem, id:string|number) => {
search.items.push({'score': 1, 'id': id});
});
}
const fn_sort = self._getSortFunction(search);
Eif (fn_sort) search.items.sort(fn_sort);
// apply limits
search.total = search.items.length;
if (typeof options.limit === 'number') {
search.items = search.items.slice(0, options.limit);
}
return search;
};
}
|