| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 9684 |
| MD5 | 8D20114F63A9884E975F111C932571D8 |
| SHA-1 | A92C2C34C50EF74EFE77AF19F334527C5CD39C70 |
| SHA-256 | 0A0A15550E9B817264EED8F392EA5E8C5307EF749445D0D742B010497C7954DF |
| SSDEEP | 96:acIn3WN3vIXBWBa+mT14E+77/1Wx7x5TDs1yXH8Zp9Rp7TFSVwxy07eiblDuIqtU:mn3WdIX8XK14/X/1WLVH+pWVwxycP |
| TLSH | T187128451E5937D77C8F01B3B768B4B2A32A0C94FE6CFF713D21810513AAA18D9E02B49 |
| 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 | 26708 |
| MD5 | 1C08BD5B88D48B2C9A7395E31FAF9FD7 |
| 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 | 03EB1857638276F10AB994E15F12AA5A8EC38847 |
| SHA-256 | 016341FA4828D9B63541A957D4AAA0589C369616FD6F9C7AB4FA06CEB737E60A |