Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/arm-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d_p.a |
FileSize | 437268 |
MD5 | A1338C0A4388BCB82BD8C7A00E2B234A |
SHA-1 | E695B24536A0D665CB1A7038F0FE04510B66548E |
SHA-256 | 3DEC210B8966901A1B43B879752D4E62F5F42DA80EE99389EB04C2630C58146A |
SSDEEP | 6144:N0AGsY1cUBHPJaiE3fne3+aO/JrTWO684Bdlx6gHa:aA01cUB0i0fnetwCO63Na |
TLSH | T11694A58EAB248F11CFDCE4F6E00FAB606756C527436BE713001452F43F566EA2D25EA9 |
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 | 73752 |
MD5 | 34F5CE687ABC9635FD61331F02A9941D |
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-10 |
SHA-1 | 2ED6CDA702AFE3B8EDD25B5AEA94159027C005D6 |
SHA-256 | ABA7CE27BF2DBAB0587D4DF789D183109246ED58C7A136EFCE2DCA2D59653578 |