Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/libHSPSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d.a |
FileSize | 220860 |
MD5 | 8C66E22B8BCA20451CF30E64F6882466 |
SHA-1 | F288FB4E57AD000F9AE0043F82980799B425F772 |
SHA-256 | 39DF779AEC721BAE670FBF3352DCC733C27074B264BD8C445D54BE35008E1947 |
SSDEEP | 1536:KFmD/6OJC4YJJ6u6YCf4d2tu72bCAtSUro4tklWlyaIZfOBcAOFrTlUjnQS8xLLH:/D/6OJC4WwzYCnBDefOBcvTlxLLH |
TLSH | T1D02445909D44CD66CEEBDB77922B5038E296868F5332D30F434D2BE06C45D59BC43EAA |
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 | 66816 |
MD5 | BBACE80A50C7EA6F41B6CF11DE2CC3F3 |
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 | 23706928B2FE25BC74D16281EFF0ABF221FB1E95 |
SHA-256 | 5842E5A8FA9AADFCF7202FCE6F5F56458E413BA29AB0F2AFF8436F30F93B9503 |