mech-syntax 0.3.5

A toolchain for compiling textual syntax into Mech blocks.
Documentation 
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

#![allow(warnings)]
#![feature(iter_intersperse)]

#![feature(test)]
#![feature(get_mut_unchecked)]

extern crate test;

use test::Bencher;

use std::sync::Arc;
use std::cell::RefCell;
use std::fmt;
use std::ptr;
use std::rc::Rc;
use hashbrown::{HashMap, HashSet};

use std::collections::VecDeque;
use std::thread;

use std::fmt::*;
use std::ops::*;

use mech_core::*;
use mech_syntax::parser;
//use mech_syntax::analyzer::*;
use mech_core::interpreter::*;
use mech_syntax::parser::{parse};
use nalgebra::{Vector3, DVector, RowDVector, Matrix1, Matrix3, Matrix4, RowVector3, RowVector4, RowVector2, DMatrix, Rotation3, Matrix2x3, Matrix6, Matrix2};

#[bench]
fn set_column(b:&mut Bencher){
  let s = r#"a := [1 2; 3 4]
a[:,1] = 4"#;
  match parser::parse(&s) {
    Ok(tree) => { 
      let mut intrp = Interpreter::new();
      let result = intrp.interpret(&tree);
      let fxn = &intrp.plan.borrow()[0];
      b.iter(|| {
        let result = fxn.solve();
      });
    }
    _ => (),
  }
}

#[bench]
fn matrix_multiply(b:&mut Bencher){
  let s = r#"a := [1 2; 3 4]
b := [4 5; 6 7]
c := a ** b"#;
  match parser::parse(&s) {
    Ok(tree) => { 
      let mut intrp = Interpreter::new();
      let result = intrp.interpret(&tree);
      let fxn = &intrp.plan.borrow()[0];
      b.iter(|| {
        let result = fxn.solve();
      });
    }
    _ => (),
  }
}

#[bench]
fn add_scalar(b:&mut Bencher){
  let s = r#"1 + 1"#;
  match parser::parse(&s) {
    Ok(tree) => { 
      let mut intrp = Interpreter::new();
      let result = intrp.interpret(&tree);
      let fxn = &intrp.plan.borrow()[0];
      b.iter(|| {
        fxn.solve();
      });
    }
    _ => (),
  }
}

#[bench]
fn matrix_add_row(b:&mut Bencher){
  let s = r#"a := [1 2 3]
b := [4 5 6]
c := a + b"#;
  match parser::parse(&s) {
    Ok(tree) => { 
      let mut intrp = Interpreter::new();
      let result = intrp.interpret(&tree);
      let fxn = &intrp.plan.borrow()[0];
      b.iter(|| {
        fxn.solve();
      });
    }
    _ => (),
  }
}

#[bench]
fn matrix_add_baseline_nalgebra(b:&mut Bencher){
  b.iter(|| {
    let a: RowVector3<i64> = RowVector3::from_vec(vec![1,2,3]);
    let b: RowVector3<i64> = RowVector3::from_vec(vec![4,5,6]);
    let c = a + b;
  });
}

#[bench]
fn matrix_add_baseline_rust(b:&mut Bencher){
  b.iter(|| {
    let a: [i64;3] = [1, 2, 3];
    let b: [i64;3] = [4, 5, 6];
    let mut c = [0, 0, 0];
    for i in 0..3 {
      c[i] = a[i] + b[i];
    }
  });
}

#[bench]
fn add_baseline_rust(b:&mut Bencher){
  b.iter(|| {
    1 + 1
  });
}

#[bench]
fn matrix_row_add_baseline_heap(b:&mut Bencher){
  b.iter(|| {
    let a: Vec<i64> = vec![1, 2, 3];
    let b: Vec<i64> = vec![4, 5, 6];
    let mut c = vec![0, 0, 0];
    for i in 0..3 {
      c[i] = a[i] + b[i];
    }
  });
}