| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-7.10.3/PSQueue-1.1-B2W2Jqwxlgm7tpuk3TcoPN/Data/PSQueue.hi |
| FileSize | 44965 |
| MD5 | E309FEAABC88F234575839B9914BAC5C |
| SHA-1 | 0335E9C89EC46DD08D68FE0B58590C44B794EA22 |
| SHA-256 | 75227C6D7D9FD50106E1D6C6D695D351F3492CCE217AD0C87FB2E02E7A12A4FA |
| SSDEEP | 768:TZCAv2C2idCCieVEVnVaV0V+VQVMVjVJVCVI/VsCRidVMqVqbC2iUVHjVilVqIbe:TXFFBg+zbKu |
| TLSH | T18413EED3DF61D033CAE82EB8647617896F60D0CF7313861B150C29BABE52BE02D75969 |
| 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 | 57450 |
| MD5 | CE4BA69557348DE90864E0E9D49620F0 |
| 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 | 300DF5DBFBAC532F9E76431DCF26A519461A20C1 |
| SHA-256 | 6668DFE27941BB71E2ADF2CEF2E3C6638B882179AE298B1B9E50D325546F31A8 |