Ubuntu
haskell-hierarchical-clustering package

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

Changelog

haskell-hierarchical-clustering (0.4.7-3build1) oracular; urgency=medium

  * Rebuild against new GHC ABIs.

 -- Gianfranco Costamagna <email address hidden>  Wed, 15 May 2024 10:23:11 +0200

Upload details

Uploaded by:
Gianfranco Costamagna
Uploaded to:
Oracular
Original maintainer:
Debian Haskell Group
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Oracular release 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-3build1.debian.tar.xz 3.3 KiB 8071b13b51850e21ed16f77bacf7d61e5eacd5a00618cfe90c1a050e2efa12c0
haskell-hierarchical-clustering_0.4.7-3build1.dsc 2.5 KiB c7565577d1961a9e36ec2ea638eb42c46d2ed56beb42d957bf94a07b9bdcbffb

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.