Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/aarch64-linux-ghc-8.8.4/libHSPSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2-ghc8.8.4.so |
FileSize | 204336 |
MD5 | 551FCC0B636D92F44DB3F7B6C5B30AA2 |
SHA-1 | 3AE58EE33D4A0F4649A570B9309733EDE17A488F |
SHA-256 | C73364D5009044B29F7781179E218091C9B1C600089F5D8BE14519639D65588C |
SSDEEP | 1536:c2EWUEZf0Hl4rrDmpGnYx5TLEmlp2Dc66CyKnNFHsNGnxpwqCSaxZBbgIaDBdNNV:IWUEZu4rrDmpGYxV9M92E |
TLSH | T1D114A52AEF4DD4D9CFCED1F54A3592557F6A07464292D227003884B2FE80FD1AC99F8A |
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 | 69172 |
MD5 | D84653F9A0DC137F87C4AE1ACA75DAB3 |
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 | F250BB04384907818EF7E37924DEE63570A9C180 |
SHA-256 | 4D5D1FBB0E0F734487109F70910BF1E8ED937BBEE7FD21EAB40C130E9D64533F |