Sifter is a fast and small (<6kb) client and server-side library (coded in TypeScript and available in CJS, UMD, and ESM) for textually searching arrays and hashes of objects by property – or multiple properties. It's designed specifically for autocomplete. The process is three-step: score, filter, sort.
nested.property
).$ npm install @orchidjs/sifter # node.js
import {Sifter} from '@orchidjs/sifter'; var sifter = new Sifter([ {title: 'Annapurna I', location: 'Nepal', continent: 'Asia'}, {title: 'Annapurna II', location: 'Nepal', continent: 'Asia'}, {title: 'Annapurna III', location: 'Nepal', continent: 'Asia'}, {title: 'Eiger', location: 'Switzerland', continent: 'Europe'}, {title: 'Everest', location: 'Nepal', continent: 'Asia'}, {title: 'Gannett', location: 'Wyoming', continent: 'North America'}, {title: 'Denali', location: 'Alaska', continent: 'North America'} ]); var result = sifter.search('anna', { fields: [{field:'title',weight:2}, {field:'location'}, {field:'continent',weight:0.5}], sort: [{field: 'title', direction: 'asc'}], limit: 3 });
Seaching will provide back meta information and an "items" array that contains objects with the index (or key, if searching a hash) and a score that represents how good of a match the item was. Items that did not match will not be returned.
{ score: 0.5757575757575758, id: 0 }, { score: 0.5555555555555555, id: 1 }, { score: 0.5384615384615384, id: 2 }
Items are sorted by best-match, primarily. If two or more items have the same score (which will be the case when searching with an empty string), it will resort to the fields listed in the "sort" option.
The full result comes back in the format of:
{ options: { fields: [{field:"title",weight:2},{field:"location",weight:1}, {field:"continent",weight:0.5}], sort: [ {field: "title", direction: "asc"} ], limit: 3 }, query: "anna", tokens: [{ string: "anna", regex: /[aÀÁÂÃÄÅàáâãäå][nÑñ][nÑñ][aÀÁÂÃÄÅàáâãäå]/ }], total: 3, items: [ { score: 0.5757575757575758, id: 0 }, { score: 0.5555555555555555, id: 1 }, { score: 0.5384615384615384, id: 2 } ] }
Performs a search for query
with the provided options
.
fields
array An array of property names and optional weights to be searched.
fields: [ {field:"title",weight:2}, {field:"location",weight:1}, {field:"continent",weight:0.5} ],
limit
integer The maximum number of results to return. sort
array|function An array of fields to sort by. Each item should be an object containing at least a "field"
property. Optionally, direction
can be set to "asc"
or "desc"
. The order of the array defines the sort precedence.
Unless present, a special "$score"
property will be automatically added to the beginning of the sort list. This will make results sorted primarily by match quality (descending).
Alternatively, you can define a callback function to handle sorting. For example:
sort: function(a,b){ var item_a = this.items[a.id]; var item_b = this.items[b.id]; return item_a.fielda.localeCompare(item_b.fielda); },
sort_empty
array Optional. Defaults to "sort" setting. If provided, these sort settings are used when no query is present. filter
boolean If false
, items with a score of zero will not be filtered out of the result-set. conjunction
string Determines how multiple search terms are joined ("and"
or "or"
, defaults to "or"
). nesting
boolean If true
, nested fields will be available for search and sort using dot-notation to reference them (e.g. nested.property
)
respect_word_boundaries
boolean If true
, matches only at start of word boundaries (e.g. the beginning of words, instead of matching the middle of words)
Install the dependencies that are required to build and test:
Build from typescript
Run tests
Copyright © 2013–2021 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.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4