HORIZON HASKELLDocslts/ghc-9.10.xc74966e2026-09-27Search names, modules, packages, or :: a typeCtrl K

GHC 9.10.3 · lts/ghc-9.10.x · c74966e · 2026-09-27

Moduledual-tree-0.2.3.1Haskell2010

Data.Tree.DUAL.Internal

This module provides access to all of the internals of the DUAL-tree implementation. Depend on the internals at your own risk! For a safe public API (and complete documentation), see Data.Tree.DUAL.

The main things exported by this module which are not exported from Data.Tree.DUAL are two extra types used in the implementation of DUALTree, along with functions for manipulating them. A type of non-empty trees, DUALTreeNE, is defined, as well as the type DUALTreeU which represents a non-empty tree paired with a cached u annotation. DUALTreeNE and DUALTreeU are mutually recursive, so that recursive tree nodes are interleaved with cached u annotations. DUALTree is defined by just wrapping DUALTreeU in 'Maybe. This method has the advantage that the type system enforces the invariant that there is only one representation for the empty tree. It also allows us to get away with only Semigroup constraints in many places.

  • 3 types
  • 15 values
  • Packagedual-tree-0.2.3.1
  • Exports18
  • LanguageHaskell2010
  • LicenceBSD-3-Clause
  • SourceInternal.hs

DUAL-trees

3 declarations
datadata DUALTreeNE d u a l
#

Non-empty DUAL-trees.

Constructors

Instances5Action, Functor, Eq, Show, Semigroup
newtypenewtype DUALTreeU d u a l
#

A non-empty DUAL-tree paired with a cached u value. These should never be constructed directly; instead, use pullU.

Constructors

Instances5Action, Functor, Eq, Show, Semigroup
newtypenewtype DUALTree d u a l
#

Rose (n-ary) trees with both upwards- (i.e. cached) and downwards-traveling (i.e. accumulating) monoidal annotations. Abstractly, a DUALTree is a rose (n-ary) tree with data (of type l) at leaves, data (of type a) at internal nodes, and two types of monoidal annotations, one (of type u) travelling "up" the tree and one (of type d) traveling "down". See the documentation at the top of this file for full details.

DUALTree comes with some instances:

  • Functor, for modifying leaf data. Note that fmap of course cannot alter any u annotations.

  • Semigroup. DUALTreeNEs form a semigroup where (<>) corresponds to adjoining two trees under a common parent root, with sconcat specialized to put all the trees under a single parent. Note that this does not satisfy associativity up to structural equality, but only up to observational equivalence under flatten. Technically using foldDUAL directly enables one to observe the difference, but it is understood that foldDUAL should be used only in ways such that reassociation of subtrees "does not matter".

  • Monoid. The identity is the empty tree.

Constructors

Instances6Action, Functor, Eq, Show, Semigroup, Monoid
  • (Semigroup d, Semigroup u, Action d u) => Action (DAct d) (DUALTree d u a l)Defined in dual-tree-0.2.3.1 · Data.Tree.DUAL.Internal

    Apply a d annotation at the root of a tree. Semantically, all u annotations are transformed by the action of d, although operationally act incurs only a constant amount of work.

  • Functor (DUALTree d u a)Defined in dual-tree-0.2.3.1 · Data.Tree.DUAL.Internal
  • (Eq u, Eq l, Eq d, Eq a) => Eq (DUALTree d u a l)Defined in dual-tree-0.2.3.1 · Data.Tree.DUAL.Internal
  • (Show u, Show l, Show d, Show a) => Show (DUALTree d u a l)Defined in dual-tree-0.2.3.1 · Data.Tree.DUAL.Internal
  • (Semigroup u, Action d u) => Semigroup (DUALTree d u a l)Defined in dual-tree-0.2.3.1 · Data.Tree.DUAL.Internal
  • (Semigroup u, Action d u) => Monoid (DUALTree d u a l)Defined in dual-tree-0.2.3.1 · Data.Tree.DUAL.Internal

Constructing DUAL-trees

5 declarations
valueempty :: DUALTree d u a l
#

The empty DUAL-tree. This is a synonym for mempty, but with a more general type.

valueleaf :: u -> l -> DUALTree d u a l
#

Construct a leaf node from a u annotation along with a leaf datum.

valueleafU :: u -> DUALTree d u a l
#

Construct a leaf node from a u annotation.

valueannot
  1. :: (Semigroup u, Action d u)
  2. => a
  3. -> DUALTree d u a l
  4. -> DUALTree d u a l
#

Add an internal data value at the root of a tree. Note that this only works on non-empty trees; on empty trees this function is the identity.

Modifying DUAL-trees

5 declarations
valueapplyUpre
  1. :: (Semigroup u, Action d u)
  2. => u
  3. -> DUALTree d u a l
  4. -> DUALTree d u a l
#

Add a u annotation to the root, combining it (on the left) with the existing cached u annotation. This function is provided just for convenience; applyUpre u t = leafU u <> t.

valueapplyUpost
  1. :: (Semigroup u, Action d u)
  2. => u
  3. -> DUALTree d u a l
  4. -> DUALTree d u a l
#

Add a u annotation to the root, combining it (on the right) with the existing cached u annotation. This function is provided just for convenience; applyUpost u t = t <> leafU u.

valuemapUNE :: (u -> u') -> DUALTreeNE d u a l -> DUALTreeNE d u' a l
#

Map a function (which must be a monoid homomorphism, and commute with the action of d) over all the u annotations in a non-empty DUAL-tree.

valuemapUU :: (u -> u') -> DUALTreeU d u a l -> DUALTreeU d u' a l
#

Map a function (which must be a monoid homomorphism, and commute with the action of d) over all the u annotations in a non-empty DUAL-tree paired with its cached u value.

valuemapU :: (u -> u') -> DUALTree d u a l -> DUALTree d u' a l
#

Map a function over all the u annotations in a DUAL-tree. The function must be a monoid homomorphism, and must commute with the action of d on u. That is, to use mapU f safely it must be the case that

  • f mempty == mempty
  • f (u1 <> u2) == f u1 <> f u2
  • f (act d u) == act d (f u)

Accessors and eliminators

5 declarations
valuenonEmpty :: DUALTree d u a l -> Maybe (u, DUALTreeNE d u a l)
#

Decompose a DUAL-tree into either Nothing (if empty) or a top-level cached u annotation paired with a non-empty DUAL-tree.

valuegetU :: DUALTree d u a l -> Maybe u
#

Get the u annotation at the root, or Nothing if the tree is empty.

valuefoldDUALNE
  1. :: (Semigroup d, Monoid d)
  2. => (d -> l -> r)

    Process a leaf datum along with the accumulation of d values along the path from the root

  3. -> r

    Replace LeafU nodes

  4. -> (NonEmpty r -> r)

    Combine results at a branch node

  5. -> (d -> r -> r)

    Process an internal d node

  6. -> (a -> r -> r)

    Process an internal datum

  7. -> DUALTreeNE d u a l
  8. -> r
#

Fold for non-empty DUAL-trees.

valuefoldDUAL
  1. :: (Semigroup d, Monoid d)
  2. => (d -> l -> r)

    Process a leaf datum along with the accumulation of d values along the path from the root

  3. -> r

    Replace u-only nodes

  4. -> (NonEmpty r -> r)

    Combine results at a branch node

  5. -> (d -> r -> r)

    Process an internal d node

  6. -> (a -> r -> r)

    Process an internal datum

  7. -> DUALTree d u a l
  8. -> Maybe r
#

Fold for DUAL-trees. It is given access to the internal and leaf data, internal d values, and the accumulated d values at each leaf. It is also allowed to replace "u-only" leaves with a constant value. In particular, however, it is not given access to any of the u annotations, the idea being that those are used only for constructing trees. If you do need access to u values, you can duplicate the values you need in the internal data nodes.

Be careful not to mix up the d values at internal nodes with the d values at leaves. Each d value at a leaf satisfies the property that it is the mconcat of all internal d values along the path from the root to the leaf.

The result is Nothing if and only if the tree is empty.

valueflatten :: (Semigroup d, Monoid d) => DUALTree d u a l -> [(l, d)]
#

A specialized fold provided for convenience: flatten a tree into a list of leaves along with their d annotations, ignoring internal data values.