Key | Value |
---|---|
FileName | ./usr/bin/darts |
FileSize | 14496 |
MD5 | 67A58F7F636AD2BC3FF2E6E7D763017A |
SHA-1 | 36695812BD05A5DBBD28522E6B8853DFB274DFCE |
SHA-256 | E76A562BB25E1672671992E4C70043F8D8E55DC4EE787D8B0B1281AA9B55BAC5 |
SSDEEP | 192:0FAX8A3CP6LCDmZbhXbsfLDlPOyIm7Sl:0Fa3CPcoWbhX+D1OVm |
TLSH | T11552A65BAF26DAB9C8F83B3051CF8734A3741D25B7A55729B75DDB261C833808A25F80 |
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 | 24530 |
MD5 | C661C14E7A188F4ADC42CF8F2ABF19F5 |
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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
PackageName | darts |
PackageSection | devel |
PackageVersion | 0.32-14 |
SHA-1 | AE77147FAE5D5AA05EE0AFF357E9E2C6D5343850 |
SHA-256 | 317DF7C0210B10DF4A152199382715F7218F9C2A9DFD72C1B99121B35D58ED46 |