Result for C6699C3B7BD604730767FD5F38B1B11B4924571D

Query result

Key Value
FileName./usr/lib64/ghc-8.6.5/psqueues-0.2.7.2/libHSpsqueues-0.2.7.2-2yu6s18I89UBEkQUKORawe-ghc8.6.5.so
FileSize520464
MD5E3DFE051D097E83CF8BD1F5B942F52B3
SHA-1C6699C3B7BD604730767FD5F38B1B11B4924571D
SHA-25693FF2B54F24F352465902D882BC386102E10D08F003A8F4730B965D2119A9A4D
SSDEEP12288:tvIoe7LfQaz660G/Vq55HbwSx8HAVbTu5A6R7ajeeMTRgc:E7LfQK660G/Vq55HbwSx8HAVbTu5A6RJ
TLSHT1A0B4C833CED99AC9C93E95B4ABC80E6519E3544687066B3317F04A285DA3CC07ADF6F0
hashlookup:parent-total2
hashlookup:trust60

Network graph view

Parents (Total: 2)

The searched file hash is included in 2 parent files which include package known and seen by metalookup. A sample is included below:

Key Value
MD5F47DB0F8B73340E2B344B5BD4A9F4A83
PackageArchx86_64
PackageDescriptionThe psqueues package provides <http://en.wikipedia.org/wiki/Priority_queue Priority Search Queues> in three different flavors. * 'OrdPSQ k p v', which uses the 'Ord k' instance to provide fast insertion, deletion and lookup. This implementation is based on Ralf Hinze's <http://citeseer.ist.psu.edu/hinze01simple.html A Simple Implementation Technique for Priority Search Queues>. Hence, it is similar to the <http://hackage.haskell.org/package/PSQueue PSQueue> library, although it is considerably faster and provides a slightly different API. * 'IntPSQ p v' is a far more efficient implementation. It fixes the key type to 'Int' and uses a <http://en.wikipedia.org/wiki/Radix_tree radix tree> (like 'IntMap') with an additional min-heap property. * 'HashPSQ k p v' is a fairly straightforward extension of 'IntPSQ': it simply uses the keys' hashes as indices in the 'IntPSQ'. If there are any hash collisions, it uses an 'OrdPSQ' to resolve those. The performance of this implementation is comparable to that of 'IntPSQ', but it is more widely applicable since the keys are not restricted to 'Int', but rather to any 'Hashable' datatype. Each of the three implementations provides the same API, so they can be used interchangeably. The benchmarks show how they perform relative to one another, and also compared to the other Priority Search Queue implementations on Hackage: <http://hackage.haskell.org/package/PSQueue PSQueue> and <http://hackage.haskell.org/package/fingertree-psqueue fingertree-psqueue>. <<http://i.imgur.com/KmbDKR6.png>> <<http://i.imgur.com/ClT181D.png>> Typical applications of Priority Search Queues include: * Caches, and more specifically LRU Caches; * Schedulers; * Pathfinding algorithms, such as Dijkstra's and A*.
PackageNameghc-psqueues
PackageReleaselts13.1.15
PackageVersion0.2.7.2
SHA-1002FFE401BC7C78FB4E978F28E9089CA1706CFCC
SHA-2562158454FC678EAE119E954C9EC35FAFF582538DEA76448113BF906C154668EE6
Key Value
MD5C36894CAE92B57A6C0AA049AD1D7C75E
PackageArchx86_64
PackageDescriptionThe psqueues package provides <http://en.wikipedia.org/wiki/Priority_queue Priority Search Queues> in three different flavors. * 'OrdPSQ k p v', which uses the 'Ord k' instance to provide fast insertion, deletion and lookup. This implementation is based on Ralf Hinze's <http://citeseer.ist.psu.edu/hinze01simple.html A Simple Implementation Technique for Priority Search Queues>. Hence, it is similar to the <http://hackage.haskell.org/package/PSQueue PSQueue> library, although it is considerably faster and provides a slightly different API. * 'IntPSQ p v' is a far more efficient implementation. It fixes the key type to 'Int' and uses a <http://en.wikipedia.org/wiki/Radix_tree radix tree> (like 'IntMap') with an additional min-heap property. * 'HashPSQ k p v' is a fairly straightforward extension of 'IntPSQ': it simply uses the keys' hashes as indices in the 'IntPSQ'. If there are any hash collisions, it uses an 'OrdPSQ' to resolve those. The performance of this implementation is comparable to that of 'IntPSQ', but it is more widely applicable since the keys are not restricted to 'Int', but rather to any 'Hashable' datatype. Each of the three implementations provides the same API, so they can be used interchangeably. The benchmarks show how they perform relative to one another, and also compared to the other Priority Search Queue implementations on Hackage: <http://hackage.haskell.org/package/PSQueue PSQueue> and <http://hackage.haskell.org/package/fingertree-psqueue fingertree-psqueue>. <<http://i.imgur.com/KmbDKR6.png>> <<http://i.imgur.com/ClT181D.png>> Typical applications of Priority Search Queues include: * Caches, and more specifically LRU Caches; * Schedulers; * Pathfinding algorithms, such as Dijkstra's and A*.
PackageNameghc-psqueues
PackageReleaseghc86.4.7
PackageVersion0.2.7.2
SHA-1C76298AE7C39072C48D92144FAEEE1E4F5B7DB0F
SHA-25678824C5C6F2D4F434F57352DCCBFE022E5B39851BBBD43A2B8B92135DD811452