| Key | Value |
|---|---|
| FileName | ./usr/bin/mkdarts |
| FileSize | 18640 |
| MD5 | D0C721C2B2F8956AA9E7B257A6DD5794 |
| SHA-1 | F58172615975D065C133BDED3A9A654A61A9E58A |
| SHA-256 | 18070E4E1C437E349BD116A1638FD60871ECD2BF59BB257D897FDEA246C7FDC7 |
| SSDEEP | 192:u/8AXn6fuoTCj9L0J/cRKvsnVLs5GaswmogDwN+KJoV+DrcI98OrOhgLS:cXn6fuoTCBWnv89ogDI+KqocI9tya |
| TLSH | T10882CADBEB12CEA6C4B47F39A6CB8774933B2426B7955B0CFB9CDB221C437450924A50 |
| 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 | 24480 |
| MD5 | 8DCA3E8DC049842312A2B811F9DE64AC |
| 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-15 |
| SHA-1 | B137906B8A7F49D29E33F17EB1D9FE476532D065 |
| SHA-256 | 6CE956F2AA66CFC1DA11225B6D2C15D7F7135FBFA86D301BC4610196CD888059 |