| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 9928 |
| MD5 | 47A2DECF30048BE821A3C8AE915333C2 |
| SHA-1 | 0AF16FC358750E56A415BCE42CCBC522DB166221 |
| SHA-256 | 74C3A9061A1D836AB8228F6F84E0EFB8B06217871AD0A407E32E11E1EF04966F |
| SSDEEP | 192:x9NCN8Y14wQL2+KhOXwg5QiYRH7t7rYy3TcEOROOSzh:xXY1EL8h2wmRYRH7t7c4TcEHTh |
| TLSH | T1BE22C712F30BCD23C2A47BB014AB07A2535DED846499478FDB09629E26E22255D33FED |
| 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 | 29152 |
| MD5 | 8454BBC0B971B1E8C7D5F8F474CED0A9 |
| 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-7 |
| SHA-1 | A5FF5FEB2D6A9EEAB84EA0A5529BD219643FF24E |
| SHA-256 | 20F630CA767C093006B52C6E350DA518FA2794D6A094637A03023C8B36FC4D45 |