Result for B0959ECB217527ED1645D0D431729D18621DCA56

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/x86_64-linux-ghc-8.8.4/hierarchical-clustering-0.4.7-Cygyc1OFL9mHkRf0Kma1fK/libHShierarchical-clustering-0.4.7-Cygyc1OFL9mHkRf0Kma1fK.a
FileSize324750
MD5502778F19461A04F2CEB51BA59E78147
SHA-1B0959ECB217527ED1645D0D431729D18621DCA56
SHA-2564B94E9B1167463247E0EE9843FCE0F5A92545083872FFF44A538194166CC6382
SSDEEP3072:I9mlQ4VVYSO1HxkYPX1mpsHIZD/0Jbl1SEs51:IXsD31
TLSHT178643321BE67609FFD3CE1714EB047B92A00AE0E879339D17789E7746973DE12A98D40
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
FileSize88912
MD52F26CA8A20AE70E5572488ADCB449B0C
PackageDescriptionfast algorithms for single, average/UPGMA and complete linkage clustering This package provides a function to create a dendrogram from a list of items and a distance function between them. Initially a singleton cluster is created for each item, and then new, bigger clusters are created by merging the two clusters with least distance between them. The distance between two clusters is calculated according to the linkage type. The dendrogram represents not only the clusters but also the order on which they were created. . This package has many implementations with different performance characteristics. There are SLINK and CLINK algorithm implementations that are optimal in both space and time. There are also naive implementations using a distance matrix. Using the dendrogram function from Data.Clustering.Hierarchical automatically chooses the best implementation we have. . This package provides 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-hierarchical-clustering-dev
PackageSectionhaskell
PackageVersion0.4.7-1+b1
SHA-1D70B92DCA6A121C3CA194C71169ABEB70FA39FB0
SHA-25678D03A5D005E761859D8ED8BFE3401153BF5AF4A136508B50B0899E909655CA7
Key Value
FileSize85808
MD510AD223A81A3F7DC5CEC76681601C2F7
PackageDescriptionfast algorithms for single, average/UPGMA and complete linkage clustering This package provides a function to create a dendrogram from a list of items and a distance function between them. Initially a singleton cluster is created for each item, and then new, bigger clusters are created by merging the two clusters with least distance between them. The distance between two clusters is calculated according to the linkage type. The dendrogram represents not only the clusters but also the order on which they were created. . This package has many implementations with different performance characteristics. There are SLINK and CLINK algorithm implementations that are optimal in both space and time. There are also naive implementations using a distance matrix. Using the dendrogram function from Data.Clustering.Hierarchical automatically chooses the best implementation we have. . This package provides a library for the Haskell programming language. See http://www.haskell.org/ for more information on Haskell.
PackageMaintainerUbuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
PackageNamelibghc-hierarchical-clustering-dev
PackageSectionhaskell
PackageVersion0.4.7-1build2
SHA-17E5F7B5A74FE4A5C76D7030E61808F1947F62624
SHA-256DC9EEB09B6638C6FCA511762F426AA973573A61E5C40A337B213F9C221F66E51