Result for 4D5CA87544DB3954DD4AF43B049AE5366A9C9ED4

Query result

Key Value
FileName./usr/lib/haskell-packages/ghc/lib/arm-linux-ghc-8.0.1/hierarchical-clustering-0.4.6-Ap6qE3Og6fLFLNSA7PLC94/Data/Clustering/Hierarchical/Internal/Types.hi
FileSize33572
MD5CC1B91E028206A10AAD7179AD53F0C01
SHA-14D5CA87544DB3954DD4AF43B049AE5366A9C9ED4
SHA-256ADF818DEA825FF4D7D4E89A92BCE92AE24611B6102E4B68B605E19C41B6E2ADA
SSDEEP384:L7JHxAcppSeQg+mv4gwB56Z815TPkcTT4uKFfeC9xGLJWI8MgIJpoEa6wNJNnV+F:L7dRDUXoIJpoEkJVJWYVHAuC17GMsPCp
TLSHT1C1E2A981AF8AC357ED290B749EBA6319BB34CCC213458B53A90DB930ED772C46D7624D
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
FileSize96604
MD58D266B8E5EADB0836D63B9634005A4F9
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-1C9523BB1E3D0ED2EE2D71A6228EF34533455CB02
SHA-2569E084D5CF155900EF139F51758C2DB2E660E55FD75751CD8FBA891299DC9F412
Key Value
FileSize91892
MD5AF7D6C6EFC7EBE8D0429A74EBA6733CB
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-1DE79A528E550C775B5B4107CDE1CBBC822DD31E8
SHA-256C1407B9F95055705362CD38299B0D569692A730EF9BCF8F6B56F57C75993DBCE