| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 9740 |
| MD5 | 0EAB8DC130C64DEED5D70CEAA8BBBFE4 |
| SHA-1 | C5983472051EA1269E5A33649C797D47BD3191F4 |
| SHA-256 | B78D98E0FCD19227FB557B9581218016918DDAEEBBA294E82E87417C6F6B5457 |
| SSDEEP | 96:xxfH051BWBFAzoS4HkdKBUh6Xk+SyHlcPw6JyBYvQY9MjyPHcptCOS58O7GNPS:b0518kcS4EdMk+SXP8YJ9gyPyCO |
| TLSH | T12612D649FAC77D73C8E04BBD24875F0561A1C49B9EEB4B33B20C67600E135A96D0ABC9 |
| 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 | 23860 |
| MD5 | D6CEF833A27F2C1BBFA0EB6FFDCC46E8 |
| 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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | darts |
| PackageSection | devel |
| PackageVersion | 0.32-18 |
| SHA-1 | 9042FDBAD9128A52227BAECECF803CDE9061220A |
| SHA-256 | 73C2A39C4038AB15AEEE560EE8B0FFB7A531DA1ADE319C62AA4565F34354BE19 |