| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-7.10.3/PSQueue-1.1-B2W2Jqwxlgm7tpuk3TcoPN/Data/PSQueue.dyn_hi |
| FileSize | 44973 |
| MD5 | E341B210F1AECCC91337B65CAF52366C |
| SHA-1 | 6D6ACFF1F6BA133701CC66F30C81EE1784603497 |
| SHA-256 | AE8D23960A2B18CB66C5DAA5F691AE11F2EEE256AEBD5C92941EB97BD303A579 |
| SSDEEP | 768:ZZCIvrC+iUCaiHVpVWVbVhVvVtVJV3fV2VlVPVSCJidVEqVibC+iUVfjVqlVipMV:Z5+NB4GKx1CIKu |
| TLSH | T11813BCE3CF61D033CAE82E78647657897F60D08B7313861B250C25BABE53BE02D75969 |
| 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 | 58498 |
| MD5 | 696F4BF340790F48A815EAD5904C2CF5 |
| 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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libghc-psqueue-dev |
| PackageSection | haskell |
| PackageVersion | 1.1-8 |
| SHA-1 | 9C0782FEB03902E8125A6421AFE6E0EDFF9B436F |
| SHA-256 | 9304E4CAF2C2AA0DD74692654B2778CB3088176690B64B6F3913E2CF7DFEA6BE |