| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 14636 |
| MD5 | C1DFAC2CAFDDEE3443204B6CF4CBD928 |
| SHA-1 | BF5F16EDAEF361830E36A58E9F17E87E750C07F0 |
| SHA-256 | 3B722CDEF63C732BDE25CD88075CDA27ABE8E2A3AEC28AE0A32893C7288910C2 |
| SSDEEP | 192:gdgra8AiW4QmMl2roF1N2j91+G+ASPU+pgijoXxFCv7+yGECzaIz4XV:gdBuo52ZgG+tui8rCv6qCzaK4F |
| TLSH | T11B62B80BB711DF2FF9A5C37490A3C36133E850B65B82472BA53CF60A1F856992919FC8 |
| 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 | 26372 |
| MD5 | 8EA039487B092E2523ACF96EE1C6DBF2 |
| 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 | 1A19EC85269127EFC104BE80B4B07D9D4592767C |
| SHA-256 | 6D1680841E69C126D71849DF8E28DB080744F3BEF049E76A63A8ED1BB2463DC4 |