| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 14016 |
| MD5 | 0FFD8D5A07C0D4464A54AF7D9BCE0C0B |
| SHA-1 | 3C7F2829F8904365A61962F6B1C4DD2F60977E32 |
| SHA-256 | 7D5017D611BE4243391A05EC4860DC0FCEDE9E905CDF076BC3C0EDFC4095FB38 |
| SSDEEP | 192:9f5/a8714Lp1Ey9w+X/RrfWsH6c8ikXiW6iH6iH6iH6i3C5klllfnlbyq/Rx:X371mrLO0/b6c8VXj6a6a6a6CZR |
| TLSH | T19352D782A6A69A37C5648739E4AF4B3CE450C545BFCA13934F1FE0A83E114F0787AB64 |
| 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 | 28716 |
| MD5 | B3B01A65FE5D4307B0BFC98637B13091 |
| 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-7 |
| SHA-1 | FA0D350A7175C033EE75B097798FDF7FB83CFAED |
| SHA-256 | 6ECADF6232CD5DF59B25825591E14D12E3590F1740514F9B824FDAF7EA3EC527 |