Idris2Doc : Geom.Gen2D.Types

Geom.Gen2D.Types

(source)

Reexports

importpublic Chem
importpublic Data.Graph.Indexed.Subgraph

Definitions

0Nodes : Nat->Type
Totality: total
Visibility: public export
0SnocNodes : Nat->Type
Totality: total
Visibility: public export
dataAttachPoint : Nat->Type
Totality: total
Visibility: public export
Constructors:
None : AttachPointk
Attach : Fink->Fink->AttachPointk

Hints:
Eq (AttachPointk)
Show (AttachPointk)
0SubgraphType : Bool->Nat->Type->Type->Type
Totality: total
Visibility: public export
recordComponent : Nat->Type->Type->Type
  A component is a part of a molecular graph that will be placed
as a single unit.

Every componenent `c` except the first (the "main component")
comes with an attachement point: A node in another component
that will be placed before `c`.

Totality: total
Visibility: public export
Constructor: 
C : AttachPointk->List (Fink) -> (isRing : Bool) ->SubgraphTypeisRingken->Componentken

Projections:
.attach : Componentken->AttachPointk
.isRing : Componentken->Bool
.nodes : Componentken->List (Fink)
.subgraph : ({rec:0} : Componentken) ->SubgraphType (isRing{rec:0}) ken
.attach : Componentken->AttachPointk
Totality: total
Visibility: public export
attach : Componentken->AttachPointk
Totality: total
Visibility: public export
.nodes : Componentken->List (Fink)
Totality: total
Visibility: public export
nodes : Componentken->List (Fink)
Totality: total
Visibility: public export
.isRing : Componentken->Bool
Totality: total
Visibility: public export
isRing : Componentken->Bool
Totality: total
Visibility: public export
.subgraph : ({rec:0} : Componentken) ->SubgraphType (isRing{rec:0}) ken
Totality: total
Visibility: public export
subgraph : ({rec:0} : Componentken) ->SubgraphType (isRing{rec:0}) ken
Totality: total
Visibility: public export
0SnocComps : Nat->Type->Type->Type
Totality: total
Visibility: public export
0Comps : Nat->Type->Type->Type
Totality: total
Visibility: public export
components : IGraphken->List (Componentken)
  Partitions the nodes of a graph into disjoint components,
which will be placed individually in the given order.

The first component to be placed will be the most complex
cyclic system (if any) or the longest chain. All other
components in the list are linked via an `AttachPoint` to
a parent component, which will be placed first.

Totality: total
Visibility: export