| Key | Value |
|---|---|
| FileName | ./usr/share/doc/golang-github-lithammer-fuzzysearch-dev/copyright |
| FileSize | 1477 |
| MD5 | BE5121EA85C7D9E6339CCCC90E3A35E7 |
| SHA-1 | 7B865CAEFAEFCEE715CC801518E62050C06735DB |
| SHA-256 | B686796B2DF441A2B9ACCAC93872DAAC5E8B9201CF5D3B5003111D1EFC4E022E |
| SSDEEP | 24:gttwomp0JHxH+yPP3uPEA6HG1hh9QH+sUu8Ok4UxdjNo3Fqvqy2Fr:jo60J5PPv2ECLQH+shILXj23wn2Fr |
| TLSH | T11C31C90AB6D04B7216E613F069B5BCC5B32B711B75FF6BC5447EE201171A82C81F7854 |
| hashlookup:parent-total | 2 |
| hashlookup:trust | 60 |
The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 7360 |
| MD5 | 3D95BE297C1B0367DF27D4ED3CAD9D00 |
| PackageDescription | FuzzySearch provides tiny and fast fuzzy search Fuzzy searching allows for flexibly matching a string with partial input, useful for filtering data very quickly based on lightweight user input . Inspired by bevacqua/fuzzysearch (https://github.com/bevacqua/fuzzysearch), a fuzzy matching library written in JavaScript. But contains some extras like ranking using Levenshtein distance (http://en.wikipedia.org/wiki/Levenshtein_distance) (see RankMatch() (https://godoc.org/github.com/lithammer/fuzzysearch/fuzzy#RankMatch)) and finding matches in a list of words (see Find() (https://godoc.org/github.com/lithammer/fuzzysearch/fuzzy#Find)). . The current implementation uses the algorithm suggested by Mr. Aleph, a Russian compiler engineer working at V8 |
| PackageMaintainer | Debian Go Packaging Team <team+pkg-go@tracker.debian.org> |
| PackageName | golang-github-lithammer-fuzzysearch-dev |
| PackageSection | golang |
| PackageVersion | 1.1.2-1 |
| SHA-1 | F2FE3E84D5B83AC9CA7B59318CD26A5633ACBEE5 |
| SHA-256 | CC878C6107143456D30CEA8748CADD2209F9750B52C39C7D11BB5EB82DEACB1A |
| Key | Value |
|---|---|
| FileSize | 7412 |
| MD5 | 96DC8B14E7C10E9BBE48ABA75E68C8C3 |
| PackageDescription | FuzzySearch provides tiny and fast fuzzy search Fuzzy searching allows for flexibly matching a string with partial input, useful for filtering data very quickly based on lightweight user input . Inspired by bevacqua/fuzzysearch (https://github.com/bevacqua/fuzzysearch), a fuzzy matching library written in JavaScript. But contains some extras like ranking using Levenshtein distance (http://en.wikipedia.org/wiki/Levenshtein_distance) (see RankMatch() (https://godoc.org/github.com/lithammer/fuzzysearch/fuzzy#RankMatch)) and finding matches in a list of words (see Find() (https://godoc.org/github.com/lithammer/fuzzysearch/fuzzy#Find)). . The current implementation uses the algorithm suggested by Mr. Aleph, a Russian compiler engineer working at V8 |
| PackageMaintainer | Debian Go Packaging Team <team+pkg-go@tracker.debian.org> |
| PackageName | golang-github-lithammer-fuzzysearch-dev |
| PackageSection | golang |
| PackageVersion | 1.1.3-1 |
| SHA-1 | A913A44C272336D7D72C1406DD4B79DADA32CC61 |
| SHA-256 | DCF980A60877F97831D9B2E1372EEADC3BFE1FDFD8B4FAAC1DC8898935D6C7E4 |