Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/arm-linux-ghc-8.8.4/PSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2/libHSPSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2.a |
FileSize | 215370 |
MD5 | 03336D0B3561C693B0D1C16328585F98 |
SHA-1 | D57739A1F98805F1FA4B0E80241873AEE8EA03A8 |
SHA-256 | 3010F79AC298FF950712733D3596C27CF15C9A8818D4F39A89780FC45E13EE8A |
SSDEEP | 3072:GWwZtCUgaeaCWghvbjiwV3589xT1y1WxeUXCPX1g7xg2x6:xwqaeaCW0nV3KGNg7x6 |
TLSH | T1E22444026F48CA81CB8ED1FB527FE770B757C69B4293D70F542401D12E52AE0EE2699B |
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 | 68336 |
MD5 | 44D5FA82378910F976AC6883FD9E6192 |
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.0.1-3+b1 |
SHA-1 | 69A74263D27432B71D0870FF9729F79DF7092DD6 |
SHA-256 | C952100FB28EEDAFB0AF9BD08486CF2FF6ABF2515784EFF2D9BD609CFF87FA3A |