| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 14432 |
| MD5 | C277322C31B1CF9DA543E34CA059BD63 |
| SHA-1 | 07B56F74317D72DBC1A7E0D1906F19189F62C07E |
| SHA-256 | 4A48489D57756A788353CE4E794484345E935229AE100E478979ECF63ED7FF33 |
| SSDEEP | 96:l7xJKkBWBMvTcAEI42Y3DMp5EvrFZOAFN480oLRQFNtkjX///LGT80ii4EtxozvM:lVUk8GIAEIKoaw8Sy//TG7iSvivS |
| TLSH | T1C0527629F745DD3BC9C497B1168F87B4B3329488D39A43D37608D6147A43BAA5F246C0 |
| 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 |