Key | Value |
---|---|
FileName | ./usr/bin/darts |
FileSize | 9764 |
MD5 | 5C18635C2FBB6DF8C766819A44B6CBED |
SHA-1 | 9DCADE7F94A9333787F0FE3771963EE8B52C1350 |
SHA-256 | B804AC967F887A9FE398508B4E9E8F48CAD20EB0D7D49A516C6D9B906542849D |
SSDEEP | 192:FTn2ml714/X31fRIs4JH52HuU5Vyz5j9:wE71kXlfRIs415z+kp |
TLSH | T136129484AB876D33DCE0D37754974E2E2DE1C68CC75E5B13824C96593C22AE99E00BB9 |
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 | 25918 |
MD5 | 6132DA7223B6C3D6C803EFB7845D814A |
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-9 |
SHA-1 | 3CF85B147A4F99A0B2C44D4C8868A1A6E7760223 |
SHA-256 | 4D7FFCAAD904BAE78CA4275670E98FDD3ADD7E051EDB49A0A292CDD18EF5D1D5 |