File: control

package info (click to toggle)
libjs-sifter.js 0.5.1%2Bdfsg-2
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 568 kB
  • ctags: 136
  • sloc: makefile: 53
file content (44 lines) | stat: -rw-r--r-- 1,812 bytes parent folder | download
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
Source: libjs-sifter.js
Section: web
Priority: optional
Maintainer: Debian Javascript Maintainers <pkg-javascript-devel@lists.alioth.debian.org>
Uploaders: Sergio Durigan Junior <sergiodj@sergiodj.net>
Build-Depends: debhelper (>=9), yui-compressor, mocha
Standards-Version: 3.9.8
Homepage: https://github.com/brianreavis/sifter.js
Vcs-Git: https://anonscm.debian.org/git/pkg-javascript/libjs-sifter.js.git
Vcs-Browser: https://anonscm.debian.org/cgit/pkg-javascript/libjs-sifter.js.git

Package: libjs-sifter.js
Architecture: all
Depends: ${misc:Depends}
Description: Library for textually searching arrays and hashes of objects
 Sifter is a client and server-side library (via UMD) 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.
 .
  * Supports díåcritîçs.
 .
    For example, if searching for "montana" and an item in the set has
    a value of "montaña", it will still be matched. Sorting will also
    play nicely with diacritics.
 .
  * Smart scoring.
 .
     Items are scored / sorted intelligently depending on where a
     match is found in the string (how close to the beginning) and
     what percentage of the string matches.
 .
  * Multi-field sorting.
 .
     When scores aren't enough to go by – like when getting results
     for an empty query – it can sort by one or more fields. For
     example, sort by a person's first name and last name without
     actually merging the properties to a single string.
 .
  * Nested properties.
 .
     Allows one to search and sort on nested properties so you can
     perform search on complex objects without flattening them simply
     by using dot-notation to reference fields (ie. nested.property).