| Key | Value |
|---|---|
| FileName | ./usr/bin/mkdarts |
| FileSize | 13928 |
| MD5 | 527F6BC9F1633025A06D9E8186358C56 |
| SHA-1 | 2D80A5A83D8C63B7F98DA27153B59235480E1458 |
| SHA-256 | 5AFCCB0AF5708270495ABFED9733B84DE69240CC04D93AE0A08B939B7A5ED138 |
| SSDEEP | 192:RyC8X86CEuXdSAGkQhGOk/rXYbZiJtBrvEurp5AghjrtOGccM5ee58oN:RsCEuXdSAGkQo3XYFKvEutNOXcM5bdN |
| TLSH | T16A52298BBBC3BC33C8D04339C47B4A8B795AC849E35A8F2B5149E45A18465EDA131BC6 |
| 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 | 26368 |
| MD5 | 29E59097FD533538929E14C01AA361B2 |
| 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-12 |
| SHA-1 | 8D5AD7CA56B288FD207836BF9F9EFB1ACAF6C834 |
| SHA-256 | 0B475B1B2F14F47EE1D248154BBA7D6524BD4FE8BC6620E93763F623ED225E1D |