Key | Value |
---|---|
FileName | ./usr/bin/darts |
FileSize | 14496 |
MD5 | A74C7E8AA03616DB949F472BA17E2748 |
SHA-1 | F105D3102588C191CF561478BD2DC6E09CCDD0AB |
SHA-256 | CF02C278063A4267F20EB9B114C08E5FF79C6DE74CDB79D9873119E737BAA861 |
SSDEEP | 192:RlcWPX8zs2CvUJBm7i+Ekv0MredHFyBkiiUftDjzS:T4s2CsJI7iFksMredlxqj |
TLSH | T10752C707F7928E7FC4889334049F87767670B896EB22635B2208B67C76037945B1BBD9 |
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 | 28662 |
MD5 | 92C8E5A4BAAD27D91115679D0CCD1928 |
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-13 |
SHA-1 | DB4FC087B0CEFF4D68ED955B49D38DFB88F9149B |
SHA-256 | AB062A2569441BE3632915FB268B56E9260F7CA733D84C2B2E1EEAA8EE26D41B |