| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-8.6.5/PSQueue-1.1-6609kGsRfMn6U2V0Mb4Srd/Data/PSQueue.p_hi |
| FileSize | 58973 |
| MD5 | 4BFA13C99DD6CB9070759995D40C9BB8 |
| SHA-1 | 2843D55EC89F33218699B978184116AD7B83B415 |
| SHA-256 | 83045DB3F2CA96EBF60361712F023672B4F9AD14EE64E40DF544AE51F88C18C2 |
| SSDEEP | 768:NX1ZrdTUOplWrGjdPrGpYt3axaIzefHHEvTf:N5U6JtCzlTf |
| TLSH | T19443F815EF89D13BD91807B086A64308EFF4D485A686BF5F202461BCAC7B2D17F91B9C |
| 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 | 47368 |
| MD5 | 8F353087DCF36AC85C971B4D39773B61 |
| 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 | Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com> |
| PackageName | libghc-psqueue-prof |
| PackageSection | haskell |
| PackageVersion | 1.1-13build1 |
| SHA-1 | 0D10FD727D14FBD499B1C7C3588FF850A0A3C7DE |
| SHA-256 | 3C913AD49A300A999927DD1BFD55CF9C13FDB8BEA3C7923B45D4681D593C3ADE |