-
Notifications
You must be signed in to change notification settings - Fork 131
/
Copy pathStateMachine.kt
230 lines (185 loc) · 8.69 KB
/
StateMachine.kt
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
package com.tinder
import java.util.concurrent.atomic.AtomicReference
class StateMachine<STATE : Any, EVENT : Any, SIDE_EFFECT : Any> private constructor(
private val graph: Graph<STATE, EVENT, SIDE_EFFECT>
) {
private val stateRef = AtomicReference<STATE>(graph.initialState)
val state: STATE
get() = stateRef.get()
fun transition(event: EVENT): Transition<STATE, EVENT, SIDE_EFFECT> {
val transition = synchronized(this) {
val fromState = stateRef.get()
val transition = fromState.getTransition(event)
if (transition is Transition.Valid) {
stateRef.set(transition.toState)
}
transition
}
transition.notifyOnTransition()
if (transition is Transition.Valid) {
with(transition) {
with(fromState) {
notifyOnExit(event)
}
with(toState) {
notifyOnEnter(event)
}
}
}
return transition
}
fun with(init: GraphBuilder<STATE, EVENT, SIDE_EFFECT>.() -> Unit): StateMachine<STATE, EVENT, SIDE_EFFECT> {
return create(graph.copy(initialState = state), init)
}
private fun STATE.getTransition(event: EVENT): Transition<STATE, EVENT, SIDE_EFFECT> {
for ((eventMatcher, createTransitionTo) in getDefinition().transitions) {
if (eventMatcher.matches(event)) {
val (toState, sideEffect) = createTransitionTo(this, event)
return Transition.Valid(this, event, toState, sideEffect)
}
}
return Transition.Invalid(this, event)
}
private fun STATE.getDefinition() = graph.stateDefinitions
.filter { it.key.matches(this) }
.map { it.value }
.firstOrNull() ?: error("Missing definition for state ${this.javaClass.simpleName}!")
private fun STATE.notifyOnEnter(cause: EVENT) {
getDefinition().onEnterListeners.forEach { it(this, cause) }
}
private fun STATE.notifyOnExit(cause: EVENT) {
getDefinition().onExitListeners.forEach { it(this, cause) }
}
private fun Transition<STATE, EVENT, SIDE_EFFECT>.notifyOnTransition() {
graph.onTransitionListeners.forEach { it(this) }
}
@Suppress("UNUSED")
sealed class Transition<out STATE : Any, out EVENT : Any, out SIDE_EFFECT : Any> {
abstract val fromState: STATE
abstract val event: EVENT
data class Valid<out STATE : Any, out EVENT : Any, out SIDE_EFFECT : Any> internal constructor(
override val fromState: STATE,
override val event: EVENT,
val toState: STATE,
val sideEffect: SIDE_EFFECT?
) : Transition<STATE, EVENT, SIDE_EFFECT>()
data class Invalid<out STATE : Any, out EVENT : Any, out SIDE_EFFECT : Any> internal constructor(
override val fromState: STATE,
override val event: EVENT
) : Transition<STATE, EVENT, SIDE_EFFECT>()
}
data class Graph<STATE : Any, EVENT : Any, SIDE_EFFECT : Any>(
val initialState: STATE,
val stateDefinitions: Map<Matcher<STATE, STATE>, State<STATE, EVENT, SIDE_EFFECT>>,
val onTransitionListeners: List<(Transition<STATE, EVENT, SIDE_EFFECT>) -> Unit>
) {
class State<STATE : Any, EVENT : Any, SIDE_EFFECT : Any> internal constructor() {
val onEnterListeners = mutableListOf<(STATE, EVENT) -> Unit>()
val onExitListeners = mutableListOf<(STATE, EVENT) -> Unit>()
val transitions = linkedMapOf<Matcher<EVENT, EVENT>, (STATE, EVENT) -> TransitionTo<STATE, SIDE_EFFECT>>()
data class TransitionTo<out STATE : Any, out SIDE_EFFECT : Any> internal constructor(
val toState: STATE,
val sideEffect: SIDE_EFFECT?
)
}
}
class Matcher<T : Any, out R : T> private constructor(private val clazz: Class<R>) {
private val predicates = mutableListOf<(T) -> Boolean>({ clazz.isInstance(it) })
fun where(predicate: R.() -> Boolean): Matcher<T, R> = apply {
predicates.add {
@Suppress("UNCHECKED_CAST")
(it as R).predicate()
}
}
fun matches(value: T) = predicates.all { it(value) }
companion object {
fun <T : Any, R : T> any(clazz: Class<R>): Matcher<T, R> = Matcher(clazz)
inline fun <T : Any, reified R : T> any(): Matcher<T, R> = any(R::class.java)
inline fun <T : Any, reified R : T> eq(value: R): Matcher<T, R> = any<T, R>().where { this == value }
}
}
class GraphBuilder<STATE : Any, EVENT : Any, SIDE_EFFECT : Any>(
graph: Graph<STATE, EVENT, SIDE_EFFECT>? = null
) {
private var initialState = graph?.initialState
private val stateDefinitions = LinkedHashMap(graph?.stateDefinitions ?: emptyMap())
private val onTransitionListeners = ArrayList(graph?.onTransitionListeners ?: emptyList())
fun initialState(initialState: STATE) {
this.initialState = initialState
}
fun <S : STATE> state(
stateMatcher: Matcher<STATE, S>,
init: StateDefinitionBuilder<S>.() -> Unit
) {
stateDefinitions[stateMatcher] = StateDefinitionBuilder<S>().apply(init).build()
}
inline fun <reified S : STATE> state(noinline init: StateDefinitionBuilder<S>.() -> Unit) {
state(Matcher.any(), init)
}
inline fun <reified S : STATE> state(state: S, noinline init: StateDefinitionBuilder<S>.() -> Unit) {
state(Matcher.eq<STATE, S>(state), init)
}
fun onTransition(listener: (Transition<STATE, EVENT, SIDE_EFFECT>) -> Unit) {
onTransitionListeners.add(listener)
}
fun build(): Graph<STATE, EVENT, SIDE_EFFECT> {
return Graph(requireNotNull(initialState), stateDefinitions.toMap(), onTransitionListeners.toList())
}
inner class StateDefinitionBuilder<S : STATE> {
private val stateDefinition = Graph.State<STATE, EVENT, SIDE_EFFECT>()
inline fun <reified E : EVENT> any(): Matcher<EVENT, E> = Matcher.any()
inline fun <reified R : EVENT> eq(value: R): Matcher<EVENT, R> = Matcher.eq(value)
fun <E : EVENT> on(
eventMatcher: Matcher<EVENT, E>,
createTransitionTo: S.(E) -> Graph.State.TransitionTo<STATE, SIDE_EFFECT>
) {
stateDefinition.transitions[eventMatcher] = { state, event ->
@Suppress("UNCHECKED_CAST")
createTransitionTo((state as S), event as E)
}
}
inline fun <reified E : EVENT> on(
noinline createTransitionTo: S.(E) -> Graph.State.TransitionTo<STATE, SIDE_EFFECT>
) {
return on(any(), createTransitionTo)
}
inline fun <reified E : EVENT> on(
event: E,
noinline createTransitionTo: S.(E) -> Graph.State.TransitionTo<STATE, SIDE_EFFECT>
) {
return on(eq(event), createTransitionTo)
}
fun onEnter(listener: S.(EVENT) -> Unit) = with(stateDefinition) {
onEnterListeners.add { state, cause ->
@Suppress("UNCHECKED_CAST")
listener(state as S, cause)
}
}
fun onExit(listener: S.(EVENT) -> Unit) = with(stateDefinition) {
onExitListeners.add { state, cause ->
@Suppress("UNCHECKED_CAST")
listener(state as S, cause)
}
}
fun build() = stateDefinition
@Suppress("UNUSED") // The unused warning is probably a compiler bug.
fun S.transitionTo(state: STATE, sideEffect: SIDE_EFFECT? = null) =
Graph.State.TransitionTo(state, sideEffect)
@Suppress("UNUSED") // The unused warning is probably a compiler bug.
fun S.dontTransition(sideEffect: SIDE_EFFECT? = null) = transitionTo(this, sideEffect)
}
}
companion object {
fun <STATE : Any, EVENT : Any, SIDE_EFFECT : Any> create(
init: GraphBuilder<STATE, EVENT, SIDE_EFFECT>.() -> Unit
): StateMachine<STATE, EVENT, SIDE_EFFECT> {
return create(null, init)
}
private fun <STATE : Any, EVENT : Any, SIDE_EFFECT : Any> create(
graph: Graph<STATE, EVENT, SIDE_EFFECT>?,
init: GraphBuilder<STATE, EVENT, SIDE_EFFECT>.() -> Unit
): StateMachine<STATE, EVENT, SIDE_EFFECT> {
return StateMachine(GraphBuilder(graph).apply(init).build())
}
}
}