| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/PSQueue-1.1/ghc-7.6.3/libHSPSQueue-1.1_p.a |
| FileSize | 388054 |
| MD5 | 6E1F651A283DB93B7188B8F828360A4C |
| SHA-1 | F10458F79EBAC43F63E4110F7CF9B1A78D57A525 |
| SHA-256 | 0095839865283833E79F1A9D1269C4EBA9208E982EB0361B73174469D2AFEC2F |
| SSDEEP | 6144:vZSh+Qt68/YbPnOyaQDpiPOj0JDEdjXXmPLlp6L63qPz/r7zfVQNuk49Rd:vZSh+Qt68/h3oR/riNt8P |
| TLSH | T1998475525740CA23D90EFEBBD10F9758BBBE9A065399C722082047F85F67DE61C32E19 |
| 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 | 99172 |
| MD5 | A05DE84C6780E63F8F8EB2127A90436F |
| 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-4 |
| SHA-1 | C0F8CF7FD19B90BCACABAC43EB2118C7FE49B86F |
| SHA-256 | 2441DED627C66CCC7474377DC90191D5C100482E2CE2C01324E063B760551070 |