| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-8.6.5/PSQueue-1.1-6609kGsRfMn6U2V0Mb4Srd/Data/PSQueue.dyn_hi |
| FileSize | 57403 |
| MD5 | 689753750FCC36DAFCCD349248285120 |
| SHA-1 | E8454C9E798AE2F874EF14C5FEF8778CF69A0DA8 |
| SHA-256 | CC703700B1C09A62D8A6FE5C51836425214E458B9468C83995941A13314788B8 |
| SSDEEP | 768:IcXiZowdI2KPoj6hK1IfBiu+ikQHaxaIzefHHFKl:BJxg+K0cCyzTl |
| TLSH | T1A443F711EF89D13BD91807B086B64308EFF4D485A686AF5F202461BCAC7B2D17F95B9C |
| 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 | 56392 |
| MD5 | 7307BDABDD6EADAAC86D11B1AC0D15DA |
| 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-13build1 |
| SHA-1 | 0BF1FB1DCB09968E1C60E919B35E146D10C16C9F |
| SHA-256 | E6A3FA854ABFDC2C695D09BF43289A28043BB68FC0F94E10E90416DADE6A7297 |