| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 14768 |
| MD5 | A800665BD794961C0B53F182F10AB9F6 |
| SHA-1 | C55F5842E74FBC53E50FDD9548FA728DC3D567A0 |
| SHA-256 | F59286134E394CA453623091F39181C1E1F5AE5D727448E851CDC292766550DC |
| SSDEEP | 384:zppuo52U2P2oc7B1ZDwZDBqqNYK2r3L4Op8+0CibE6le+KHXVlXdpHHnI:N52U2OocvZDwZdqqNYK2r3L4Op8+0Ciu |
| TLSH | T11062B716FB814EB7C8C5CE30446FC30192BEDD1ED696632BB519CA442A43A6A5D87BCC |
| 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 | 26648 |
| MD5 | 919D57100330754F4110A0716892F5C6 |
| 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-20 |
| SHA-1 | EAA29143FD27A862A58D57BC01C00B886BF97AFA |
| SHA-256 | 3A9DAA0A0739738AD65724FEEF7291337E9374D303E63DF0951CBD4EE1521FC7 |