haskell-hierarchical-clustering 0.4.7-1build1 source package in Ubuntu

Changelog

haskell-hierarchical-clustering (0.4.7-1build1) groovy; urgency=medium

  * No change rebuild against new ghc ABI.

 -- Dimitri John Ledkov <email address hidden>  Tue, 21 Jul 2020 14:07:16 +0100

Upload details

Uploaded by:
Dimitri John Ledkov on 2020-07-21
Uploaded to:
Groovy
Original maintainer:
Ubuntu Developers
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Groovy release on 2020-07-27 universe misc

Downloads

File Size SHA-256 Checksum
haskell-hierarchical-clustering_0.4.7.orig.tar.gz 10.4 KiB 138f46160ee436293326a575bf6fd3caceb6dc7b91164d78a02582c6e0c6d195
haskell-hierarchical-clustering_0.4.7-1build1.debian.tar.xz 3.0 KiB 787ea98c5f823b9e0ad619208a606abe8ca4c017bd93d45dd26ba9eebadf741e
haskell-hierarchical-clustering_0.4.7-1build1.dsc 2.6 KiB b34dd375e2227aa62f222e0949c9aaf45e8429250b27bcb02c9a04d064401c3b

View changes file

Binary packages built by this source

libghc-hierarchical-clustering-dev: fast 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.

libghc-hierarchical-clustering-doc: fast algorithms for single, average/UPGMA and complete linkage clustering; documentation

 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 the documentation for a library for the Haskell
 programming language.
 See http://www.haskell.org/ for more information on Haskell.

libghc-hierarchical-clustering-prof: fast algorithms for single, average/UPGMA and complete linkage clustering; profiling libraries

 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, compiled
 for profiling. See http://www.haskell.org/ for more information on Haskell.