| Key | Value |
|---|---|
| FileName | ./usr/bin/mkdarts |
| FileSize | 13880 |
| MD5 | 5C131ACBBA4FDFA9F1DFC3FE2A18E11F |
| SHA-1 | 457EB318E73C2D0CD91345F72AE336616D7850C5 |
| SHA-256 | 2652DE4434CE67521673F73EC437F9E86013F3B34DA2DCBF09BCD9D10DD98B90 |
| SSDEEP | 192:zfhS8vVAuMSFZ6iBwE1sv+e+a9LdHfVvyFo6O3+mI1jERtUGB:zZNVAuMSFZDcmHadd9aFVO8EDUG |
| TLSH | T1C852F8CBA9CF9D33CCC46B79247FDA96A251C8CCD5EF0BC78208752928461A57D16F88 |
| 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 | 23868 |
| MD5 | BC57B739F913C933417DDA24F98A1B7A |
| 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-19 |
| SHA-1 | AA6E619E8B77FCDA9806A611F9281B562B908BFD |
| SHA-256 | 2E6194D12CB1D8E6475B21BA9572410C419E8A4DABB5D6D5C59BB62D412C264F |