Result for 677E8510873B9EA85DB60F3EF568BB5D74F01BB3

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/s390x-linux-ghc-8.0.1/hierarchical-clustering-0.4.6-Ap6qE3Og6fLFLNSA7PLC94/Data/Clustering/Hierarchical/Internal/Types.dyn_hi
FileSize33592
MD56D231CBE6BC90DE3462CEEE275AEF098
SHA-1677E8510873B9EA85DB60F3EF568BB5D74F01BB3
SHA-256E568A46D2151E4525570720A23C702592D6317130C6EA15633C8BB70483D27FB
SSDEEP768:Bqwxad2JPWZMgt1OUW1GqcDhM17GMsPCp:BqwxadrZMgt1lMTp
TLSHT124E2A691AF46D362E9264B709EBE6309BF31CDC112568B53C40AB430ED773C86D7668E
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
FileSize109164
MD55C3AE80760307A2A08A0B4EEF4BFEA8A
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.6-3+b1
SHA-1E67E7799F5742C2A2162D34D364C299FEF010157
SHA-2560341FCE7EA96B0C4D7B1801D91CC89985C65840F7CEB495C0A4DB76C9312AC1C
Key Value
FileSize110160
MD5CCAE12272D90AF57E1B6BB26C7B7D0FA
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.6-3+b1
SHA-1FED210DE990B3C85CFE9D1F4C49DAC4251049D2C
SHA-25618D52025C67560A0ABC5790771D16F1436D09FDEA4F16689F41606CE82CBBF18
Key Value
FileSize148926
MD5FC6D95F6D834FA2B90F932B918C84DFB
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.6-3+b1
SHA-1A712BADA341187DF41B60DF890F68AA573C11E6B
SHA-2563C34B5A2AF4E1C63694CCE9CA404E55D49201826EACFFA1799D1148A4A315704