| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 14504 |
| MD5 | 2FC2F923B3E4EFB9942B17E69F3E18FA |
| SHA-1 | C9917590B736A0F1B4BBB4E958CCE500B0969EE9 |
| SHA-256 | 062F621AA283B8D22AE78A921A7C81EF081956D383EB6109006EB04A7E1F3659 |
| SSDEEP | 384:fnnzhXkrDxj3o+bZ6CPsCVZ8Mef79SBMREJAC9E7ZIvEw92hHt:fz94Vj3o+bZ6ks48Mef79SBMREmC9uZR |
| TLSH | T13D529513FF414DBBC4CACF34006FD70292AEC905C69767ABB058DA447E81A7A4C8769C |
| 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 | 26302 |
| MD5 | 8631110936D2AF76360302C5D65FFA82 |
| 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 | D44CE9AA4EB3FB9AA544AC36FEC6EE2A6BF7AF80 |
| SHA-256 | F8B8285DEE632F94310343DE60D50464C8034CA87AFAD86580DA083BDB09E190 |