| Key | Value |
|---|---|
| FileName | ./usr/share/doc/darts/changelog.Debian.armhf.gz |
| FileSize | 207 |
| MD5 | 4F60E3D7216E9ED812C3D38D6034F711 |
| SHA-1 | 182BEAE14BE59AA919F85730F30A0FD8C06284E6 |
| SHA-256 | 49A5C2057152792FA05DB4C096161931953FB05167D972505F5DA030440FFB22 |
| SSDEEP | 6:XtjZta902gfWQWA6/A+K0KPLUQ8j43xbp4D3P:XFZtU047I9YvOxb2T |
| TLSH | T1B8D022C8E9518B27E20409B261E2803CC2284AB3C4B8F4949A2F444724BC4AEE6629E2 |
| hashlookup:parent-total | 1 |
| hashlookup:trust | 55 |
The searched file hash is included in 1 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 24826 |
| MD5 | 29A29AC38D3230F915966FA090C6E927 |
| PackageDescription | C++ Template Library for implementation of Double-Array Darts is simple C++ Template Library for implementation of Double-Array Structure. . A double-array structure is a kind of Trie structure, digital search tree, an efficient data structure combining fast access of a matrix form with the compactness of a list form. It is faster than other implementations like Hash tree, Patricia tree, Suffix Array and so. . For more detail about double-array structure, see "Aoe, J. An Efficient Digital Search Algorithm by Using a Double-Array Structure. IEEE Transactions on Software Engineering. Vol. 15, 9 (Sep 1989). pp. 1066-1077." . This software provides indexing operations for Common Prefix Search. Darts is used for MeCab and ChaSen, Japanese Morphological Analysis System. |
| PackageMaintainer | Natural Language Processing, Japanese <pkg-nlp-ja-devel@lists.alioth.debian.org> |
| PackageName | darts |
| PackageSection | devel |
| PackageVersion | 0.32-14+b1 |
| SHA-1 | D85E4A1162D4902D5321249F82284A6507487CB1 |
| SHA-256 | F6633E2637E410270FA3A8094554AD8A8E986B433C1549CAC2810A2EBA991E84 |