Browse Source

Prettier

master
Dylan Baker 5 years ago
parent
commit
7d8caf316f
2 changed files with 27 additions and 17 deletions
  1. 7
    5
      src/core.js
  2. 20
    12
      test/coreTest.js

+ 7
- 5
src/core.js View File

@@ -11,9 +11,11 @@ module.exports = {
11 11
   '<': (a, b) => new AST.Boolean({ value: a.value < b.value }),
12 12
   '>=': (a, b) => new AST.Boolean({ value: a.value >= b.value }),
13 13
   '<=': (a, b) => new AST.Boolean({ value: a.value <= b.value }),
14
-  'list': (...args) => { return new AST.List({ elements: args }) },
15
-  'length': xs => new AST.Number({ value: xs.elements.length }),
16
-  'cons': (x, xs) => new AST.List({ elements: [x, ...xs.elements] }),
17
-  'head': xs => xs.elements[0],
18
-  'tail': xs => new AST.List({ elements: xs.elements.slice(1) }),
14
+  list: (...args) => {
15
+    return new AST.List({ elements: args })
16
+  },
17
+  length: xs => new AST.Number({ value: xs.elements.length }),
18
+  cons: (x, xs) => new AST.List({ elements: [x, ...xs.elements] }),
19
+  head: xs => xs.elements[0],
20
+  tail: xs => new AST.List({ elements: xs.elements.slice(1) }),
19 21
 }

+ 20
- 12
test/coreTest.js View File

@@ -8,13 +8,16 @@ test('list function', t => {
8 8
   t.plan(1)
9 9
 
10 10
   const tree = helpers.evaluate('(list 1 2 3)')
11
-  t.deepEqual(tree[0], new AST.List({
12
-    elements: [
13
-      new AST.Number({ value: 1, line: 1 }),
14
-      new AST.Number({ value: 2, line: 1 }),
15
-      new AST.Number({ value: 3, line: 1 }),
16
-    ]
17
-  }))
11
+  t.deepEqual(
12
+    tree[0],
13
+    new AST.List({
14
+      elements: [
15
+        new AST.Number({ value: 1, line: 1 }),
16
+        new AST.Number({ value: 2, line: 1 }),
17
+        new AST.Number({ value: 3, line: 1 }),
18
+      ],
19
+    }),
20
+  )
18 21
 })
19 22
 
20 23
 test('length function', t => {
@@ -37,9 +40,14 @@ test('map', t => {
37 40
 
38 41
     (my-map (lambda (x) (+ x 1)) (list 1 2 3))
39 42
   `)
40
-  t.deepEqual(tree[0], new AST.List({ elements: [
41
-    new AST.Number({ value: 2 }),
42
-    new AST.Number({ value: 3 }),
43
-    new AST.Number({ value: 4 }),
44
-  ]}))
43
+  t.deepEqual(
44
+    tree[0],
45
+    new AST.List({
46
+      elements: [
47
+        new AST.Number({ value: 2 }),
48
+        new AST.Number({ value: 3 }),
49
+        new AST.Number({ value: 4 }),
50
+      ],
51
+    }),
52
+  )
45 53
 })

Loading…
Cancel
Save