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
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
use petgraph::prelude::*;
use serde_derive::{Deserialize, Serialize};
use std::collections::{hash_map::Entry, HashMap};
use std::{fmt, io};
use super::error::{Error, Result};
use super::operator::{Binary, Unary};
use cauchy::Scalar;
#[macro_export]
macro_rules! graph {
($scalar:ty, $proc:block) => {{
enum DummyGraphNew {}
impl DummyGraphNew {
$crate::parser::graph_impl!($scalar, $proc);
}
DummyGraphNew::graph_new()
}};
}
#[derive(Clone, Serialize, Deserialize)]
pub struct Node<A> {
value: Option<A>,
deriv: Option<A>,
property: Property,
}
impl<A: fmt::Debug> fmt::Debug for Node<A> {
fn fmt(&self, f: &mut fmt::Formatter) -> fmt::Result {
match self.property {
Property::Constant | Property::Variable => {}
Property::Unary(unary) => write!(f, "Unary: {:?}\n", unary)?,
Property::Binary(bin) => write!(f, "Binary: {:?}\n", bin)?,
}
if let Some(val) = &self.value {
write!(f, "value={:?}", val)?
} else {
write!(f, "value=N/A")?
}
write!(f, ", ")?;
if let Some(deriv) = &self.deriv {
write!(f, "deriv={:?}", deriv)?;
} else {
write!(f, "deriv=N/A")?;
}
Ok(())
}
}
#[derive(Debug, Copy, Clone, Serialize, Deserialize)]
enum Property {
Constant,
Variable,
Unary(Unary),
Binary(Binary),
}
impl<A> Node<A> {
pub fn is_variable(&self) -> bool {
match self.property {
Property::Constant => false,
Property::Variable => true,
Property::Unary(_) => false,
Property::Binary(_) => false,
}
}
fn variable() -> Self {
Self {
value: None,
deriv: None,
property: Property::Variable,
}
}
fn constant(a: A) -> Self {
Self {
value: Some(a),
deriv: None,
property: Property::Constant,
}
}
}
impl<A> From<Unary> for Node<A> {
fn from(op: Unary) -> Self {
Self {
value: None,
deriv: None,
property: Property::Unary(op),
}
}
}
impl<A> From<Binary> for Node<A> {
fn from(op: Binary) -> Self {
Self {
value: None,
deriv: None,
property: Property::Binary(op),
}
}
}
#[derive(Debug, Clone, Serialize, Deserialize)]
pub struct Graph<A> {
graph: petgraph::graph::Graph<Node<A>, ()>,
namespace: HashMap<String, NodeIndex>,
}
impl<A> Graph<A> {
pub fn get_index(&self, name: &str) -> NodeIndex {
self.namespace[name]
}
}
impl<A> ::std::ops::Index<NodeIndex> for Graph<A> {
type Output = Node<A>;
fn index(&self, index: NodeIndex) -> &Node<A> {
&self.graph[index]
}
}
impl<A> ::std::ops::IndexMut<NodeIndex> for Graph<A> {
fn index_mut(&mut self, index: NodeIndex) -> &mut Node<A> {
&mut self.graph[index]
}
}
impl<A> ::std::ops::Index<&str> for Graph<A> {
type Output = Node<A>;
fn index(&self, name: &str) -> &Node<A> {
let index = self.namespace[name];
&self.graph[index]
}
}
impl<A> ::std::ops::IndexMut<&str> for Graph<A> {
fn index_mut(&mut self, name: &str) -> &mut Node<A> {
let index = self.namespace[name];
&mut self.graph[index]
}
}
macro_rules! def_unary { ($name:ident, $enum:ident) => {
pub fn $name(&mut self, arg: NodeIndex) -> NodeIndex {
let n = self.graph.add_node(Unary::$enum.into());
self.graph.add_edge(arg, n, ());
n
}
}} macro_rules! def_binary { ($name:ident, $enum:ident) => {
pub fn $name(&mut self, lhs: NodeIndex, rhs: NodeIndex) -> NodeIndex {
let p = self.graph.add_node(Binary::$enum.into());
self.graph.add_edge(lhs, p, ());
self.graph.add_edge(rhs, p, ());
p
}
}} impl<A: Scalar> Graph<A> {
def_binary!(add, Add);
def_binary!(mul, Mul);
def_binary!(div, Div);
def_binary!(pow, Pow);
def_unary!(neg, Neg);
def_unary!(square, Square);
def_unary!(exp, Exp);
def_unary!(ln, Ln);
def_unary!(sin, Sin);
def_unary!(cos, Cos);
def_unary!(tan, Tan);
def_unary!(sinh, Sinh);
def_unary!(cosh, Cosh);
def_unary!(tanh, Tanh);
pub fn sub(&mut self, lhs: NodeIndex, rhs: NodeIndex) -> NodeIndex {
let m_rhs = self.neg(rhs);
self.add(lhs, m_rhs)
}
pub fn new() -> Self {
Self {
graph: petgraph::graph::Graph::new(),
namespace: HashMap::new(),
}
}
pub fn constant(&mut self, value: A) -> NodeIndex {
self.graph.add_node(Node::constant(value))
}
pub fn empty_variable(&mut self, name: &str) -> Result<NodeIndex> {
match self.namespace.entry(name.into()) {
Entry::Occupied(_) => Err(Error::DuplicatedName { name: name.into() }),
Entry::Vacant(entry) => {
let id = self.graph.add_node(Node::variable());
entry.insert(id);
Ok(id)
}
}
}
pub fn variable(&mut self, name: &str, value: A) -> Result<NodeIndex> {
let var = self.empty_variable(name)?;
self.set_value(var, value).unwrap();
Ok(var)
}
pub fn set_name(&mut self, node: NodeIndex, name: &str) -> Option<NodeIndex> {
self.namespace.insert(name.to_string(), node)
}
pub fn set_value(&mut self, node: NodeIndex, value: A) -> Result<()> {
if self.graph[node].is_variable() {
self.graph[node].value = Some(value.into());
Ok(())
} else {
Err(Error::NodeTypeError {
index: node.index(),
})
}
}
fn get_arg1(&mut self, op: NodeIndex) -> NodeIndex {
let mut iter = self.graph.neighbors_directed(op, Direction::Incoming);
iter.next().unwrap()
}
fn get_arg2(&mut self, op: NodeIndex) -> (NodeIndex, NodeIndex) {
let mut iter = self.graph.neighbors_directed(op, Direction::Incoming);
let rhs = iter.next().unwrap();
let lhs = iter.next().unwrap();
(lhs, rhs)
}
pub fn eval_value(&mut self, node: NodeIndex) -> Result<A> {
let prop = self[node].property;
match prop {
Property::Variable => self.get_value(node),
Property::Constant => Ok(self
.get_value(node)
.expect("Constant node is not initialized")),
Property::Unary(ref op) => Ok(self.get_value(node).unwrap_or({
let arg = self.get_arg1(node);
let val1 = self.eval_value(arg)?;
let value = op.eval_value(val1);
self[node].value = Some(value); value
})),
Property::Binary(ref op) => Ok(self.get_value(node).unwrap_or({
let (lhs, rhs) = self.get_arg2(node);
let lv = self.eval_value(lhs)?;
let rv = self.eval_value(rhs)?;
let value = op.eval_value(lv, rv);
self[node].value = Some(value); value
})),
}
}
pub fn get_value(&self, node: NodeIndex) -> Result<A> {
self[node].value.ok_or(Error::ValueUninitialized {
index: node.index(),
})
}
pub fn get_deriv(&self, node: NodeIndex) -> Result<A> {
self[node].deriv.ok_or(Error::DerivUninitialized {
index: node.index(),
})
}
fn deriv_recur(&mut self, node: NodeIndex, der: A) -> Result<()> {
self[node].deriv = match self[node].deriv {
Some(der_last) => Some(der_last + der),
None => Some(der),
};
let property = self[node].property;
match property {
Property::Variable | Property::Constant => {}
Property::Unary(ref op) => {
let arg = self.get_arg1(node);
let der = op.eval_deriv(self.get_value(arg)?, der);
self.deriv_recur(arg, der)?;
}
Property::Binary(ref op) => {
let (lhs, rhs) = self.get_arg2(node);
let (l_der, r_der) = op.eval_deriv(self.get_value(lhs)?, self.get_value(rhs)?, der);
self.deriv_recur(lhs, l_der)?;
self.deriv_recur(rhs, r_der)?;
}
};
Ok(())
}
pub fn eval_deriv(&mut self, node: NodeIndex) -> Result<()> {
for idx in self.graph.node_indices() {
self[idx].deriv = None;
}
self.deriv_recur(node, A::one())
}
pub fn to_json(&self, writer: impl io::Write) -> Result<()> {
serde_json::to_writer(writer, self).map_err(|error| Error::JSONSerializeFailed { error })
}
pub fn to_json_str(&self) -> Result<String> {
serde_json::to_string(self).map_err(|error| Error::JSONSerializeFailed { error })
}
pub fn to_dot(&self, sink: &mut impl io::Write) -> io::Result<()>
where
A: fmt::Debug,
{
use petgraph::dot;
let dot = dot::Dot::with_config(&self.graph, &[dot::Config::EdgeNoLabel]);
write!(sink, "{:?}", dot)?;
Ok(())
}
}