| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/PSQueue-1.1/ghc-7.6.3/libHSPSQueue-1.1_p.a |
| FileSize | 403082 |
| MD5 | 94E0B2833C9C22ED2D23994C2235A67C |
| SHA-1 | 03E069A4B42FED831106C80E851CDC6AB5CF8744 |
| SHA-256 | 6E46E6CED2DB41AC6D301AB3BB92A0307A286574A942C903B7E60AE237DDBEC8 |
| SSDEEP | 6144:rAKAmR1fjGU9gWvoBxRefcCfoZCQ2c69JdK3+FZSPbcFE:rAKAmR1fjGU9gWvoBxRefcCfoZCQ16hu |
| TLSH | T15F84A44287448A13C68DEAF4E40F6B687F7ED6C693AAE323141056FC2F27ED11C16E95 |
| 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 | 96400 |
| MD5 | C316D4EA427AECB9A803D8730BBFAAA6 |
| 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-4 |
| SHA-1 | B17B77A1F6FC75338490E4D7BD331C7D7E1E95F7 |
| SHA-256 | 05E91328DC917D74DEB8D4E290A184AD741476CE945A33BD6BE6F4053ABD7DA6 |