| Key | Value |
|---|---|
| FileName | ./usr/bin/mkdarts |
| FileSize | 9736 |
| MD5 | 7FAC26AA37D3B0CBE84CC7F14F9FC365 |
| SHA-1 | DE15C904D1146928BE86119BA43F4533664374E8 |
| SHA-256 | 494D2E0518B90F2861B493E6E9D5CCEDEE3BAEF1130CDF042AFFBA75D4127EE5 |
| SSDEEP | 192:vCqBX86CEuXdSvnDwMbJvgfy7UwrzFrOIJ7M/yncbW5l:vbtCEuXdSvDwMjxOA7M/y |
| TLSH | T15F120984E7577EB3C8F1533B45931A4B71A1C086929A7B2712DCB0B6BC0B1E95D09FC9 |
| 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 | 25974 |
| MD5 | 4AA735DD16ED4A26EFC137B9C8A00084 |
| 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-11 |
| SHA-1 | 630D160EA1688DFF5B6903056B49B10A578119AF |
| SHA-256 | 0F2F3F376900FA53A09202112105E8EC6EE95E32893FB262E5B014B02E9E1254 |