metamorphic-0.1.2.3: metamorphisms: ana . cata or understanding folds and unfolds

Index

/\Alib
><Alib
A 
1 (Type/Class)A
2 (Data Constructor)A
aGraphData
abGraphData
accumAlib
accumFMSimpleMap
addAlib
addToFMSimpleMap
AdjGraph
all2Aprog
any2Aprog
append213Alib
arrAlib
bGraphData
bagAlib
bfsAprog
bfsrAprog
BinAA
binSearchAprog
boolAlib
boolAndAlib
BranchTree
bucketsortAprog
bucketsort'Aprog
bufGraphAlib
buildAprog
buildGrGraph
cGraphData
cardAprog
card_altAprog
cGraphAlib
cListAlib
clr479GraphData
clr486GraphData
clr489GraphData
clr528GraphData
cNatAlib
CollectThread
combineAlib
conA
ContextGraph
contextGraph
countAlib
countdownAprog
cProdAlib
cRoseAlib
cutAlib
cyc3GraphData
dag3GraphData
dag4GraphData
DecompGraph
degGraph
deg'Graph
deleteMinHeap
delFromFMSimpleMap
desA
dfsAprog
dfsnAprog
dfsrAprog
dListAlib
dNatAlib
doubleAprog
dPqueueAlib
dPqueueHAlib
dProdAlib
dRoseAlib
eGraphData
EdgeGraph
edges 
1 (Function)Graph
2 (Function)Aprog
elemFMSimpleMap
embedGraph
Empty 
1 (Data Constructor)Heap
2 (Data Constructor)SimpleMap
empty 
1 (Function)Heap
2 (Function)Graph
emptyFMSimpleMap
eq0Aprog
eq0'Aprog
evnAlib
fac1Aprog
fac2Aprog
fac3Aprog
finalAlib
findMinHeap
FiniteMapSimpleMap
flipTreeAprog
fmapIIA
fmapIRA
fmapLIA
fmToListSimpleMap
foldA
forceListAprog
ForestAlib
forestAlib
forest'Alib
forkAlib
fromBA
fromIdA
fromPA
fromTA
fromUA
gcd'Aprog
gfoldGraph
gmapAprog
GraphGraph
graphAlib
grevAprog
hA
halvesAlib
HeapHeap
heapsortAprog
hhhA
histogramAprog
hyloA
hylotA
I 
1 (Type/Class)A
2 (Data Constructor)A
Id 
1 (Type/Class)A
2 (Data Constructor)A
II 
1 (Type/Class)A
2 (Data Constructor)A
IIFunctorA
IIV 
1 (Type/Class)A
2 (Data Constructor)A
indegGraph
indeg'Graph
innGraph
inn'Graph
insEdgeGraph
insEdgesGraph
insertHeap
insNodeGraph
insNodesGraph
isEmpty 
1 (Function)Heap
2 (Function)Graph
isEmptyFMSimpleMap
isLeafTree
isNullAlib
IxIAlib
jListAlib
JoinAA
joinViewA
jPqueueAlib
jPqueueHAlib
jQueueAlib
jStackAlib
keyTree
kidsAlib
kin248GraphData
lAprog
l1Aprog
l2Aprog
l3Aprog
l4Aprog
lab'Graph
labEdges 
1 (Function)Graph
2 (Function)Aprog
labnlAprog
labNodes 
1 (Function)Graph
2 (Function)Aprog
labSucsAprog
LeafTree
leftTree
length1Aprog
length2Aprog
length3Aprog
length4Aprog
LinGraphAlib
listAlib
listToTreeAprog
log2Aprog
lookupFMSimpleMap
loopGraphData
lt0'Aprog
ManyA
mapEdgesAprog
mapNodesAprog
mapsetAprog
matchGraph
matchAnyGraph
matchSomeGraph
matchTheGraph
maxFMSimpleMap
maybeViewA
MContextGraph
memberAprog
mergeHeap
minFMSimpleMap
minusAprog
mkGraphGraph
mlistAprog
mod'Aprog
multAprog
natAlib
nat2Alib
natsAprog
NdAlib
neighborsGraph
neighbors'Graph
newNodesGraph
NoAlib
Node 
1 (Data Constructor)Heap
2 (Data Constructor)SimpleMap
3 (Type/Class)Graph
node'Graph
nodeIdAprog
nodeRangeGraph
nodes 
1 (Function)Graph
2 (Function)Aprog
noEdgesAprog
NoKAlib
noLabAprog
noNodesGraph
ntBUA
ntPBA
ntTBA
NullAlib
oAlib
OKAlib
outGraph
out'Graph
outdegGraph
outdeg'Graph
PowAA
PowerA
powerAprog
pqueueAlib
pqueueHAlib
preGraph
pre'Graph
predFMSimpleMap
preorderAprog
prodAlib
q1Alib
q2Alib
q23Alib
q4Alib
queueAlib
quicksortAprog
rangeFMSimpleMap
remdupAprog
restAlib
revAprog
rightTree
rngAlib
rng'Alib
rootAlib
RoseAlib
roseAlib
rose1Aprog
rose2Aprog
selAlib
setAlib
showsTreeTree
sizeAprog
sizeFMSimpleMap
spAprog
sp1Aprog
SplitThread
splitFMSimpleMap
SplitMThread
splitMinHeap
splitMinFMSimpleMap
splitParThread
splitParMThread
split_arrAlib
split_bagAlib
stackAlib
streamA
sucGraph
suc'Graph
succFMSimpleMap
sucsAprog
sum'Aprog
summAlib
sumsetAprog
SymAA
tAprog
t1Aprog
t2Aprog
t3Aprog
t4Aprog
ThreadThread
threadListThread
threadList'Thread
threadMaybeThread
threadMaybe'Thread
toBA
toB'A
toIdA
toPA
toP'A
toTA
toUA
transA
transitA
TreeTree
treeAlib
tree'Aprog
ufoldGraph
UIIVUA
UII_UA
undirGraph
unfoldA
unitHeap
UnitPA
updFMSimpleMap
U_I_UA
viaA
\\Graph