| Key | Value |
|---|---|
| FileName | ./usr/bin/mkdarts |
| FileSize | 18576 |
| MD5 | 447FB47B88E35F4C7CF6CC86E8649928 |
| SHA-1 | 3B83BE06B7467F469F728D288CD6FE667A9850CC |
| SHA-256 | 999B4D801C2A247A47B8AE991A1489F9E5FF8C00DE26AC2F5C67F818F2E42FF0 |
| SSDEEP | 384:ZXn6fuoTCWqoqTLfy2eeuCXyZ1d2j7W48naksFh57IRWq:B6f7yJLfyakI490cRf |
| TLSH | T1A282B7D7EE22CE6AC4F47F3496DB4B75A33B2866A7C95A1CFB5CD7120C437400A25A90 |
| 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 | 24676 |
| MD5 | E243C25EA30232AC6381EF3A551A59D8 |
| 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 | BDB0A30757011A4D9B0A0D548B551A17DDFCBEF9 |
| SHA-256 | 7E6E87266640AAB88ADF2BFA1CC1998CC7F060B38FD02262E59A9DF6D4CD23DD |