Safe Haskell | Safe |
---|---|
Language | Haskell2010 |
Internal types.
You may want to keep off these.
- type GraphName = Text
- data GraphType
- type AttributeName = Text
- type AttributeValue = Text
- type Attribute = (AttributeName, AttributeValue)
- data NodeId
- data DecType
- data DotGraph = Graph GraphType GraphName Dot
- data RankdirType
- data Dot
- newtype Identity a :: * -> * = Identity {
- runIdentity :: a
- class Monoid a where
Documentation
Type of a graph, directed or undirected.
This also specifies what edge declarations look like.
type AttributeName = Text Source #
Attribute name: just text
type AttributeValue = Text Source #
Attribute value: just text
type Attribute = (AttributeName, AttributeValue) Source #
Attribute: a tuple of name and value.
A node identifier.
This is either a user supplied name or a generated numerical identifier.
Declaration type
Used to declare common attributes for nodes or edges.
A Haphviz Graph
data RankdirType Source #
Rankdir Type
Used to specify the default node layout direction
Haphviz internal graph content AST
Re-exports
newtype Identity a :: * -> * #
Identity functor and monad. (a non-strict monad)
Since: 4.8.0.0
Identity | |
|
The class of monoids (types with an associative binary operation that has an identity). Instances should satisfy the following laws:
mappend mempty x = x
mappend x mempty = x
mappend x (mappend y z) = mappend (mappend x y) z
mconcat =
foldr
mappend mempty
The method names refer to the monoid of lists under concatenation, but there are many other instances.
Some types can be viewed as a monoid in more than one way,
e.g. both addition and multiplication on numbers.
In such cases we often define newtype
s and make those instances
of Monoid
, e.g. Sum
and Product
.
Identity of mappend
An associative operation
Fold a list using the monoid.
For most types, the default definition for mconcat
will be
used, but the function is included in the class definition so
that an optimized version can be provided for specific types.
Monoid Ordering | |
Monoid () | |
Monoid All | |
Monoid Any | |
Monoid Builder | |
Monoid IntSet | |
Monoid Dot # | Dot is a monoid, duh, that's the point. |
Monoid [a] | |
Monoid a => Monoid (Maybe a) | Lift a semigroup into |
Monoid a => Monoid (IO a) | |
Ord a => Monoid (Max a) | |
Ord a => Monoid (Min a) | |
Monoid a => Monoid (Identity a) | |
(Ord a, Bounded a) => Monoid (Min a) | |
(Ord a, Bounded a) => Monoid (Max a) | |
Monoid m => Monoid (WrappedMonoid m) | |
Semigroup a => Monoid (Option a) | |
Monoid a => Monoid (Dual a) | |
Monoid (Endo a) | |
Num a => Monoid (Sum a) | |
Num a => Monoid (Product a) | |
Monoid (First a) | |
Monoid (Last a) | |
Monoid (IntMap a) | |
Monoid (Seq a) | |
Ord a => Monoid (Set a) | |
Monoid b => Monoid (a -> b) | |
(Monoid a, Monoid b) => Monoid (a, b) | |
Monoid (Proxy k s) | |
Ord k => Monoid (Map k v) | |
(Monoid a, Monoid b, Monoid c) => Monoid (a, b, c) | |
Monoid a => Monoid (Const k a b) | |
Alternative f => Monoid (Alt * f a) | |
(Monoid a, Monoid b, Monoid c, Monoid d) => Monoid (a, b, c, d) | |
(Monoid a, Monoid b, Monoid c, Monoid d, Monoid e) => Monoid (a, b, c, d, e) | |