| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 13912 |
| MD5 | 65FB3CC1D31BC6AF7264120C2050F05F |
| SHA-1 | 114E9C3D26A57B64A9A686CABE08ECE9536645CA |
| SHA-256 | AA23C3DB39909A80C8E4D28783F5447290E979861D28C5D8B5D4AC5E64B1933A |
| SSDEEP | 192:eXmt0nJ1m8cVAX8X114/Xg5YBLb5gQrgCx3C92IMXjl6p+y0mMUDTDSzRdS/AE:eXmf112Xl9gA5+2IQjl6p+TmMUXwRYAE |
| TLSH | T14852B702F31B4D17C6E0ABFD55E78385931DAD40EA5E439F1316670A3AE23642E1ABDC |
| 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 | 28690 |
| MD5 | DFFC739A02F9AC817CBA9DE3860665A2 |
| 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-12 |
| SHA-1 | A93001E09D043F2E5023AF28B34CCDBBACAA302A |
| SHA-256 | 47146768F62CFB8D6CA80D2DC9F9C13CA7CD488998F20898B4FB6EE501A25E4B |