Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/powerpc64le-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d-ghc8.0.1.so |
FileSize | 292384 |
MD5 | EBC7AD7C5E1D12EAAB1D6C83B77BE1D4 |
SHA-1 | 1A7B40F158C0EAAF0406A9D49E893A2E71C2E78C |
SHA-256 | 34D4641C35622EA12594210A5199EF8312694866DC19878434E7D8B6B55D0831 |
SSDEEP | 6144:kP+KifwqOdAvE4f/ZBqok/TKJOFM3+FW2lsKr1j+uBst+DWpow85ckRC2TOhErUa:qIIlIsYEYJ |
TLSH | T1AE5432D3FFB07852DB80AE7CE027A4B031752ADD93C7DA22203D85665C4DA46E50DAE7 |
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 | 79000 |
MD5 | 4524186EB109231EF412E25071802B34 |
PackageDescription | Priority Search Queue A /priority search queue/ efficiently supports the opperations of both a search tree and a priority queue. A 'Binding' is a product of a key and a priority. Bindings can be inserted, deleted, modified and queried in logarithmic time, and the binding with the least priority can be retrieved in constant time. A queue can be built from a list of bindings, sorted by keys, in linear time. . This package contains the normal library files. |
PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
PackageName | libghc-psqueue-dev |
PackageSection | haskell |
PackageVersion | 1.1-10 |
SHA-1 | 2F48CE6DB4D602ACAD1B6EB346A067473D5153E0 |
SHA-256 | 48E7532E324CF50C6BA15895E4D3A7081563C95009EFE06F0E71CE5EF8FD28D2 |