| Key | Value |
|---|---|
| FileName | ./usr/share/doc/darts/changelog.Debian.mipsel.gz |
| FileSize | 210 |
| MD5 | F2734908C3E9AE6ED0AD0B5D92D31806 |
| SHA-1 | 4B8365170F4D0BB98F1B4B138FFBF4669A1DC4CC |
| SHA-256 | FD6DC7C0CF10112078E1E7C2F67FF3471359DC7A6BD0C0472A96275574FCD459 |
| SSDEEP | 3:FttSTVDE9oh0bFJrJd7a4gdpus3Cjtn9LkwBYmFCfh9tcZbLLmC2NUhyniK0MF7Z:XtqsJrJQX2xkwBY3oLaxNz5LEKdqxRE |
| TLSH | T108D0237D21977175C0504B75E2F681A012D44B526D8DDC6321304445C2D7F00D45D535 |
| 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 | 26302 |
| MD5 | 8631110936D2AF76360302C5D65FFA82 |
| 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 <pkg-nlp-ja-devel@lists.alioth.debian.org> |
| PackageName | darts |
| PackageSection | devel |
| PackageVersion | 0.32-14+b1 |
| SHA-1 | D44CE9AA4EB3FB9AA544AC36FEC6EE2A6BF7AF80 |
| SHA-256 | F8B8285DEE632F94310343DE60D50464C8034CA87AFAD86580DA083BDB09E190 |