| Key | Value |
|---|---|
| FileName | ./var/lib/ghc/package.conf.d/PSQueue-1.1.0.1.conf |
| FileSize | 1571 |
| MD5 | AAAD6FFB5EC1A0F9A75E6F3B8062AA75 |
| SHA-1 | 9D3698D8FEF38C1690CF95F5E2E8DE2C82AF98B1 |
| SHA-256 | F549D3A9DA47C6CD142C2823CCC3D0D85F9907CAF2B22BFE490DFE8CC1F6BE3D |
| SSDEEP | 24:Q5W7dsi6/+Rh3cTwQfmHmog7EkJa85oCUyA154qxpqlzpHl1Me0oMmwTWPRD:Q5W7d6+RVIrmKYkLfq/q5pHl1l1w4t |
| TLSH | T1E8310265232CE571F9F7B8D3A735F8A4276B52B22155B9A034CC1312330399AB823DED |
| 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 |