Result for 309866FEB5B18FC0E30F606DF99B8325960780B1

Query result

Key Value
FileName./usr/share/doc/ghc-8.4.4/html/libraries/psqueues-0.2.7.0/psqueues.txt
FileSize20031
MD582022CD8E71D263DEAD3C563936F703B
SHA-1309866FEB5B18FC0E30F606DF99B8325960780B1
SHA-2563F8D63A6F0D346996453C5F5D4253E14BFE18CD56E14694969902ACD231C211B
SSDEEP384:Eg3l/NSDfpz96LQmvOllfs3i3hM2Bz2eerGTP/qr1w/Xctyfs3YCoSp0f6sFwYjc:+9PE3WMqbgwaEE3ySIBE34gJ
TLSHT1CB9243E277C4533207FCD1FA46AB8BA6DFAB658651476048005CD0A6A3AFD78E1E7D80
hashlookup:parent-total3
hashlookup:trust65

Network graph view

Parents (Total: 3)

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
MD5220FAB4ACBADBC62FB6A28A28A6798FA
PackageArchx86_64
PackageDescriptionThis package provides the Haskell psqueues library development files.
PackageNameghc-psqueues-devel
PackageRelease3.10
PackageVersion0.2.7.0
SHA-1A2D2D405CCEC7EE74C32E420C4EF68978192E01D
SHA-2566E310A678899907E5704B687EC561A84DCC2F6C3479805A0EF199C935EB02F9B
Key Value
MD5DF2F9B76E53F5A91B5D6D289141DCD94
PackageArchx86_64
PackageDescriptionThis package provides the Haskell psqueues library development files.
PackageNameghc-psqueues-devel
PackageReleaselp150.3.2
PackageVersion0.2.7.0
SHA-181445CCDCFDEBEDAA3C48464B86B60F213FA256F
SHA-256DC852AD5A4DA678C19B8B058C51115A6AB6528EECBA553B545658BE6C52700EF
Key Value
FileSize93168
MD54B516A834B109FC3FB5D0618F3C4FFEA
PackageDescriptionPure priority search queues; documentation This package provides 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 "A Simple Implementation Technique for Priority Search Queues". Hence, it is similar to the 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 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. . Typical applications of Priority Search Queues include: . * Caches, and more specifically LRU Caches; . * Schedulers; . * Pathfinding algorithms, such as Dijkstra's and A*. . This package provides the documentation for a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainerDebian Haskell Group <pkg-haskell-maintainers@lists.alioth.debian.org>
PackageNamelibghc-psqueues-doc
PackageSectiondoc
PackageVersion0.2.7.0-2
SHA-15CCF69EE83A547738E1D3239D59A1284C91E713F
SHA-256706452C8435E4EFB73D1A3C25178FED96C9D23EA1C903EB8BB8937A55C20D2CB