Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/aarch64-linux-ghc-8.4.4/PSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2/libHSPSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2_p.a |
FileSize | 377100 |
MD5 | 09F53416F95796D7AFA463D5C2339195 |
SHA-1 | CB2E380A7AB56EADB24D4A3C34F266C7E5AF8701 |
SHA-256 | 7BBB564CBC9FDAFFA87C46FD90B939165C5C530279E0DFD43CD2C7B581343372 |
SSDEEP | 3072:DqJe+ZV2HE2T4lM+N0Q1FgGNXT+QzOeC+uMfrn1e1hum6csSOuDFfZ:DqnO+N0OXyKSOuhf |
TLSH | T1638474DD7F4C8754CAA9C9FA402B4B34335BC10432E587238634CA64EDD5FD9AE86E4A |
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 | 57940 |
MD5 | 39B14FD5499BE5C49AAFA1290426660E |
PackageDescription | Priority Search Queue; profiling libraries 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 libraries compiled with profiling enabled. |
PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
PackageName | libghc-psqueue-prof |
PackageSection | haskell |
PackageVersion | 1.1-13+b2 |
SHA-1 | 5F53FD32C98E48DCCCA64C031C9EA930C1CC7BB6 |
SHA-256 | B69DD4FD0C5AFCD7DE7864D0F16D47051F25C9D83B0D6A93C73CB98EFEA458E3 |