| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/mips-linux-ghc-8.8.4/libHSPSQueue-1.1.0.1-5DtmDOZW73VHv1dRPVXwE2-ghc8.8.4.so |
| FileSize | 298840 |
| MD5 | C1437BCEF5978641490A3A443658A585 |
| SHA-1 | 0F8A6EE08D69D397C720D5E24CB243CF464C348E |
| SHA-256 | 18544F33002574FE34C91037C8914AF127D3DA7BC3265E108C0212AD2D6EB846 |
| SSDEEP | 3072:x/zFsZjV7wFCJtINQ7fIPAKGi3uIUz9OsvD6GryFbFKudfHtkixN:2JtVrFi9Gr6bD5Hd |
| TLSH | T1F2548624FF06D6BDCDCF51F99935C1DDFAA104C9A1018B5BA03804E56D33A6BE909CBA |
| 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 | 82172 |
| MD5 | 03FD2DE2A88B898815B7477C0AFB0D53 |
| PackageDescription | Priority Search Queue 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 normal library files. |
| PackageMaintainer | Debian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org> |
| PackageName | libghc-psqueue-dev |
| PackageSection | haskell |
| PackageVersion | 1.1.0.1-3+b1 |
| SHA-1 | 9FB0B99EA5249369D527CCA8383FED3F8ADDD288 |
| SHA-256 | 2F9E7702195F346E466B2ACF71F525CF2FED109E9DC9A8138C7DAFAE0C89A88C |