| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 14432 |
| MD5 | 6F40C58B7DF1F7A93A2B6EB0153BC751 |
| SHA-1 | A8DC44C0993C1E8996A39C9C6BE5BF9E9F7F6E0A |
| SHA-256 | 69BE8DBFD5511BAFB704DED29130739D02D73ACAB6B0EEB4DC26D4D1F4F6B3FC |
| SSDEEP | 96:Z7rq8dBWBMvTcAEI4MXUrgTdB/5EvrFZOUN480oP43FsQjr///LGT8kJiVVujMNh:Zfjd8GIAEIXtNaw8m//TG3iX2nMSbA |
| TLSH | T1D1526505F74A9D3BC9C497B54A8B87B0B3229489D39A97D3B50CC618FA827ED5F187C0 |
| 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 | 24632 |
| MD5 | 498C42A9A3DF3E66CEBBBC401C411666 |
| 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 | 8CF27CD68E322C55DA4136CBDDC5926EEEBE569B |
| SHA-256 | 84E9FC6C44FEE89D5CAE6FB6AB7ABB5D9ACC0345E5365776E60881A4B1256230 |