| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-8.8.4/PSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2/Data/PSQueue.p_hi |
| FileSize | 60598 |
| MD5 | 1036EEA6632BB9FCD4F370FE49922D66 |
| SHA-1 | 8368DE66A62B7C8864FB5AA97AEFB855C9B20DE1 |
| SHA-256 | 7E25B118580BBCD6B91FB7268CDA78CA0DC821ED0817BE95847E3AC54EFD87AF |
| SSDEEP | 768:9DAOLDISo8ADbScfDCOmDQSDDCSBDUSWDjSQD7SQ1DGSakneS0DDOHUkOGSaI2F/:oLRwrix2g5f1RTf |
| TLSH | T14943AF17EF89D173CA290AB087B343492B90D8919E89AF4F201451EDDDB31D22FD5BD9 |
| 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 | 61044 |
| MD5 | 7739861486504654559117CD6A270F34 |
| 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.0.1-3+b1 |
| SHA-1 | A5EF9FB5E08AB81E7246AE2034E1C5E0BDE86D85 |
| SHA-256 | 5A4ED0CA232FCC043181A0C5B42E8DAD8F5ED918A8582402E0DD129A0DA2AE01 |
| Key | Value |
|---|---|
| FileSize | 59716 |
| MD5 | 2696FE105A61878013618CA6EA79800C |
| 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.0.1-3+b1 |
| SHA-1 | 6434EA5EF0030CEB8CFDF757AB5A55E44851D254 |
| SHA-256 | E5299B2DF7DDC5CC54C94CFBBC2FEA20EE272E407C09C816762DFDD169393EEF |
| Key | Value |
|---|---|
| FileSize | 60516 |
| MD5 | 9E656E2D74987C45EBEFD317F168C1FC |
| 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.0.1-3+b1 |
| SHA-1 | 80A6C470D15D24D0CD8450599E0D60480650CC9F |
| SHA-256 | 467FD30FA332184B0CA24A3102690422BC3285F3FA3CDC7B5A9D5B8794C118C0 |