-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.js
139 lines (131 loc) · 3.38 KB
/
index.js
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
class Node {
constructor(item) {
this.item = item;
}
setNext(node) {
this.next = node;
node.prev = this;
}
unlink() {
if (this.next) this.next.prev = this.prev;
this.prev.next = this.next;
}
}
class List {
constructor(array) {
if (!array.length) return;
const [first, ...rest] = array;
this.current = new Node(first);
this.first = this.current;
this.last = this.current;
let curr = this.current;
for (const item of rest) {
const node = new Node(item);
curr.setNext(node);
curr = node;
}
this.last = curr;
}
next() {
this.current = this.current.next;
}
prev() {
this.current = this.current.prev;
}
unlinkNext() {
this.current.next.unlink();
}
push(item) {
const node = new Node(item);
if (!this.current) {
this.current = node;
this.last = this.current;
this.first = this.current;
return;
}
this.last.setNext(node);
this.last = node;
}
}
const beanPriority = (tokens, rules, context) => {
while (true) {
const { current } = tokens;
const { next } = current;
if (!next) break;
const { next: last } = next;
const rule = rules[current.item.type]?.[next.item.type];
if (rule) {
if (last) {
const nextRule = rules[next.item.type]?.[last.item.type];
if (nextRule && nextRule.priority > rule.priority) {
tokens.next();
continue;
}
}
current.item = rule.value(current.item, next.item, context);
tokens.unlinkNext();
tokens.current = current.prev || current;
continue;
}
tokens.current = next;
}
return tokens;
};
const beanNoPriority = (tokens, rules, context) => {
while (true) {
const { current } = tokens;
const { next } = current;
if (!next) break;
const rule = rules[current.item.type]?.[next.item.type];
if (rule) {
current.item = rule.value(current.item, next.item, context);
tokens.unlinkNext();
tokens.current = current.prev || current;
continue;
}
tokens.current = next;
}
return tokens;
};
const bean = (tokens, rules, priorities = true, context = {}) => {
return priorities
? beanPriority(tokens, rules, context)
: beanNoPriority(tokens, rules, context);
};
const rule = (value, priority = 1) => ({ value, priority });
const map = (keys, rule) => Object.fromEntries(keys.map((key) => [key, rule]));
const mapfn = (keys, fn) => Object.fromEntries(keys.map(fn));
const pod = (type) =>
rule((lhs, rhs) => ({
type,
lhs,
rhs,
}));
const list = (arr) => new List(arr);
const lPluck = (z) => z;
const rPluck = (_, z) => z;
const ignore = (...types) => map(types, rule(lPluck));
const name = (type, priority = 1) =>
rule((lhs, rhs) => ({ lhs, rhs, type }), priority);
const merge = (...objects) => {
const result = {};
for (const object of objects) {
for (const [key, value] of Object.entries(object)) {
if (result[key]) result[key] = { ...result[key], ...value };
else result[key] = value;
}
}
return result;
};
module.exports.rule = rule;
module.exports.map = map;
module.exports.mapfn = mapfn;
module.exports.pod = pod;
module.exports.bean = bean;
module.exports.List = List;
module.exports.list = list;
module.exports.lPluck = lPluck;
module.exports.rPluck = rPluck;
module.exports.ignore = ignore;
module.exports.name = name;
module.exports.merge = merge;