Result for A6C7EB671C6FF8E6CA7E4EB98F3E43A301E7761D

Query result

Key Value
FileName./usr/bin/mkdarts
FileSize22856
MD52A167B7A3E9980856584A4D10095D430
SHA-1A6C7EB671C6FF8E6CA7E4EB98F3E43A301E7761D
SHA-256CC7D0256B9866B4C7DA9A12A8C66ED53B942B32216FF66B01954E5850B251590
SSDEEP384:Uj2u87+R1oLBF6fHnzAOOWUfpAKNu63mVULOimmMarCcw3E3Uddi:s2nasB0Hnz7ImVNa83E3U
TLSHT133A2F626734E8F2BDE80993A435F56E6339229460355C783B504831B6FDEF588E2FD4A
hashlookup:parent-total1
hashlookup:trust55

Network graph view

Parents (Total: 1)

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
FileSize26366
MD53A6B11079178A2C2A71D6596C9D261C8
PackageDescriptionC++ 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.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamedarts
PackageSectiondevel
PackageVersion0.32-14
SHA-164A68CD76DE0D51BEE3139019B290DE4A0B02CED
SHA-256DC0CFD89AEB90F585E0F0465E834EC7EA2712295D334DC4CA5D67C729C6C74A3