| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 9864 |
| MD5 | BFF869DBA31F9CC02C4F86B3BA267765 |
| SHA-1 | E7949742C9D6BBD4562DC2B1C804F45753885F41 |
| SHA-256 | 278A41BFBBF11CB0D78DCD2E218565F8D9DFA0F1522DB227AF902D130C6AB897 |
| SSDEEP | 192:tEHE86Wqtcye0Sti3mD3vVJNyOeaGl/a2yYCrD5:t6GWqtcJ0Ei6dJ8OeaD21Cr |
| TLSH | T1DA12A758F6867E73CCE46B35714B0B0863B1DA6BC2DB7B07C51C20581B5B8A94E19F85 |
| 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 | 25284 |
| MD5 | 8A5CECD800C898062D9F5BB31A377D41 |
| 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-20 |
| SHA-1 | D360CB9F49C8174E9687A3FFF673E0505D6D37F8 |
| SHA-256 | 552635C8B905F5B2A68C77575DFEB0AC7D9D493CBC0DB6A8E3F0CC0648BB419A |