| Key | Value |
|---|---|
| FileName | ./usr/bin/mkdarts |
| FileSize | 18092 |
| MD5 | DFF0B5EBE176B411275CCAD9549022A6 |
| SHA-1 | F3ACBDA764DC34019B667DFE7124CEA7C626932B |
| SHA-256 | C915E1DFAA346028299BDC0473F4E6ED2EA98531355B624D0C36A8C70322A0FA |
| SSDEEP | 192:f7DnP1FuRHBebhxk0MVldzuGfYc0/8q6kUtjQByuWOBkQFneMwBff9oZmI/2ZJLr:f7bP1Fu5Bed+0MphS8U6sFwPBfVkYJL |
| TLSH | T135823C53E7C3CCB5C4964B7050A7A33F66305E43EA09CF5BE21CBA66D57A792718AB00 |
| 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 | 28426 |
| MD5 | 9F4A29BFDFC265B5098DAB63E1D4BEC9 |
| 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-7 |
| SHA-1 | DA3F4E6F5A833995C05ED95F4988100265C7C11C |
| SHA-256 | 34C88E2A42CC2151B050A74C480B9EA19334D66AD5724AED48B84BD71768A765 |