Key | Value |
---|---|
FileName | ./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.0.1/PSQueue-1.1-DNpDWrWkOL4BwO0e9gII0d/Data/PSQueue.dyn_hi |
FileSize | 53398 |
MD5 | E9C341D106CBEFE5C482A9AB8D79FEFA |
SHA-1 | 58F677936C76E6CA0CCF128C8AC5A9299B77D843 |
SHA-256 | C21C7128D9234D1CAF9FDEC0E7411AE5DC83CD2C5BDBD409213757970BE3CA32 |
SSDEEP | 768:+6GuXIINdLguYoCw2ycgfVNjaFf3HJaHzZJb/sWDOS:+6GuXIINdLnCwn/mfZaHZCS |
TLSH | T1F3332801EF92F357D81A4A3097BBE70D7B24D9C12B16AB6F4028247CED727C52DB521A |
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 | 82296 |
MD5 | E2F6AD116DB9250294CC9334B130327A |
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-10 |
SHA-1 | 2F3BBC35150833B1114772B391654FBE9D3ECEA5 |
SHA-256 | 8D0948201F04503EF20013302F3FA4D9439181285D34338D1D542251C95856A1 |
Key | Value |
---|---|
FileSize | 131980 |
MD5 | D4EB541E882E0732CAEFE0E2D5554392 |
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-10 |
SHA-1 | 68E51C82B391EEFFB47F7A68F55D26BCBCA75451 |
SHA-256 | 6B0AA1532DC136B86777037969B6F1FE48281FB17E30085D2366B3F57A5CE5F9 |
Key | Value |
---|---|
FileSize | 83106 |
MD5 | 99519FB123D398BFD137501622828C3A |
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-10 |
SHA-1 | 85BD1853BC36C7BECE954EA0F0FA60DD04846AEA |
SHA-256 | 39D1A3FB3D402061A2EFA0F241750CAF2CB74ECEAA954D2DDAB18F092E6991BF |