/
action.rb
210 lines (179 loc) · 4.18 KB
/
action.rb
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
# T
class Action
attr_reader :applicable
# a -> T a
def initialize(action)
@applicable = action
end
# a -> T a
def container
lambda do |action|
Action.new action
end
end
def self.empty
raise NotImplementedError
end
# <T a> -> (a -> T b) -> T b
# take the action of current action,
# and derive a new action from it
def derive(&a_to_tb)
a_to_tb.call(@applicable)
end
# (a -> b) -> <T a> -> T b
# get the action's action (pure)
def get(&a_to_b)
Action.new a_to_b.call(@applicable)
end
# <T a> -> <T b>
# change the action's action (impure)
def update!(&a_to_b)
@applicable = a_to_b.call(@applicable)
self
end
# <T T a> -> T a
# if the action's action is itself a action
# this will unpack the innter action and use its action (impure)
def unpack!
@applicable = @applicable.container
end
#if the action's action is itself a action
#this will unpack the inner action and use its action (pure)
def unpack
Action.new @applicable.container
end
end
class WriteAction < Action
# i -> T i
def initialize(action)
super
end
def self.from_writable(writable)
WriteAction.new(lambda {|str| writable.write(str) })
end
def self.empty
WriteAction.new(lambda {|str| puts str })
end
# (a -> b) -> Action a
def write(&str_provider)
super.update! do |writer|
writer.call(str_provider.call)
end
self
end
end
class ActionList < Action
def initialize(actions, dependencies = nil)
@applicable = actions.map { |m|
if m.is_a? Symbol
method(m)
else
m
end
}
@applicable = @applicable.zip(dependencies) unless dependencies.nil?
@dependent = !dependencies.nil?
end
def dependent?
@dependent
end
def complex(state, couple, &combination)
couple.applicable.zip(@applicable).inject(state, &combination)
end
def simplex(state, &combination)
@applicable.inject(state, &combination)
end
def coapply(couple, &combination)
couple.applicable.zip(@applicable).map(&combination)
end
def apply(&combination)
@applicable.map(&combination)
end
end
class Complect < ActionList
def run(input)
if dependent?
simplex(input) { |state, action|
action, dep = action
action.call *dep, state
}
else
simplex(input) { |state, action|
action.call state
}
end
end
def run_with(input, &strand)
if dependent?
simplex(input) { |state, action|
action, dep = action
action.call *d, (strand.call state, action, dep)
}
else
simplex(input) { |state, action|
action.call (strand.call state, action)
}
end
end
def weave(input, couple)
complex(input, couple) { |state, actions|
actions.each { |fn, dep| state = dep ? (fn.call state, *dep) : (fn.call state) }
state
}
end
def weave_with(input, couple, &strand)
complex(input, couple) { |state, actions|
actions.each { |fn, dep|
state = strand.call(state, fn, dep)
state = dep ? (fn.call state, *dep) : (fn.call state)
}
state
}
end
end
class Couple < ActionList
def self.weave(list_one, list_two)
(Couple.new list_one).weave(Couple.new list_two)
end
def self.repeating(action, deps)
Couple.new Array.new(deps.length, action), deps
end
def run
if dependent?
apply() { |action|
action, dep = action
action.call *dep
}
else
apply() { |action|
action.call
}
end
end
def run_with(&strand)
if dependent?
apply { |action|
action, dep = action
action.call *d, (strand.call action, dep)
}
else
apply { |action|
action.call (strand.call state, action)
}
end
end
def weave(couple)
coapply(couple) { |actions|
(fn, fdep), (gn, gdep) = actions
gn = gdep ? (gn.call *gdep) : gn.call
fdep ? (fn.call gn, *fdep) : (fn.call gn)
}
end
def weave_with(couple, &strand)
coapply(couple) { |actions|
(fn, fdep), (gn, gdep) = strand.call *actions
gn = gdep ? (gn.call *dep) : (gn.call)
fdep ? (fn.call gn, *dep) : (fn.call gn)
}
end
end