Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-8.4.4/PSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2.a |
FileSize | 181358 |
MD5 | 0CAFC6BA558790DB6307B28B6CA3C4D7 |
SHA-1 | C875161652E423D6FA2C90A7EB189E5807521A5F |
SHA-256 | 0150DE0D478CA7C7C3881093B9531C36E4B95EF01079598E04F565860235B255 |
SSDEEP | 1536:6NAEhWfaegPJsGsi0dXLiqIYXGSL4+mu15vjN3Ny+i2EUuAavHhsP:1EAfaegPJsGsi0dGTS4u15v1Ny+ii40 |
TLSH | T1F404A7123E4DD8AAC93DCAF6FA6B5A343259AC0583215B131A7017A43DF3DC5ADDAC13 |
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 | 59680 |
MD5 | 0067C74B3F876609DE616DF2EBAC660B |
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 | D784C2E134A985EFA59831192D86D3A89AD7DED4 |
SHA-256 | 0282F9DD27E84DB1B6E6DC0CDEB269EF488C9C0194FD3C16F7171309DD5781E1 |