hgeometry-combinatorial

Data structures, and Data types.

LTS Haskell 20.26:	0.14
Stackage Nightly 2022-11-17:	0.14
Latest on Hackage:	0.14

See all snapshots hgeometry-combinatorial appears in

BSD-3-Clause licensed by Frank Staals

Maintained by [email protected]

This version can be pinned in stack with:hgeometry-combinatorial-0.14@sha256:d7a23a48f872eabdc74dfb710c2c17c21e7c3df9cbc6130d24fc2321c45115c4,9556

Module documentation for 0.14

Algorithms
- Algorithms.BinarySearch
- Algorithms.DivideAndConquer
- Algorithms.FloydWarshall
- Algorithms.Graph
- Algorithms.LogarithmicMethod
- Algorithms.StringSearch
  - Algorithms.StringSearch.KMP
Control
- Control.CanAquire
- Control.Monad
  - Control.Monad.State
    - Control.Monad.State.Persistent
Data
- Data.BinaryTree
- Data.CircularList
  - Data.CircularList.Util
- Data.CircularSeq
- Data.Double
  - Data.Double.Approximate
  - Data.Double.Shaman
- Data.DynamicOrd
- Data.Ext
- Data.IndexedDoublyLinkedList
  - Data.IndexedDoublyLinkedList.Bare
- Data.Intersection
- Data.LSeq
- Data.List
  - Data.List.Alternating
  - Data.List.Set
  - Data.List.Util
  - Data.List.Zipper
- Data.Measured
  - Data.Measured.Class
  - Data.Measured.Size
- Data.OrdSeq
- Data.Permutation
- Data.PlanarGraph
  - Data.PlanarGraph.AdjRep
  - Data.PlanarGraph.Dart
  - Data.PlanarGraph.EdgeOracle
  - Data.PlanarGraph.IO
  - Data.PlanarGraph.Immutable
  - Data.PlanarGraph.Mutable
  - Data.PlanarGraph.Persistent
- Data.Range
- Data.RealNumber
  - Data.RealNumber.Rational
- Data.Sequence
  - Data.Sequence.Util
- Data.Set
  - Data.Set.Util
- Data.Tree
  - Data.Tree.Util
- Data.UnBounded
- Data.Util
- Data.Vector
  - Data.Vector.Circular
    - Data.Vector.Circular.Util
- Data.Yaml
  - Data.Yaml.Util
System
- System.Random
  - System.Random.Shuffle

Depends on 34 packages(full list with versions):

Used by 1 package in nightly-2022-11-17(full list with versions):

hgeometry

HGeometry-combinatorial

The combinatorial types for the HGeometry package.

Changes

#+STARTUP: showeverything

* Changelog

** 0.14

- Got rid of proxies to build planar graphs, use TypeApplication
instead. Also slightly changed some of the types to better reflect
what they need; in particular 'buildGraph' now takes only the
adjacency lists (no face information). And 'fromAdjRep' which
computes a PlanarGraph from its adjacencylists (including vertex and
edge info.)
- Cleaning up the public API by hiding several internal modules.

** 0.13

- Moved 'intersects' from the HasIntersectionWith class into a new
class IsIntersectableWith. This allows separate (weaker) constraints
for checking *if* geometries intersect rather than computing exact
intersections.
- Bug fixes in the orientations of boundaries in PlanarGraph.
- Implementation of Logaritmic Method, wich allows us to transform a
static data structure into an insertion only data structure

** 0.12

- Add Data.Double.Approximate: Floating point numbers take take
imprecision into account when ordering.
- Add Data.Double.Shaman: Floating point numbers that keep track of
error bounds while not being more than an order of magnitude slower
than native floating point numbers.
- Add Data.PlanarGraph.Immutable and Data.PlanarGraph.Mutable: New
planargraph implementation that supports efficient updates and queries.

** 0.11

- Changed the implementation of Two and Three in Data.Util
(hgeometry-combinatorial). Now they have proper Functor, Foldable,
and Traversable instances.
- Added Data.RealNumber.Rational wrapping the Rational type giving
some more readable show/read instances
- Added function to compute levels in a Rose-Tree
- Moved the binary searching functions from Data.Sequence.Util into
Algorithms.BinarySearch, also added a version for fractional types
that stops at a given threshold.
- Removed Data.BalBST and Data.SlowSeq
- Moved Measured from Data.BinaryTree into a separate module.

** 0.10

- More Instances

** 0.9

- First release in which hgeometry-combinatorial was split off from hgeometry.