Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.8.4/PSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2/libHSPSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2_p.a |
FileSize | 637430 |
MD5 | 3934486CF214946942A77BA39F2A655D |
SHA-1 | 0F792AE47456D5B2A6F8DA4A5AE3FEFE4009AFC8 |
SHA-256 | 2B6AE56469F6FB4C2F307D8B08C206065FA33041C8B5588C2504B55964B9774B |
SSDEEP | 6144:Uxf+lWskWgCuBCDzNlxBSYYiv9f60f6pExYVAVTdRO/Op2GO4jiT8hP6sM+8z2:MCfL |
TLSH | T135D444282B85C76AC7CE82B698958BF1B773C489F3C20737523406B91D12B6DDF4B466 |
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 | 70792 |
MD5 | 69169005A52A0919D7723EA0B688D013 |
PackageDescription | Priority Search Queue; profiling libraries 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 libraries compiled with profiling enabled. |
PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
PackageName | libghc-psqueue-prof |
PackageSection | haskell |
PackageVersion | 1.1.0.1-3+b1 |
SHA-1 | CFD346B51D8F621D7DA87C7491F49549F304A1A9 |
SHA-256 | 7BC514F3D9C8E40FCF01239FB807C2589841EEE6E5F5274C5D6C620D135ABDA6 |