org.jivesoftware.smack.c2s.internal

Class WalkStateGraphContext

java.lang.Object

org.jivesoftware.smack.c2s.internal.WalkStateGraphContext

public final class WalkStateGraphContext
extends java.lang.Object

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	WalkStateGraphContext.Builder

Method Summary

Modifier and Type	Method and Description
void	appendWalkTo(java.util.List<State> walk)
static WalkStateGraphContext.Builder	builder(java.lang.Class<? extends StateDescriptor> initialStateClass, java.lang.Class<? extends StateDescriptor> finalStateClass)
java.util.Map<State,StateTransitionResult>	getFailedStates()
LoginContext	getLoginContext()
java.util.List<State>	getWalk()
int	getWalkLength()
boolean	isFinalStateAuthenticatedAndResourceBound()
boolean	isWalksFinalState(StateDescriptor stateDescriptor)
StateDescriptorGraph.GraphVertex<State>	maybeReturnMandatoryImmediateState(java.util.List<StateDescriptorGraph.GraphVertex<State>> outgoingStateEdges)
void	recordFailedState(State state, StateTransitionResult stateTransitionResult)
void	recordWalkTo(State state)
boolean	stateAlreadyVisited(State state)
boolean	wouldCauseCycle(StateDescriptorGraph.GraphVertex<State> successorStateVertex) Check if the way to the final state via the given successor state that would loop, i.e., lead over the initial state and thus from a cycle.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

recordWalkTo

public void recordWalkTo(State state)

isWalksFinalState

public boolean isWalksFinalState(StateDescriptor stateDescriptor)

isFinalStateAuthenticatedAndResourceBound

public boolean isFinalStateAuthenticatedAndResourceBound()

maybeReturnMandatoryImmediateState

public StateDescriptorGraph.GraphVertex<State> maybeReturnMandatoryImmediateState(java.util.List<StateDescriptorGraph.GraphVertex<State>> outgoingStateEdges)

getWalk

public java.util.List<State> getWalk()

getWalkLength

public int getWalkLength()

appendWalkTo

public void appendWalkTo(java.util.List<State> walk)

getLoginContext

public LoginContext getLoginContext()

stateAlreadyVisited

public boolean stateAlreadyVisited(State state)

recordFailedState

public void recordFailedState(State state,
                              StateTransitionResult stateTransitionResult)

getFailedStates

public java.util.Map<State,StateTransitionResult> getFailedStates()

wouldCauseCycle

public boolean wouldCauseCycle(StateDescriptorGraph.GraphVertex<State> successorStateVertex)

Check if the way to the final state via the given successor state that would loop, i.e., lead over the initial state and thus from a cycle.

Parameters:

successorStateVertex - the successor state to use on the way.

Returns:

true if it would loop, false otherwise.

builder

public static WalkStateGraphContext.Builder builder(java.lang.Class<? extends StateDescriptor> initialStateClass,
                                                    java.lang.Class<? extends StateDescriptor> finalStateClass)