| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/arm-linux-ghc-8.4.4/PSQueue-1.1-GWTfIrqYXKkCrdRMq66wl2/Data/PSQueue.p_hi |
| FileSize | 58508 |
| MD5 | 98B5DB63480C016D8239FC48F9702C6B |
| SHA-1 | A1A8409C75B140FB3185952733CD37493DAD3617 |
| SHA-256 | A12ABE1A679AFFE51E50268C2070B78B5E2156DBA0691C055B61E68FCA1E5129 |
| SSDEEP | 768:EZa4U/SJlPzL8iYgwJw/DrkD61aHaIzezHHEvTf:v/wzL8i7+D6ezjTf |
| TLSH | T163430A15EF8DD13BD51807B086A64308EFE4D881A686BF5F202461BCAC7B6D17F91B9C |
| 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 | 56416 |
| MD5 | DFBC60C8FE8FECE4BA2E286B3F5D6B6E |
| PackageDescription | Priority Search Queue; profiling libraries 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 libraries compiled with profiling enabled. |
| PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
| PackageName | libghc-psqueue-prof |
| PackageSection | haskell |
| PackageVersion | 1.1-13+b2 |
| SHA-1 | C257134C01C7CD5BB24E6EFD9A63244D3842CBB9 |
| SHA-256 | 5D77E436D464FBA214B88B68A10C05844EF2276FF363F7DBFE239AF471BAADE3 |
| Key | Value |
|---|---|
| FileSize | 57284 |
| MD5 | 5F61CEC92842CF6BD49E9C3D8F41450B |
| PackageDescription | Priority Search Queue; profiling libraries 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 libraries compiled with profiling enabled. |
| PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
| PackageName | libghc-psqueue-prof |
| PackageSection | haskell |
| PackageVersion | 1.1-13+b3 |
| SHA-1 | C851EF4CFC817920809F21AA165BAA56BEB26B9C |
| SHA-256 | 78502091674D8B883B2A1E390A166B0396E191F88CF2A0379B3FA2C5DAB2DFD1 |
| Key | Value |
|---|---|
| FileSize | 56384 |
| MD5 | 6CAC6845A57E72733587BF4786C8E53F |
| PackageDescription | Priority Search Queue; profiling libraries 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 libraries compiled with profiling enabled. |
| PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
| PackageName | libghc-psqueue-prof |
| PackageSection | haskell |
| PackageVersion | 1.1-13+b2 |
| SHA-1 | 6E0AF6BA943306C7C3152233FC97B44081CAA668 |
| SHA-256 | D07266F604F01DBF80E0EF397F64687576526A0D74DAC4FEF82BC76F5A43C248 |