| Key | Value |
|---|---|
| FileName | ./usr/bin/mkdarts |
| FileSize | 18576 |
| MD5 | 4CE70798859341DBCA4DDBF9FB8DFFCD |
| SHA-1 | 9B4877553A9658C9372F52A3ED578A3B7B700FAB |
| SHA-256 | 002A08E8ED6A78EC06ACC91EA11D61E009D45A3E56A3B88F1CC580612D15353D |
| SSDEEP | 384:2sqAEjsul7Dih4v+V7aggHmtEbqh4mnI57YqowoM8Ai8R6hMxI3Ye:2sqsxI9Yq1oR8AY |
| TLSH | T14F82C50AFB1FEC7BE69583B4458606E5B3339468B39983E731149654BA833B85F252C4 |
| 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 | 25604 |
| MD5 | 09692D818AC033BA0C60EACF1C49B3CA |
| 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 | Natural Language Processing (Japanese) <team+pkg-nlp-ja@tracker.debian.org> |
| PackageName | darts |
| PackageSection | devel |
| PackageVersion | 0.32-19 |
| SHA-1 | C0EA67A5345EFB53CA8358FA0D4FE5C558A85A7F |
| SHA-256 | 0F91B9643049794E05BD81A20E48DC221E19CCA64C0E0A54553D1AF09DE725EF |