Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.4.4/PSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2.a |
FileSize | 285644 |
MD5 | 67C5AF4E232737AE1A8162871F0520B3 |
SHA-1 | 3880B32CDF9F53C62B28CAE0BD3FAB4DFCD6F799 |
SHA-256 | E9ADE8DB024B620C4A44D3EEEAA2AAF4942874A562F0BCAE29F406FF0855EBFF |
SSDEEP | 6144:1TgX0aamnl659avK1olyrK1wS9nlacMXeUwNSabvELdUXay0XG2MT8uupUpwVdNI:1TgX0aamnl659avK1olyrK1wS9nlacMS |
TLSH | T148543303CEECD932C91DD5B5C8A1A4A832E5F04E12549F43412852D6BC66FEAFF4789B |
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 | 71608 |
MD5 | 3861C95DBA217B07C0C7398AD4E82B8E |
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-13+b2 |
SHA-1 | 440B7E2588AF8195A060B7AF74E09886382F45E5 |
SHA-256 | EF6E052239D38F90E75B7431F972B2AA339D0929285B49F6C3E5478F5F15949E |