| Key | Value |
|---|---|
| FileName | ./usr/bin/mkdarts |
| FileSize | 17952 |
| MD5 | F011B74E1343F462ABCB87299B318BBC |
| RDS:package_id | 182052 |
| SHA-1 | F7FC359D50199C169DE1318F50D709FBD50AD2D8 |
| SHA-256 | FBD386931512360CF5B6A2097794F6CA63B7F2BBFF77EF506DCC6C6FBF967F09 |
| SSDEEP | 384:S1Wk1EuPSPK3NwggT6PgeCubnFns9DXfINfTnMQ5uAk3wZ:KEkSi3NwfT6JpsIo48 |
| TLSH | T1B5824D03BEC3CCB2C58302BC564B97F961304E219D57C693BA44BF5A94370D6AE197B6 |
| insert-timestamp | 1679426120.5172703 |
| 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 |