| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/i386-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/Data/PSQueue.p_hi |
| FileSize | 54569 |
| MD5 | 71DAA145F885A288276A63A255CA15B9 |
| SHA-1 | BA92B1FD4A4D35E53D9818D07029AA4A02B9D455 |
| SHA-256 | 268B932E9FC6050F0A9CA3C5C48E5FF9F84EAD3C1D4774BA5000998D415BE065 |
| SSDEEP | 768:Ai+SbA2kJFvwq7ETgM1u9RptuwaEDOxJKRJbCIEaJTlp5:Ai+SbA2kJFviTFybuADOxJxCTlp5 |
| TLSH | T1C5333701EF92F357D81A4A3097BBD70D7B24D9C12B26AB6F0024247CED727C92DB525A |
| 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 | 69008 |
| MD5 | 40539A02855A0B17A6EB84E17D96BF9C |
| 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-10 |
| SHA-1 | E0B79C22409FAB04EC4E368A89A08F8A94C74F8D |
| SHA-256 | F5C414A54C0DD6B0C9DFE8DADF2CD9049BCDA99500987B26DEA3B5DF3B5CB069 |
| Key | Value |
|---|---|
| FileSize | 73752 |
| MD5 | 34F5CE687ABC9635FD61331F02A9941D |
| 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-10 |
| SHA-1 | 2ED6CDA702AFE3B8EDD25B5AEA94159027C005D6 |
| SHA-256 | ABA7CE27BF2DBAB0587D4DF789D183109246ED58C7A136EFCE2DCA2D59653578 |
| Key | Value |
|---|---|
| FileSize | 74274 |
| MD5 | 19ACAA6BC83CF430D4D6F6034A5BF913 |
| 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-10 |
| SHA-1 | E5586CEEC0327F0510B33415951DD542064A084E |
| SHA-256 | F99C98871C0856BD448870186FEF85A6FE543945764C1394995EFBFB31904502 |