| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 9692 |
| MD5 | 2E1EDB3C2D5496E86BDECC2D7D142E79 |
| RDS:package_id | 182052 |
| SHA-1 | AB6B16818D80DF40644DD529E0408F5CBB383E14 |
| SHA-256 | 1AF32133A4178B50927941AF2DF1FE8C018092F399715090462700A80CB0669D |
| SSDEEP | 192:dX8qY145qS9QTX3Qgc2Ew8oXnThIQgab0HPzVFOUykmUqICFwPvbo:PY14NKTggT8oXThvnqzVdsUqLWvb |
| TLSH | T14E12E703BF47DEB3D297467C054B8379A1309521DE5783C3B6887B5E286229DAF04BB8 |
| insert-timestamp | 1679426120.5092263 |
| source | RDS.db |
| 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 |
|---|---|
| FileName | 14224 |
| FileSize | 25510 |
| MD5 | F53D2C29360E3188EABB0B2C8AA9306D |
| 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-14 |
| RDS:package_id | 182052 |
| SHA-1 | C02B0FDA67C0655AFC083316C563B3EE4ABE87ED |
| SHA-256 | B03E467A89C3EC7356CC5B88461371D0EE78ABBC08E4E06B1EDA5E2CC9784F1E |
| insert-timestamp | 1679408378.6830144 |
| source | RDS.db |