| Key | Value |
|---|---|
| FileName | ./usr/lib/haskell-packages/ghc/lib/PSQueue-1.1/ghc-7.6.3/libHSPSQueue-1.1_p.a |
| FileSize | 274532 |
| MD5 | B549166A8D60092E4BEF98EADD61E9A7 |
| SHA-1 | 1490A5EE15E23803E3FDBE79D99304402464E63C |
| SHA-256 | A355FD71EB63109DCAA0971801475BDBCDDF16431DEAC249C932D3327DD36F76 |
| SSDEEP | 3072:Dq/oG9frOjXGs4lKKBnrtJMY9bb4GYLPIL09epyyWBmpgdMaiKWJr3elnW696J42:GoG9J9cAkMjrOlJ9KuM |
| TLSH | T10B44DA41734CC909C65E5BB24BAF73197259C32C865EE74F3C94E6683E01EE2BE1662C |
| 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 | 69660 |
| MD5 | 8776E415EE940AA60F8077A1A96D8398 |
| 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-4 |
| SHA-1 | 211E6651D80F9AFD9A040DB9FB7EC9E71C59363B |
| SHA-256 | 751693CD8B56B80CEED4DB8EAD23C59BBFC82BD4A81DD24FDA9F0450BF18E830 |