Key | Value |
---|---|
FileName | ./usr/bin/mkdarts |
FileSize | 18804 |
MD5 | 5A3CD0828CEDFA579906D670A82451DD |
SHA-1 | 2D9264B2CAEA38450AFDE22266602E5C6DB6972A |
SHA-256 | E28C7D3BD5886DE318A5BBB0D57D74A41433FEDF54BBCD618ABE9CC4D55B485B |
SSDEEP | 384:MV0ux77bf/yx+Mmba54cvcMsKHq0HIDep8HDm6Q:Vkbf/tDcvcZtwwmh |
TLSH | T1768209173B119E7EF5AAC33D90A787A092D0A2B3ADD24D66D33DF2041F6820D545BF98 |
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 | 26104 |
MD5 | D29014C808EC176E0C52E39EFF05399B |
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 | 5A6CAE9D8937178A2E759C6E5494A474245B0BB5 |
SHA-256 | 886B8A0FE5BE1C566DB6D8C51ED64EADCEE993DD66365191CFB4C6F7C2E4B323 |