Uses of Class
eu.bandm.tools.ramus.runtime2.Action

Packages that use Action

Package	Description
eu.bandm.tools.ramus.runtime2

Uses of Action in eu.bandm.tools.ramus.runtime2

Subclasses of Action in eu.bandm.tools.ramus.runtime2

Modifier and Type	Class	Description
class	Blockage<R,M,O>
final class	Choice<R,M,O>	Choice node class of the parsing search-tree monad.
class	Diagnosis<R,M,O>
final class	Success<R,M,O>	Leaf node class of the parsing search-tree monad.
(package private) class	Thunk<R,S,M,O>

Fields in eu.bandm.tools.ramus.runtime2 declared as Action

Modifier and Type	Field	Description
(package private) Action<R,M,O>	Action.Trampoline.action

Methods in eu.bandm.tools.ramus.runtime2 that return Action

Modifier and Type	Method	Description
(package private) static <D, T> Action<Parser.Output<D,T>,SimpleMessage<D>,Parser.Input<D,T>>	Parser.append(Action<Parser.Output<D,T>,SimpleMessage<D>,Parser.Input<D,T>> first, Update<SimpleMessage<D>> last)
default Action<T,M,O>	Action.BiContinuation.apply(R arg1, S arg2)
Action<T,M,O>	Action.BiContinuation.apply(R arg1, S arg2, Success<?,M,O> recyclable)	Applies this continuation, possibly using a recyclable leaf node.
default Action<S,M,O>	Action.Continuation.apply(R arg)	Applies this continuation, ignoring any recyclable leaf node.
Action<S,M,O>	Action.Continuation.apply(R arg, Success<?,M,O> recyclable)	Applies this continuation, possibly using a recyclable leaf node.
abstract Action<Parser.Output<D,T>,SimpleMessage<D>,Parser.Input<D,T>>	Parser.apply(Parser.Input<D,T> in, Success<?,SimpleMessage<D>,Parser.Input<D,T>> recyclable)	Applies this continuation, possibly using a recyclable leaf node.
Action<Parser.Output<D,T>,SimpleMessage<D>,Parser.Input<D,T>>	Parser.Proxy.apply(Parser.Input<D,T> in, Success<?,SimpleMessage<D>,Parser.Input<D,T>> recyclable)
abstract <S> Action<S,M,O>	Action.bind(Action.Continuation<? super R,S,M,O> cont)	Applies a monadic continuation to all leaves of this search tree (transition operation).
<S> Action<S,M,O>	Blockage.bind(Action.Continuation<? super R,S,M,O> cont)
<S> Action<S,M,O>	Choice.bind(Action.Continuation<? super R,S,M,O> cont)
<S> Action<S,M,O>	Diagnosis.bind(Action.Continuation<? super R,S,M,O> cont)
<S> Action<S,M,O>	Success.bind(Action.Continuation<? super R,S,M,O> cont)	Applies a monadic continuation to all leaves of this search tree (transition operation).
<T> Action<T,M,O>	Thunk.bind(Action.Continuation<? super S,T,M,O> cont)
static <R, M, O> Action<R,M,O>	Action.choice(Action<R,M,O>... alts)	Creates a search tree from a choice of alternative subtrees
static <D, T> Action<Parser.Output<D,T>,SimpleMessage<D>,Parser.Input<D,T>>	Parser.diagnoseUnexpectedToken(Action<Parser.Output<D,T>,SimpleMessage<D>,Parser.Input<D,T>> body, Location<D> location, @Opt String description)
static <R, M, O> Action<R,M,O>	Action.diagnosis(Action<R,M,O> body, List<? extends M> msgs)	Creates a search tree with diagnostic message attached to the root.
static <R, M, O> Action<R,M,O>	Action.diagnosis(Action<R,M,O> body, M... msgs)	Creates a search tree with diagnostic message attached to the root.
<R> Action<State,SimpleMessage<D>,State>	Reducer.Context.eval(Reducer.BoundConstructor<D,R> cons, Success<?,SimpleMessage<D>,State> recyclable)
static <R, M, O> Action<R,M,O>	Action.fail()	Creates a search tree with no alternatives.
static <R, M, O> Action<R,M,O>	Action.fail(O obstruction)	Creates a search tree with no alternatives but an obstruction.
(package private) Action<S,M,O>	Thunk.force()
Action<? extends R,M,O>	Diagnosis.getBody()
final <S> Action<S,M,O>	Action.map(Function<? super R,? extends S> fun)	Applies a function to all leaves of this search tree (transition operation).
static <R, M, O> Action<R,M,O>	Action.optional(Optional<? extends R> opt)
static <R, S, M, O> Action<R,M,O>	Action.optional(Optional<S> opt, Function<? super S,? extends R> convert)
Action<State,SimpleMessage<D>,State>	Parser.process(Parser.Input<D,T> in, Action.Visitor<Parser.Output<D,T>,SimpleMessage<D>,Parser.Input<D,T>> errorVisitor)
abstract <Q> Action<? extends R,M,Q>	Action.prune()	Simplifies this search tree by removing redundant choice nodes and all obstructions (transition operation).
<Q> Action<R,M,Q>	Blockage.prune()
<Q> Action<? extends R,M,Q>	Choice.prune()
<Q> Action<? extends R,M,Q>	Diagnosis.prune()
<Q> Action<R,M,Q>	Success.prune()
<Q> Action<? extends S,M,Q>	Thunk.prune()
(package private) <S> Action<S,M,O>	Blockage.recycle()
(package private) <S> Action<S,M,O>	Success.recycle(S arg)
static <R, M, O> Action<R,M,O>	Action.succeed(R result)	Creates a search tree with a single leaf.
static <R, M, O> Action<R,M,O>	Action.succeed(R result, Success<?,M,O> recyclable)	Creates a search tree with a single leaf, possibly using a recyclable leaf node.
(package private) static Action<Parser.Output<Void,Parser.Test.TokenType>,SimpleMessage<Void>,Parser.Input<Void,Parser.Test.TokenType>>	Parser.Test.test(Parser<Void,Parser.Test.TokenType> parser, Parser.Test.TokenType... input)

Methods in eu.bandm.tools.ramus.runtime2 that return types with arguments of type Action

Modifier and Type	Method	Description
List<Action<? extends R,M,O>>	Choice.getAlts()

Methods in eu.bandm.tools.ramus.runtime2 with parameters of type Action

Modifier and Type	Method	Description
(package private) static <D, T> Action<Parser.Output<D,T>,SimpleMessage<D>,Parser.Input<D,T>>	Parser.append(Action<Parser.Output<D,T>,SimpleMessage<D>,Parser.Input<D,T>> first, Update<SimpleMessage<D>> last)
static <R, M, O> Action<R,M,O>	Action.choice(Action<R,M,O>... alts)	Creates a search tree from a choice of alternative subtrees
static <D, T> Action<Parser.Output<D,T>,SimpleMessage<D>,Parser.Input<D,T>>	Parser.diagnoseUnexpectedToken(Action<Parser.Output<D,T>,SimpleMessage<D>,Parser.Input<D,T>> body, Location<D> location, @Opt String description)
static <R, M, O> Action<R,M,O>	Action.diagnosis(Action<R,M,O> body, List<? extends M> msgs)	Creates a search tree with diagnostic message attached to the root.
static <R, M, O> Action<R,M,O>	Action.diagnosis(Action<R,M,O> body, M... msgs)	Creates a search tree with diagnostic message attached to the root.
static <R, M, O> Choice<R,M,O>	Choice.either(Action<R,M,O> first, Action<R,M,O> second)

Method parameters in eu.bandm.tools.ramus.runtime2 with type arguments of type Action

Modifier and Type	Method	Description
static <R, S, T, M, O> Action.BiContinuation<R,S,T,M,O>	Action.BiContinuation.forget(BiFunction<? super R,? super S,? extends Action<T,M,O>> fun)	Lifts a monadic function on parsing results to a continuation.
static <R, S, M, O> Action.Continuation<R,S,M,O>	Action.Continuation.forget(Function<? super R,? extends Action<S,M,O>> fun)	Lifts a monadic function on parsing results to a continuation.
(package private) static <D, T> Parser<D,T>	Parser.lift(Function<? super Parser.Input<D,T>,? extends Action<Parser.Output<D,T>,SimpleMessage<D>,Parser.Input<D,T>>> fun)
protected <Q> boolean	Action.pruneTo(List<? super Action<? extends R,M,Q>> alts)	Adds a pruned variant of this search subtree to a list of choice alternatives.
protected <Q> boolean	Choice.pruneTo(List<? super Action<? extends R,M,Q>> alts)

Constructors in eu.bandm.tools.ramus.runtime2 with parameters of type Action

Modifier	Constructor	Description
(package private)	Choice(Action<? extends R,M,O>... alts)
	Diagnosis(Action<? extends R,M,O> body, List<? extends M> msgs)
	Diagnosis(Action<? extends R,M,O> body, M... msgs)
(package private)	Thunk(Action<R,M,O> action, Action.Continuation<R,S,M,O> continuation)

Constructor parameters in eu.bandm.tools.ramus.runtime2 with type arguments of type Action

Modifier	Constructor	Description
(package private)	Choice(List<? extends Action<? extends R,M,O>> alts)