| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 13788 |
| MD5 | 9140D729581B8F1C8A8B74FEB551D36C |
| SHA-1 | B99F823FE5D024A78A373CB1A1ACA5B9A80B7BF4 |
| SHA-256 | 196D4043E7808CDE6C4035867B53B26EA8A2B0D8C2C1909A98E6FB9BABD6A9AB |
| SSDEEP | 192:TP8ocS4tSC8lcX3Qgc2EwvTwLiFNRPUe1+/jrPGyg5Lw7Kz:TxcS487leggTvTWiFc/j6f5L1 |
| TLSH | T19552E60BBF96E933D1D20B3454478B649031D4319E63C3A3BB08376BA4A32989F59B76 |
| 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 | 27016 |
| MD5 | 932D6BA67E119623E1E33AD85092FC25 |
| 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) <team+pkg-nlp-ja@tracker.debian.org> |
| PackageName | darts |
| PackageSection | devel |
| PackageVersion | 0.32-19 |
| SHA-1 | 50F27EDB313D959F0D534E28C38EB4583245F2B5 |
| SHA-256 | D2D413A3131ABB5FE07BD18B10DF77D786F65D35C39F17153ECC416F1A9F2D4C |