| Package | Description |
|---|---|
| io.ataraxic.nomicflux.voyageur | |
| io.ataraxic.nomicflux.voyageur.fold | |
| io.ataraxic.nomicflux.voyageur.impl |
| Modifier and Type | Method and Description |
|---|---|
default Fn1<N,Choice2<G,Tuple2<Context<A,N,E,I>,G>>> |
Graph.atNode() |
Choice2<G,Tuple2<Context<A,N,E,I>,G>> |
Graph.atNode(N node)
|
Maybe<Tuple2<Context<A,N,E,I>,G>> |
Graph.decompose()
Implementation-dependent and possibly non-deterministic decomposition of a graph into a
Context
and the rest of the graph |
| Modifier and Type | Method and Description |
|---|---|
default <S,Acc> Acc |
Graph.guidedCutFold(Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
State<S,FoldContinue<N>> contextGetter,
Fn2<Acc,Context<A,N,E,I>,State<S,Acc>> accumulator,
S defState,
Acc defAcc)
Fold a graph into an accumulation, using stateful methods to guide the traversal of the graph, and a cutoff
function to end the fold early
|
default <S,Acc> Acc |
Graph.guidedCutFold(Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
State<S,FoldContinue<N>> contextGetter,
Fn2<Acc,Context<A,N,E,I>,State<S,Acc>> accumulator,
S defState,
Acc defAcc)
Fold a graph into an accumulation, using stateful methods to guide the traversal of the graph, and a cutoff
function to end the fold early
|
default <S,Acc> Acc |
Graph.guidedFold(State<S,FoldContinue<N>> contextGetter,
Fn2<Acc,Context<A,N,E,I>,State<S,Acc>> accumulator,
S defState,
Acc defAcc)
Fold a graph into an accumulation, using stateful methods to guide the traversal of the graph.
|
default <Acc> Acc |
Graph.simpleCutFold(Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
Fn2<Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc)
Fold a graph into an accumulation, using the implementation's
Graph.decompose() method, and a cutoff
function to end the fold early |
default <Acc> Acc |
Graph.simpleCutFold(Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
Fn2<Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc)
Fold a graph into an accumulation, using the implementation's
Graph.decompose() method, and a cutoff
function to end the fold early |
default <Acc> Acc |
Graph.simpleFold(Fn2<Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc)
Fold a graph into an accumulation, using the implementation's
Graph.decompose() method. |
| Modifier and Type | Method and Description |
|---|---|
Acc |
FoldG.checkedApply(Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
Fn1<S,FoldContinue<N>> contextGetter,
Fn3<S,Acc,Context<A,N,E,I>,S> updateState,
S defState,
Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc,
G graph)
Deprecated.
|
Acc |
FoldG.checkedApply(Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
Fn1<S,FoldContinue<N>> contextGetter,
Fn3<S,Acc,Context<A,N,E,I>,S> updateState,
S defState,
Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc,
G graph)
Deprecated.
|
Acc |
FoldG.checkedApply(Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
Fn1<S,FoldContinue<N>> contextGetter,
Fn3<S,Acc,Context<A,N,E,I>,S> updateState,
S defState,
Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc,
G graph)
Deprecated.
|
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,S,Acc> |
FoldG.foldG(Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
Fn1<S,FoldContinue<N>> contextGetter,
Fn3<S,Acc,Context<A,N,E,I>,S> updateState,
S defState,
Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc,
G graph)
Deprecated.
|
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,S,Acc> |
FoldG.foldG(Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
Fn1<S,FoldContinue<N>> contextGetter,
Fn3<S,Acc,Context<A,N,E,I>,S> updateState,
S defState,
Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc,
G graph)
Deprecated.
|
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,S,Acc> |
FoldG.foldG(Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
Fn1<S,FoldContinue<N>> contextGetter,
Fn3<S,Acc,Context<A,N,E,I>,S> updateState,
S defState,
Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc,
G graph)
Deprecated.
|
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,S,Acc> |
FoldG.guidedCutFold(Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
Fn1<S,FoldContinue<N>> contextGetter,
Fn3<S,Acc,Context<A,N,E,I>,S> updateState,
S defState,
Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc,
G graph)
Deprecated.
|
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,S,Acc> |
FoldG.guidedCutFold(Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
Fn1<S,FoldContinue<N>> contextGetter,
Fn3<S,Acc,Context<A,N,E,I>,S> updateState,
S defState,
Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc,
G graph)
Deprecated.
|
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,S,Acc> |
FoldG.guidedCutFold(Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
Fn1<S,FoldContinue<N>> contextGetter,
Fn3<S,Acc,Context<A,N,E,I>,S> updateState,
S defState,
Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc,
G graph)
Deprecated.
|
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,S,Acc> |
FoldG.guidedFold(Fn1<S,FoldContinue<N>> contextGetter,
Fn3<S,Acc,Context<A,N,E,I>,S> updateState,
S defState,
Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc,
G graph)
Deprecated.
|
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,S,Acc> |
FoldG.guidedFold(Fn1<S,FoldContinue<N>> contextGetter,
Fn3<S,Acc,Context<A,N,E,I>,S> updateState,
S defState,
Fn3<S,Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc,
G graph)
Deprecated.
|
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,Acc> |
FoldG.simpleCutFold(Fn2<Acc,Context<A,N,E,I>,Acc> accumulator,
Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
Acc defAcc,
G graph)
Deprecated.
|
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,Acc> |
FoldG.simpleCutFold(Fn2<Acc,Context<A,N,E,I>,Acc> accumulator,
Fn1<Context<A,N,E,I>,Boolean> destinationCheck,
Acc defAcc,
G graph)
Deprecated.
|
static <A,N extends Node<A>,E extends Edge<A,N,E>,I extends Iterable<E>,G extends Graph<A,N,E,I,G>,Acc> |
FoldG.simpleFold(Fn2<Acc,Context<A,N,E,I>,Acc> accumulator,
Acc defAcc,
G graph)
Deprecated.
|
| Modifier and Type | Class and Description |
|---|---|
class |
ValueContext<A,L,W>
A
Context which is a value object, isomorphic to a tuple containing its node, a set of edges into the
node, and a set of edges coming out of the node |
| Modifier and Type | Method and Description |
|---|---|
Choice2<AdjListGraph<A,L,W>,Tuple2<Context<A,ValueNode<A,L>,ValueEdge<A,L,W>,HashSet<ValueEdge<A,L,W>>>,AdjListGraph<A,L,W>>> |
AdjListGraph.atNode(ValueNode<A,L> node)
|
Maybe<Tuple2<Context<A,ValueNode<A,L>,ValueEdge<A,L,W>,HashSet<ValueEdge<A,L,W>>>,AdjListGraph<A,L,W>>> |
AdjListGraph.decompose()
Implementation-dependent and possibly non-deterministic decomposition of a graph into a
Context
and the rest of the graph |
Copyright © 2020. All Rights Reserved.