| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-8.8.4/PSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2/Data/PSQueue.dyn_hi |
| FileSize | 58992 |
| MD5 | BB952EF6565FFE9A58A7672600056C60 |
| SHA-1 | A57D7352C42D8480090B9BCD94232374778D3520 |
| SHA-256 | AF1AA1A7AA5716FE18CE50C181BA6E8D00EB994BAE9B9E69D8E0C5B007294E57 |
| SSDEEP | 768:mDoODDwSo8YDjSiDKOeDYSLDaSsDbSofDrSoDzSQdD+SikWS8DbOMkO+SaI2FDzt:3CLr4syrFPl |
| TLSH | T15B43C027EF89D173C5290AB087B343492BA0D8919E89AF4F201451BDEDB31D22FD5BD9 |
| hashlookup:parent-total | 3 |
| hashlookup:trust | 65 |
The searched file hash is included in 3 parent files which include package known and seen by metalookup. A sample is included below:
| Key | Value |
|---|---|
| FileSize | 67628 |
| MD5 | E45F76AC5E3592D04DE20C3BDF6F0D07 |
| 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 | 25D4A882423BC6C28E5740448FF4EBB288212DA0 |
| SHA-256 | 9E23D66F022AF8BE605AADB79AC031379E874F7C77A29A981E435A63F1292FB7 |
| Key | Value |
|---|---|
| FileSize | 68336 |
| MD5 | 44D5FA82378910F976AC6883FD9E6192 |
| 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 | 69A74263D27432B71D0870FF9729F79DF7092DD6 |
| SHA-256 | C952100FB28EEDAFB0AF9BD08486CF2FF6ABF2515784EFF2D9BD609CFF87FA3A |
| Key | Value |
|---|---|
| FileSize | 65580 |
| MD5 | EDACE8EF261133623A2609B071BFEE2B |
| 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 | 1E2CF31FF644CA0058015F9E4FF1C43A819D0E1F |
| SHA-256 | 3A7B85E37F0EBCE76F0DB1C546443193833A92E6F7C33E5F599F73A1D69F241E |