| Key | Value |
|---|---|
| FileName | ./usr/bin/mkdarts |
| FileSize | 18112 |
| MD5 | 52054D07FE7E2EB9B2CB0460C51A0196 |
| SHA-1 | B4305E3282457320BD8F258311C6E2AB4224A897 |
| SHA-256 | A51CB7DD75116D6FC4D96B6D667E09CB3FED5A8A6EB439897F7E22576C405234 |
| SSDEEP | 192:zxsOP6cuYf/jQpEuEydSCdazXCZGkZGXz78Pdr37eCYxs50rGA+KnY+58XA12HGl:bUpEundSCdWX4GkZGX82TYM2HW+w |
| TLSH | T1A082F806FB4BDC57E6A52FB4252F07E4DB0ED49050E8429BA20E774E2497731092BFAD |
| 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 | 27508 |
| MD5 | 31F27BDDCDE907016121BDBF23A3B674 |
| 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-8 |
| SHA-1 | 63F1FE39B8254D385FD03591E93B3C398EE72D5B |
| SHA-256 | AE25BA3F2ECE8D1067FE54E1876849C5CC0756CF749EB35761D242DDE3DF23CC |