| Key | Value |
|---|---|
| FileName | ./usr/bin/darts |
| FileSize | 13788 |
| MD5 | 3B6E4C6443E2FEE052FE4E9F476A3E8C |
| SHA-1 | 2197C7F701005B0ACF25DD18137D59C4D512BDF8 |
| SHA-256 | BBFEE3CE80FBB5F5971AD40E7AE45058CCB684C74FC1716D015E53194FEEDC14 |
| SSDEEP | 192:eBzKp8ocS4t+RMJX3Qgc2EwjTALyFNRPEuWOnLr+33ky6Hr67oL:azK/cS4weRggTjTmyFDnL20pr5 |
| TLSH | T14D52F60EBF56FEB3E1D20B3444438B649030D4319F63D3A3B708675B64A22A99F15BB6 |
| 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 | 26012 |
| MD5 | 70F08224FA00CFFC8CF3C03CEBEF79CD |
| 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 | 3A6ED787F889556FDDBC6017F7F81964EDDD1248 |
| SHA-256 | 60BD3B29C492176BCE8B02BFD6E0E7DD8174717E7EE4788A3A13BDEF3BFF5C1E |