stately.graph.node — stately 0.1.2-SNAPSHOT

accept-node clj

AcceptNode clj

action-node clj

(action-node next-node)

(action-node successors next-node)

(action-node successors interrupt-node next-node)

Action Node State Machine will immediately execute handle-state fn and move to next node, unless input interrupts. Interrupt node can be self referencing as well (pipe node back to this node)

bootstrap-node clj

(bootstrap-node node-name)

Bootstraps the State Machine.

decision-node clj

(decision-node successors decision-fn)

Decision node. decision-fn definition MUST handle [data] AND [data event] arg vectors decision nodes are the 'routers' of our state machines.

expiring-node clj

(expiring-node successors interrupt-node expire-fn expire-in-fn)

Expiring Node Will wait for the time designated by expire-in-fn and execute timeout-fn. any input into the machine before expire will go to the interrupt-node

IEventNode clj protocol

Protocol for nodes that will receive events

send-input clj

(send-input this data)

(send-input this data event)

Deliver input

INode clj protocol

Basic protocols necessary to constitute a node

accept? clj

(accept? this)

is this an accept state? (terminal?)

reject? clj

(reject? this)

is this a reject stat? (terminal...?)

successors clj

(successors this)

Return set of successor names

ITimeoutNode clj protocol

protocols for nodes that will expire, that is are bound by time

expire-in clj

(expire-in this data)

Return a wait time (in milliseconds) based on data

send-timeout clj

(send-timeout this data)

Deliver timeout

Node clj

reject-node clj

RejectNode clj

StartNode clj

terminal-node? clj

(terminal-node? node)

wait-node clj

(wait-node successors decision-fn expire-node)

(wait-node successors decision-fn expire-node expire-in-fn)

Wait node. Sometimes we just need to wait indefinitely for some kind of input. This node will do exactly that. It waits for either a time given by a fn passed in or indefinitely for input, should you so desire