| Key | Value |
|---|---|
| FileName | ./usr/bin/mkdarts |
| FileSize | 35400 |
| MD5 | 4DFBD21FEA594CF345C7DF0C2B91AB57 |
| SHA-1 | 354671E7A156160BC7AC25AD8FBCE44EFA756E07 |
| SHA-256 | 29D874796328E332EAE4DFB6C039B0B077252DEECF5E9A80A7C429F3F758110A |
| SSDEEP | 384:L03tt1AcuJy4MMSxGabS/ThjUmH85YxSo5PkkupaynemZzfa7ABZvrzaTT5SDGbc:LCtZh4M4ZUmcSXhipayeUfaSxWc |
| TLSH | T141F2A35367875EFBD42A233283C7639C377BE126939B471B93244A253EA33895F21385 |
| 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 | 34042 |
| MD5 | 6E2F0B94341C43E729FB4891A3D4158A |
| 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 | 9110E39B95937F0F406B3C3446C85D770266E89C |
| SHA-256 | 43E9B6C8437EA00C8399AD1BA35B3E617986ED72499736D4DD2E1BA978071B32 |