| Key | Value |
|---|---|
| FileName | ./usr/bin/mkdarts |
| FileSize | 13908 |
| MD5 | 7BC4B127509C40A3C4EADE10517D5F3A |
| SHA-1 | 1A2573C659CB17A270D2ED5C41DA1051030E0CFE |
| SHA-256 | 3F5B4D240A06B565FE86A2E0912F2AC4C4CF4388DAB11BB5433F73C5A63E3FA9 |
| SSDEEP | 192:eQ0NQCEuXdSvnYFzG1dZzhAm+Po1mnZciOCgFWjbPD3cfk+oz0:p0GCEuXdSvYFz6z+cTob0k0 |
| TLSH | T1955218659BE76C77CCC40778DAB78E4F6500C98CA30B3B5B91CF6065081E2E9DA89F84 |
| 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 |