| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 9740 |
| MD5 | B8E21BA0CE593F4219F6F98A75B5E151 |
| SHA-1 | 121B57F6CA6B5187C9B4AC8672947F26AF62A000 |
| SHA-256 | 9EDF04B0EA5EF68164DFD48B4801B08FF15ED162BC169FFE3C3E866DE3554F8A |
| SSDEEP | 96:xx8H051BWBFAzoS4HkdKBUh6Xk+SyHlcPw6JyBYvQY9MjyPHcptCbhS58O7GNPS:i0518kcS4EdMk+SXP8YJ9gyPyCd |
| TLSH | T14C12C649FACB3D73C8E04BBE64C75F0561A1C49B9EDB4B23B20C67600E135A95D0ABC9 |
| 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 | 23868 |
| MD5 | BC57B739F913C933417DDA24F98A1B7A |
| 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-19 |
| SHA-1 | AA6E619E8B77FCDA9806A611F9281B562B908BFD |
| SHA-256 | 2E6194D12CB1D8E6475B21BA9572410C419E8A4DABB5D6D5C59BB62D412C264F |