80 |
81 |
82 |
83 |
305 |
306 |
380 |
381 |
387 |
--------------------------------------------------------------------------------
/src/shared/formula.test.js:
--------------------------------------------------------------------------------
1 | import { expect, test, describe } from 'vitest';
2 | import {
3 | parse, infixToTree, types, evaluate, calculate,
4 | } from './formula';
5 |
6 | describe('parse', () => {
7 | test('returns nothing', () => {
8 | expect(parse('')).toEqual([]);
9 | });
10 |
11 | test('returns single digit number', () => {
12 | expect(parse('0')).toEqual([{ type: types.NUMBER, value: 0 }]);
13 | expect(parse('5')).toEqual([{ type: types.NUMBER, value: 5 }]);
14 | expect(parse('9')).toEqual([{ type: types.NUMBER, value: 9 }]);
15 | });
16 |
17 | test('returns two digit number', () => {
18 | expect(parse('10')).toEqual([{ type: types.NUMBER, value: 10 }]);
19 | expect(parse('90')).toEqual([{ type: types.NUMBER, value: 90 }]);
20 | });
21 |
22 | test('returns n-digit number', () => {
23 | expect(parse('100')).toEqual([{ type: types.NUMBER, value: 100 }]);
24 | expect(parse('1050')).toEqual([{ type: types.NUMBER, value: 1050 }]);
25 | });
26 |
27 | test('returns number with decimal places', () => {
28 | expect(parse('1.1')).toEqual([{ type: types.NUMBER, value: 1.1 }]);
29 | expect(parse('.1')).toEqual([{ type: types.NUMBER, value: 0.1 }]);
30 | expect(parse('.0')).toEqual([{ type: types.NUMBER, value: 0 }]);
31 | });
32 |
33 | test('throws with multiple decimal places', () => {
34 | expect(() => parse('1.1.')).toThrowError();
35 | expect(() => parse('.1.')).toThrowError();
36 | expect(() => parse('..1')).toThrowError();
37 | expect(() => parse('..')).toThrowError();
38 | expect(() => parse('.')).toThrowError();
39 | });
40 |
41 | test('handles whitespace before and after', () => {
42 | expect(parse(' .0')).toEqual([{ type: types.NUMBER, value: 0 }]);
43 | expect(parse('.0 ')).toEqual([{ type: types.NUMBER, value: 0 }]);
44 | expect(parse(' .0 ')).toEqual([{ type: types.NUMBER, value: 0 }]);
45 | });
46 |
47 | test('returns two numbers', () => {
48 | expect(parse('0 1')).toEqual([
49 | { type: types.NUMBER, value: 0 },
50 | { type: types.NUMBER, value: 1 },
51 | ]);
52 | expect(parse('10.01 5.55')).toEqual([
53 | { type: types.NUMBER, value: 10.01 },
54 | { type: types.NUMBER, value: 5.55 },
55 | ]);
56 | expect(parse(' 10.01 5.55 ')).toEqual([
57 | { type: types.NUMBER, value: 10.01 },
58 | { type: types.NUMBER, value: 5.55 },
59 | ]);
60 | });
61 |
62 | test('returns n numbers', () => {
63 | expect(parse(' 0 1 232 3.14 ')).toEqual([
64 | { type: types.NUMBER, value: 0 },
65 | { type: types.NUMBER, value: 1 },
66 | { type: types.NUMBER, value: 232 },
67 | { type: types.NUMBER, value: 3.14 },
68 | ]);
69 | });
70 |
71 | test('handles operators +, -, *, /, ^', () => {
72 | expect(parse('+')).toEqual([{ type: types.OPERATOR, value: '+' }]);
73 | expect(parse('-')).toEqual([{ type: types.OPERATOR, value: '-' }]);
74 | expect(parse('*')).toEqual([{ type: types.OPERATOR, value: '*' }]);
75 | expect(parse('/')).toEqual([{ type: types.OPERATOR, value: '/' }]);
76 | expect(parse('^')).toEqual([{ type: types.OPERATOR, value: '^' }]);
77 | });
78 |
79 | test('handles multiple operators', () => {
80 | expect(parse('++')).toEqual([
81 | { type: types.OPERATOR, value: '+' },
82 | { type: types.OPERATOR, value: '+' },
83 | ]);
84 | expect(parse('- - -')).toEqual([
85 | { type: types.OPERATOR, value: '-' },
86 | { type: types.OPERATOR, value: '-' },
87 | { type: types.OPERATOR, value: '-' },
88 | ]);
89 | expect(parse('+-*/^')).toEqual([
90 | { type: types.OPERATOR, value: '+' },
91 | { type: types.OPERATOR, value: '-' },
92 | { type: types.OPERATOR, value: '*' },
93 | { type: types.OPERATOR, value: '/' },
94 | { type: types.OPERATOR, value: '^' },
95 | ]);
96 | });
97 |
98 | test('handles operators and numbers', () => {
99 | expect(parse('5+5')).toEqual([
100 | { type: types.NUMBER, value: 5 },
101 | { type: types.OPERATOR, value: '+' },
102 | { type: types.NUMBER, value: 5 },
103 | ]);
104 | expect(parse('50+ 0.500--5')).toEqual([
105 | { type: types.NUMBER, value: 50 },
106 | { type: types.OPERATOR, value: '+' },
107 | { type: types.NUMBER, value: 0.5 },
108 | { type: types.OPERATOR, value: '-' },
109 | { type: types.OPERATOR, value: '-' },
110 | { type: types.NUMBER, value: 5 },
111 | ]);
112 | });
113 |
114 | test('handles parenthesis', () => {
115 | expect(parse('(')).toEqual([{ type: types.PARENTHESIS, value: '(' }]);
116 | expect(parse(')')).toEqual([{ type: types.PARENTHESIS, value: ')' }]);
117 | });
118 |
119 | test('handles multiple parentheses', () => {
120 | expect(parse('()')).toEqual([
121 | { type: types.PARENTHESIS, value: '(' },
122 | { type: types.PARENTHESIS, value: ')' },
123 | ]);
124 | expect(parse('(() ()')).toEqual([
125 | { type: types.PARENTHESIS, value: '(' },
126 | { type: types.PARENTHESIS, value: '(' },
127 | { type: types.PARENTHESIS, value: ')' },
128 | { type: types.PARENTHESIS, value: '(' },
129 | { type: types.PARENTHESIS, value: ')' },
130 | ]);
131 | });
132 |
133 | test('handles parentheses, operators, and numbers', () => {
134 | expect(parse('(5+5)')).toEqual([
135 | { type: types.PARENTHESIS, value: '(' },
136 | { type: types.NUMBER, value: 5 },
137 | { type: types.OPERATOR, value: '+' },
138 | { type: types.NUMBER, value: 5 },
139 | { type: types.PARENTHESIS, value: ')' },
140 | ]);
141 | });
142 |
143 | test('handles identifier', () => {
144 | expect(parse('var')).toEqual([{ type: types.IDENTIFIER, value: 'var' }]);
145 | expect(parse('var0')).toEqual([{ type: types.IDENTIFIER, value: 'var0' }]);
146 | });
147 |
148 | test('handles multiple identifiers', () => {
149 | expect(parse('var0 var1')).toEqual([
150 | { type: types.IDENTIFIER, value: 'var0' },
151 | { type: types.IDENTIFIER, value: 'var1' },
152 | ]);
153 | expect(parse('x y z')).toEqual([
154 | { type: types.IDENTIFIER, value: 'x' },
155 | { type: types.IDENTIFIER, value: 'y' },
156 | { type: types.IDENTIFIER, value: 'z' },
157 | ]);
158 | });
159 |
160 | test('handles identifiers, numbers, operators, and parentheses', () => {
161 | expect(parse('(var0 + 10)')).toEqual([
162 | { type: types.PARENTHESIS, value: '(' },
163 | { type: types.IDENTIFIER, value: 'var0' },
164 | { type: types.OPERATOR, value: '+' },
165 | { type: types.NUMBER, value: 10 },
166 | { type: types.PARENTHESIS, value: ')' },
167 | ]);
168 | expect(parse('(var0+10*anotherVar/x)')).toEqual([
169 | { type: types.PARENTHESIS, value: '(' },
170 | { type: types.IDENTIFIER, value: 'var0' },
171 | { type: types.OPERATOR, value: '+' },
172 | { type: types.NUMBER, value: 10 },
173 | { type: types.OPERATOR, value: '*' },
174 | { type: types.IDENTIFIER, value: 'anotherVar' },
175 | { type: types.OPERATOR, value: '/' },
176 | { type: types.IDENTIFIER, value: 'x' },
177 | { type: types.PARENTHESIS, value: ')' },
178 | ]);
179 | });
180 |
181 | test('handles ambiguous formulae', () => {
182 | expect(parse('5var')).toEqual([
183 | { type: types.NUMBER, value: 5 },
184 | { type: types.IDENTIFIER, value: 'var' },
185 | ]);
186 | expect(parse('var200.5')).toEqual([
187 | { type: types.IDENTIFIER, value: 'var200' },
188 | { type: types.NUMBER, value: 0.5 },
189 | ]);
190 | });
191 |
192 | test('handles to parse incorrect formulae', () => {
193 | expect(() => parse('var0.var1')).toThrowError('is not a number');
194 | expect(() => parse('(+.-)')).toThrowError('is not a number');
195 | });
196 | });
197 |
198 | describe('infixToTree', () => {
199 | test('converts nothing', () => {
200 | expect(infixToTree([])).toEqual([]);
201 | });
202 |
203 | test('converts single number or identifier', () => {
204 | expect(infixToTree([
205 | { type: types.NUMBER, value: 5 },
206 | ])).toEqual([
207 | { type: types.NUMBER, value: 5 },
208 | ]);
209 | expect(infixToTree([
210 | { type: types.IDENTIFIER, value: 'e' },
211 | ])).toEqual([
212 | { type: types.IDENTIFIER, value: 'e' },
213 | ]);
214 | });
215 |
216 | test('converts single simple operation', () => {
217 | expect(infixToTree([
218 | { type: types.NUMBER, value: 5 },
219 | { type: types.OPERATOR, value: '*' },
220 | { type: types.NUMBER, value: 2 },
221 | ])).toEqual([
222 | { type: types.OPERATOR, value: '*' },
223 | { type: types.NUMBER, value: 5 },
224 | { type: types.NUMBER, value: 2 },
225 | ]);
226 | });
227 |
228 | test('converts two operations of same priority', () => {
229 | expect(infixToTree([
230 | { type: types.NUMBER, value: 2 },
231 | { type: types.OPERATOR, value: '+' },
232 | { type: types.NUMBER, value: 3 },
233 | { type: types.OPERATOR, value: '-' },
234 | { type: types.NUMBER, value: 4 },
235 | ])).toEqual([
236 | { type: types.OPERATOR, value: '-' },
237 | { type: types.OPERATOR, value: '+' },
238 | { type: types.NUMBER, value: 4 },
239 | { type: types.NUMBER, value: 2 },
240 | { type: types.NUMBER, value: 3 },
241 | null, null,
242 | ]);
243 |
244 | expect(infixToTree([
245 | { type: types.NUMBER, value: 2 },
246 | { type: types.OPERATOR, value: '*' },
247 | { type: types.NUMBER, value: 3 },
248 | { type: types.OPERATOR, value: '/' },
249 | { type: types.NUMBER, value: 4 },
250 | ])).toEqual([
251 | { type: types.OPERATOR, value: '/' },
252 | { type: types.OPERATOR, value: '*' },
253 | { type: types.NUMBER, value: 4 },
254 | { type: types.NUMBER, value: 2 },
255 | { type: types.NUMBER, value: 3 },
256 | null, null,
257 | ]);
258 | });
259 |
260 | test('converts two operations of different priority', () => {
261 | expect(infixToTree([
262 | { type: types.NUMBER, value: 2 },
263 | { type: types.OPERATOR, value: '+' },
264 | { type: types.NUMBER, value: 3 },
265 | { type: types.OPERATOR, value: '*' },
266 | { type: types.NUMBER, value: 4 },
267 | ])).toEqual([
268 | { type: types.OPERATOR, value: '+' },
269 | { type: types.NUMBER, value: 2 },
270 | { type: types.OPERATOR, value: '*' },
271 | null, null,
272 | { type: types.NUMBER, value: 3 },
273 | { type: types.NUMBER, value: 4 },
274 | ]);
275 | });
276 |
277 | test('converts multiple operations of different priority', () => {
278 | expect(infixToTree([
279 | { type: types.NUMBER, value: 1 },
280 | { type: types.OPERATOR, value: '+' },
281 | { type: types.NUMBER, value: 2 },
282 | { type: types.OPERATOR, value: '*' },
283 | { type: types.NUMBER, value: 3 },
284 | { type: types.OPERATOR, value: '/' },
285 | { type: types.NUMBER, value: 4 },
286 | { type: types.OPERATOR, value: '+' },
287 | { type: types.NUMBER, value: 5 },
288 | { type: types.OPERATOR, value: '*' },
289 | { type: types.NUMBER, value: 6 },
290 | ])).toEqual([
291 | { type: types.OPERATOR, value: '+' },
292 | { type: types.NUMBER, value: 1 },
293 | { type: types.OPERATOR, value: '+' },
294 | null, null,
295 | { type: types.OPERATOR, value: '/' },
296 | { type: types.OPERATOR, value: '*' },
297 | null, null, null, null,
298 | { type: types.OPERATOR, value: '*' },
299 | { type: types.NUMBER, value: 4 },
300 | { type: types.NUMBER, value: 5 },
301 | { type: types.NUMBER, value: 6 },
302 | null, null, null, null, null, null, null, null,
303 | { type: types.NUMBER, value: 2 },
304 | { type: types.NUMBER, value: 3 },
305 | null, null, null, null, null, null,
306 | ]);
307 | });
308 |
309 | test('converts with operators and parentheses', () => {
310 | expect(infixToTree([
311 | { type: types.NUMBER, value: 1 },
312 | { type: types.OPERATOR, value: '*' },
313 | { type: types.PARENTHESIS, value: '(' },
314 | { type: types.NUMBER, value: 2 },
315 | { type: types.OPERATOR, value: '+' },
316 | { type: types.NUMBER, value: 3 },
317 | { type: types.PARENTHESIS, value: ')' },
318 | ])).toEqual([
319 | { type: types.OPERATOR, value: '*' },
320 | { type: types.NUMBER, value: 1 },
321 | { type: types.PARENTHESIS, value: '(' },
322 | null, null,
323 | { type: types.NOOP },
324 | { type: types.OPERATOR, value: '+' },
325 | null, null, null, null, null, null,
326 | { type: types.NUMBER, value: 2 },
327 | { type: types.NUMBER, value: 3 },
328 | ]);
329 |
330 | expect(infixToTree([
331 | { type: types.PARENTHESIS, value: '(' },
332 | { type: types.NUMBER, value: 1 },
333 | { type: types.OPERATOR, value: '+' },
334 | { type: types.NUMBER, value: 2 },
335 | { type: types.PARENTHESIS, value: ')' },
336 | ])).toEqual([
337 | { type: types.PARENTHESIS, value: '(' },
338 | { type: types.NOOP },
339 | { type: types.OPERATOR, value: '+' },
340 | null, null,
341 | { type: types.NUMBER, value: 1 },
342 | { type: types.NUMBER, value: 2 },
343 | ]);
344 |
345 | expect(infixToTree([
346 | { type: types.NUMBER, value: 1 },
347 | { type: types.PARENTHESIS, value: '(' },
348 | { type: types.NUMBER, value: 2 },
349 | { type: types.OPERATOR, value: '+' },
350 | { type: types.NUMBER, value: 3 },
351 | { type: types.PARENTHESIS, value: ')' },
352 | ])).toEqual([
353 | { type: types.PARENTHESIS, value: '(' },
354 | { type: types.NUMBER, value: 1 },
355 | { type: types.OPERATOR, value: '+' },
356 | null, null,
357 | { type: types.NUMBER, value: 2 },
358 | { type: types.NUMBER, value: 3 },
359 | ]);
360 |
361 | expect(infixToTree([
362 | { type: types.NUMBER, value: 1 },
363 | { type: types.OPERATOR, value: '+' },
364 | { type: types.NUMBER, value: 2 },
365 | { type: types.PARENTHESIS, value: '(' },
366 | { type: types.NUMBER, value: 3 },
367 | { type: types.OPERATOR, value: '+' },
368 | { type: types.NUMBER, value: 4 },
369 | { type: types.PARENTHESIS, value: ')' },
370 | ])).toEqual([
371 | { type: types.OPERATOR, value: '+' },
372 | { type: types.NUMBER, value: 1 },
373 | { type: types.PARENTHESIS, value: '(' },
374 | null, null,
375 | { type: types.NUMBER, value: 2 },
376 | { type: types.OPERATOR, value: '+' },
377 | null, null, null, null, null, null,
378 | { type: types.NUMBER, value: 3 },
379 | { type: types.NUMBER, value: 4 },
380 | ]);
381 |
382 | expect(infixToTree([
383 | { type: types.PARENTHESIS, value: '(' },
384 | { type: types.NUMBER, value: 1 },
385 | { type: types.OPERATOR, value: '+' },
386 | { type: types.NUMBER, value: 3 },
387 | { type: types.PARENTHESIS, value: ')' },
388 | { type: types.OPERATOR, value: '*' },
389 | { type: types.NUMBER, value: 2 },
390 | ])).toEqual([
391 | { type: types.OPERATOR, value: '*' },
392 | { type: types.PARENTHESIS, value: '(' },
393 | { type: types.NUMBER, value: 2 },
394 | { type: types.NOOP },
395 | { type: types.OPERATOR, value: '+' },
396 | null, null, null, null,
397 | { type: types.NUMBER, value: 1 },
398 | { type: types.NUMBER, value: 3 },
399 | null, null, null, null,
400 | ]);
401 | });
402 |
403 | test('converts with multiple sets of parentheses', () => {
404 | expect(infixToTree([
405 | { type: types.PARENTHESIS, value: '(' },
406 | { type: types.NUMBER, value: 1 },
407 | { type: types.OPERATOR, value: '+' },
408 | { type: types.PARENTHESIS, value: '(' },
409 | { type: types.NUMBER, value: 2 },
410 | { type: types.OPERATOR, value: '+' },
411 | { type: types.NUMBER, value: 3 },
412 | { type: types.PARENTHESIS, value: ')' },
413 | { type: types.PARENTHESIS, value: ')' },
414 | ])).toEqual([
415 | { type: types.PARENTHESIS, value: '(' },
416 | { type: types.NOOP },
417 | { type: types.OPERATOR, value: '+' },
418 | null, null,
419 | { type: types.NUMBER, value: 1 },
420 | { type: types.PARENTHESIS, value: '(' },
421 | null, null, null, null, null, null,
422 | { type: types.NOOP },
423 | { type: types.OPERATOR, value: '+' },
424 | null, null, null, null, null, null, null, null, null, null, null, null, null, null,
425 | { type: types.NUMBER, value: 2 },
426 | { type: types.NUMBER, value: 3 },
427 | ]);
428 |
429 | expect(infixToTree([
430 | { type: types.PARENTHESIS, value: '(' },
431 | { type: types.NUMBER, value: 1 },
432 | { type: types.PARENTHESIS, value: ')' },
433 | { type: types.PARENTHESIS, value: '(' },
434 | { type: types.NUMBER, value: 2 },
435 | { type: types.PARENTHESIS, value: ')' },
436 | ])).toEqual([
437 | { type: types.PARENTHESIS, value: '(' },
438 | { type: types.PARENTHESIS, value: '(' },
439 | { type: types.NUMBER, value: 2 },
440 | { type: types.NOOP },
441 | { type: types.NUMBER, value: 1 },
442 | null, null,
443 | ]);
444 | });
445 |
446 | test('converts with exponents', () => {
447 | expect(infixToTree([
448 | { type: types.NUMBER, value: 1 },
449 | { type: types.OPERATOR, value: '^' },
450 | { type: types.NUMBER, value: 2 },
451 | ])).toEqual([
452 | { type: types.OPERATOR, value: '^' },
453 | { type: types.NUMBER, value: 1 },
454 | { type: types.NUMBER, value: 2 },
455 | ]);
456 |
457 | expect(infixToTree([
458 | { type: types.NUMBER, value: 1 },
459 | { type: types.OPERATOR, value: '^' },
460 | { type: types.NUMBER, value: 2 },
461 | { type: types.OPERATOR, value: '*' },
462 | { type: types.NUMBER, value: 3 },
463 | ])).toEqual([
464 | { type: types.OPERATOR, value: '*' },
465 | { type: types.OPERATOR, value: '^' },
466 | { type: types.NUMBER, value: 3 },
467 | { type: types.NUMBER, value: 1 },
468 | { type: types.NUMBER, value: 2 },
469 | null, null,
470 | ]);
471 |
472 | expect(infixToTree([
473 | { type: types.NUMBER, value: 1 },
474 | { type: types.OPERATOR, value: '^' },
475 | { type: types.NUMBER, value: 2 },
476 | { type: types.OPERATOR, value: '^' },
477 | { type: types.NUMBER, value: 3 },
478 | ])).toEqual([
479 | { type: types.OPERATOR, value: '^' },
480 | { type: types.OPERATOR, value: '^' },
481 | { type: types.NUMBER, value: 3 },
482 | { type: types.NUMBER, value: 1 },
483 | { type: types.NUMBER, value: 2 },
484 | null, null,
485 | ]);
486 |
487 | expect(infixToTree([
488 | { type: types.NUMBER, value: 1 },
489 | { type: types.OPERATOR, value: '^' },
490 | { type: types.PARENTHESIS, value: '(' },
491 | { type: types.NUMBER, value: 2 },
492 | { type: types.OPERATOR, value: '+' },
493 | { type: types.NUMBER, value: 3 },
494 | { type: types.PARENTHESIS, value: ')' },
495 | ])).toEqual([
496 | { type: types.OPERATOR, value: '^' },
497 | { type: types.NUMBER, value: 1 },
498 | { type: types.PARENTHESIS, value: '(' },
499 | null, null,
500 | { type: types.NOOP },
501 | { type: types.OPERATOR, value: '+' },
502 | null, null, null, null, null, null,
503 | { type: types.NUMBER, value: 2 },
504 | { type: types.NUMBER, value: 3 },
505 | ]);
506 |
507 | expect(infixToTree([
508 | { type: types.PARENTHESIS, value: '(' },
509 | { type: types.NUMBER, value: 3 },
510 | { type: types.OPERATOR, value: '^' },
511 | { type: types.NUMBER, value: 2 },
512 | { type: types.OPERATOR, value: '+' },
513 | { type: types.NUMBER, value: 4 },
514 | { type: types.OPERATOR, value: '^' },
515 | { type: types.NUMBER, value: 2 },
516 | { type: types.PARENTHESIS, value: ')' },
517 | { type: types.OPERATOR, value: '^' },
518 | { type: types.NUMBER, value: 0.5 },
519 | ])).toEqual([
520 | { type: types.OPERATOR, value: '^' },
521 | { type: types.PARENTHESIS, value: '(' },
522 | { type: types.NUMBER, value: 0.5 },
523 | { type: types.NOOP },
524 | { type: types.OPERATOR, value: '+' },
525 | null, null, null, null,
526 | { type: types.OPERATOR, value: '^' },
527 | { type: types.OPERATOR, value: '^' },
528 | null, null, null, null, null, null, null, null,
529 | { type: types.NUMBER, value: 3 },
530 | { type: types.NUMBER, value: 2 },
531 | { type: types.NUMBER, value: 4 },
532 | { type: types.NUMBER, value: 2 },
533 | null, null, null, null, null, null, null, null,
534 | ]);
535 | });
536 |
537 | test('converts edge cases', () => {
538 | expect(infixToTree([
539 | { type: types.OPERATOR, value: '-' },
540 | { type: types.IDENTIFIER, value: 'b' },
541 | { type: types.OPERATOR, value: '+' },
542 | { type: types.NUMBER, value: 2 },
543 | ])).toEqual([
544 | { type: types.OPERATOR, value: '+' },
545 | { type: types.OPERATOR, value: '-' },
546 | { type: types.NUMBER, value: 2 },
547 | { type: types.NOOP },
548 | { type: types.IDENTIFIER, value: 'b' },
549 | null, null,
550 | ]);
551 | });
552 | });
553 |
554 | describe('evaluate', () => {
555 | test('computes single number', () => {
556 | const tree = [
557 | { type: types.NUMBER, value: 5 },
558 | ];
559 | expect(evaluate(tree, {})).toBe(5);
560 | });
561 |
562 | test('computes single identifier', () => {
563 | const tree = [
564 | { type: types.IDENTIFIER, value: 'b' },
565 | ];
566 | expect(evaluate(tree, { b: 2 })).toBe(2);
567 | });
568 |
569 | test('computes 1+2', () => {
570 | const tree = [
571 | { type: types.OPERATOR, value: '+' },
572 | { type: types.NUMBER, value: 1 },
573 | { type: types.NUMBER, value: 2 },
574 | ];
575 | expect(evaluate(tree, {})).toBe(3);
576 | });
577 |
578 | test('computes negative', () => {
579 | const tree = [
580 | { type: types.OPERATOR, value: '-' },
581 | { type: types.NUMBER, value: 1 },
582 | null,
583 | ];
584 | expect(evaluate(tree, {})).toBe(-1);
585 | });
586 |
587 | test('computes 2+3-4', () => {
588 | const tree = [
589 | { type: types.OPERATOR, value: '-' },
590 | { type: types.OPERATOR, value: '+' },
591 | { type: types.NUMBER, value: 4 },
592 | { type: types.NUMBER, value: 2 },
593 | { type: types.NUMBER, value: 3 },
594 | ];
595 | expect(evaluate(tree, {})).toBe(1);
596 | });
597 |
598 | test('computes 2*3/4', () => {
599 | const tree = [
600 | { type: types.OPERATOR, value: '/' },
601 | { type: types.OPERATOR, value: '*' },
602 | { type: types.NUMBER, value: 4 },
603 | { type: types.NUMBER, value: 2 },
604 | { type: types.NUMBER, value: 3 },
605 | ];
606 | expect(evaluate(tree, {})).toBe(1.5);
607 | });
608 |
609 | test('computes 2+3*4', () => {
610 | const tree = [
611 | { type: types.OPERATOR, value: '+' },
612 | { type: types.NUMBER, value: 2 },
613 | { type: types.OPERATOR, value: '*' },
614 | null, null,
615 | { type: types.NUMBER, value: 3 },
616 | { type: types.NUMBER, value: 4 },
617 | ];
618 | expect(evaluate(tree, {})).toBe(14);
619 | });
620 |
621 | test('computes 1+2*3/4+5*6', () => {
622 | const tree = [
623 | { type: types.OPERATOR, value: '+' },
624 | { type: types.NUMBER, value: 1 },
625 | { type: types.OPERATOR, value: '+' },
626 | null, null,
627 | { type: types.OPERATOR, value: '/' },
628 | { type: types.OPERATOR, value: '*' },
629 | null, null, null, null,
630 | { type: types.OPERATOR, value: '*' },
631 | { type: types.NUMBER, value: 4 },
632 | { type: types.NUMBER, value: 5 },
633 | { type: types.NUMBER, value: 6 },
634 | null, null, null, null, null, null, null, null,
635 | { type: types.NUMBER, value: 2 },
636 | { type: types.NUMBER, value: 3 },
637 | ];
638 | expect(evaluate(tree, {})).toBe(32.5);
639 | });
640 |
641 | test('computes 5*(2+3)', () => {
642 | const tree = [
643 | { type: types.OPERATOR, value: '*' },
644 | { type: types.NUMBER, value: 5 },
645 | { type: types.PARENTHESIS, value: '(' },
646 | null, null, null,
647 | { type: types.OPERATOR, value: '+' },
648 | null, null, null, null, null, null,
649 | { type: types.NUMBER, value: 2 },
650 | { type: types.NUMBER, value: 3 },
651 | ];
652 | expect(evaluate(tree, {})).toBe(25);
653 | });
654 |
655 | test('computes (1+2)', () => {
656 | const tree = [
657 | { type: types.PARENTHESIS, value: '(' },
658 | null,
659 | { type: types.OPERATOR, value: '+' },
660 | null, null,
661 | { type: types.NUMBER, value: 1 },
662 | { type: types.NUMBER, value: 2 },
663 | ];
664 | expect(evaluate(tree, {})).toBe(3);
665 | });
666 |
667 | test('computes 5(2+3)', () => {
668 | const tree = [
669 | { type: types.PARENTHESIS, value: '(' },
670 | { type: types.NUMBER, value: 5 },
671 | { type: types.OPERATOR, value: '+' },
672 | null, null,
673 | { type: types.NUMBER, value: 2 },
674 | { type: types.NUMBER, value: 3 },
675 | ];
676 | expect(evaluate(tree, {})).toBe(25);
677 | });
678 |
679 | test('computes 1+2(3+4)', () => {
680 | const tree = [
681 | { type: types.OPERATOR, value: '+' },
682 | { type: types.NUMBER, value: 1 },
683 | { type: types.PARENTHESIS, value: '(' },
684 | null, null,
685 | { type: types.NUMBER, value: 2 },
686 | { type: types.OPERATOR, value: '+' },
687 | null, null, null, null, null, null,
688 | { type: types.NUMBER, value: 3 },
689 | { type: types.NUMBER, value: 4 },
690 | ];
691 | expect(evaluate(tree, {})).toBe(15);
692 | });
693 |
694 | test('computes (3)(2)', () => {
695 | const tree = [
696 | { type: types.PARENTHESIS, value: '(' },
697 | { type: types.PARENTHESIS, value: '(' },
698 | { type: types.NUMBER, value: 2 },
699 | null,
700 | { type: types.NUMBER, value: 3 },
701 | ];
702 | expect(evaluate(tree, {})).toBe(6);
703 | });
704 |
705 | test('computes 5^2*3', () => {
706 | const tree = [
707 | { type: types.OPERATOR, value: '*' },
708 | { type: types.OPERATOR, value: '^' },
709 | { type: types.NUMBER, value: 3 },
710 | { type: types.NUMBER, value: 5 },
711 | { type: types.NUMBER, value: 2 },
712 | ];
713 | expect(evaluate(tree, {})).toBe(75);
714 | });
715 |
716 | test('computes 5^(2+3)', () => {
717 | const tree = [
718 | { type: types.OPERATOR, value: '^' },
719 | { type: types.NUMBER, value: 5 },
720 | { type: types.PARENTHESIS, value: '(' },
721 | null, null, null,
722 | { type: types.OPERATOR, value: '+' },
723 | null, null, null, null, null, null,
724 | { type: types.NUMBER, value: 2 },
725 | { type: types.NUMBER, value: 3 },
726 | ];
727 | expect(evaluate(tree, {})).toBe(3125);
728 | });
729 |
730 | test('computes -5+2', () => {
731 | const tree = [
732 | { type: types.OPERATOR, value: '+' },
733 | { type: types.OPERATOR, value: '-' },
734 | { type: types.NUMBER, value: 2 },
735 | null,
736 | { type: types.NUMBER, value: 5 },
737 | ];
738 | expect(evaluate(tree, {})).toBe(-3);
739 | });
740 | });
741 |
742 | describe('calculate', () => {
743 | test('calculates pythagorean theorem', () => {
744 | expect(calculate('(a^2+b^2)^(1/2)', { a: 3, b: 4 })).toBeCloseTo(5);
745 | });
746 |
747 | test('calculates quadratic formula', () => {
748 | expect(calculate('(-b+(b^2-4*a*c)^(1/2))/(2*a)', { a: 5, b: 13, c: 7 })).toBeCloseTo(-0.76148, 4);
749 | expect(calculate('(-b-(b^2-4*a*c)^(1/2))/(2*a)', { a: 5, b: 13, c: 7 })).toBeCloseTo(-1.83851, 4);
750 | });
751 |
752 | test('calculates gravitational pull', () => {
753 | // Earth
754 | expect(calculate('G * m0 * m1 / (r^2)', {
755 | G: 6.6743E-11, m0: 5.972E24, m1: 1, r: 6.371E6,
756 | })).toBeCloseTo(9.81997, 4);
757 | // Saturn
758 | expect(calculate('G * m0 * m1 / (r^2)', {
759 | G: 6.6743E-11, m0: 5.6834E26, m1: 1, r: 5.8232E7,
760 | })).toBeCloseTo(11.18640, 4);
761 | });
762 | });
763 |
--------------------------------------------------------------------------------
/LICENSE:
--------------------------------------------------------------------------------
1 | GNU GENERAL PUBLIC LICENSE
2 | Version 3, 29 June 2007
3 |
4 | Copyright (C) 2007 Free Software Foundation, Inc.
5 | Everyone is permitted to copy and distribute verbatim copies
6 | of this license document, but changing it is not allowed.
7 |
8 | Preamble
9 |
10 | The GNU General Public License is a free, copyleft license for
11 | software and other kinds of works.
12 |
13 | The licenses for most software and other practical works are designed
14 | to take away your freedom to share and change the works. By contrast,
15 | the GNU General Public License is intended to guarantee your freedom to
16 | share and change all versions of a program--to make sure it remains free
17 | software for all its users. We, the Free Software Foundation, use the
18 | GNU General Public License for most of our software; it applies also to
19 | any other work released this way by its authors. You can apply it to
20 | your programs, too.
21 |
22 | When we speak of free software, we are referring to freedom, not
23 | price. Our General Public Licenses are designed to make sure that you
24 | have the freedom to distribute copies of free software (and charge for
25 | them if you wish), that you receive source code or can get it if you
26 | want it, that you can change the software or use pieces of it in new
27 | free programs, and that you know you can do these things.
28 |
29 | To protect your rights, we need to prevent others from denying you
30 | these rights or asking you to surrender the rights. Therefore, you have
31 | certain responsibilities if you distribute copies of the software, or if
32 | you modify it: responsibilities to respect the freedom of others.
33 |
34 | For example, if you distribute copies of such a program, whether
35 | gratis or for a fee, you must pass on to the recipients the same
36 | freedoms that you received. You must make sure that they, too, receive
37 | or can get the source code. And you must show them these terms so they
38 | know their rights.
39 |
40 | Developers that use the GNU GPL protect your rights with two steps:
41 | (1) assert copyright on the software, and (2) offer you this License
42 | giving you legal permission to copy, distribute and/or modify it.
43 |
44 | For the developers' and authors' protection, the GPL clearly explains
45 | that there is no warranty for this free software. For both users' and
46 | authors' sake, the GPL requires that modified versions be marked as
47 | changed, so that their problems will not be attributed erroneously to
48 | authors of previous versions.
49 |
50 | Some devices are designed to deny users access to install or run
51 | modified versions of the software inside them, although the manufacturer
52 | can do so. This is fundamentally incompatible with the aim of
53 | protecting users' freedom to change the software. The systematic
54 | pattern of such abuse occurs in the area of products for individuals to
55 | use, which is precisely where it is most unacceptable. Therefore, we
56 | have designed this version of the GPL to prohibit the practice for those
57 | products. If such problems arise substantially in other domains, we
58 | stand ready to extend this provision to those domains in future versions
59 | of the GPL, as needed to protect the freedom of users.
60 |
61 | Finally, every program is threatened constantly by software patents.
62 | States should not allow patents to restrict development and use of
63 | software on general-purpose computers, but in those that do, we wish to
64 | avoid the special danger that patents applied to a free program could
65 | make it effectively proprietary. To prevent this, the GPL assures that
66 | patents cannot be used to render the program non-free.
67 |
68 | The precise terms and conditions for copying, distribution and
69 | modification follow.
70 |
71 | TERMS AND CONDITIONS
72 |
73 | 0. Definitions.
74 |
75 | "This License" refers to version 3 of the GNU General Public License.
76 |
77 | "Copyright" also means copyright-like laws that apply to other kinds of
78 | works, such as semiconductor masks.
79 |
80 | "The Program" refers to any copyrightable work licensed under this
81 | License. Each licensee is addressed as "you". "Licensees" and
82 | "recipients" may be individuals or organizations.
83 |
84 | To "modify" a work means to copy from or adapt all or part of the work
85 | in a fashion requiring copyright permission, other than the making of an
86 | exact copy. The resulting work is called a "modified version" of the
87 | earlier work or a work "based on" the earlier work.
88 |
89 | A "covered work" means either the unmodified Program or a work based
90 | on the Program.
91 |
92 | To "propagate" a work means to do anything with it that, without
93 | permission, would make you directly or secondarily liable for
94 | infringement under applicable copyright law, except executing it on a
95 | computer or modifying a private copy. Propagation includes copying,
96 | distribution (with or without modification), making available to the
97 | public, and in some countries other activities as well.
98 |
99 | To "convey" a work means any kind of propagation that enables other
100 | parties to make or receive copies. Mere interaction with a user through
101 | a computer network, with no transfer of a copy, is not conveying.
102 |
103 | An interactive user interface displays "Appropriate Legal Notices"
104 | to the extent that it includes a convenient and prominently visible
105 | feature that (1) displays an appropriate copyright notice, and (2)
106 | tells the user that there is no warranty for the work (except to the
107 | extent that warranties are provided), that licensees may convey the
108 | work under this License, and how to view a copy of this License. If
109 | the interface presents a list of user commands or options, such as a
110 | menu, a prominent item in the list meets this criterion.
111 |
112 | 1. Source Code.
113 |
114 | The "source code" for a work means the preferred form of the work
115 | for making modifications to it. "Object code" means any non-source
116 | form of a work.
117 |
118 | A "Standard Interface" means an interface that either is an official
119 | standard defined by a recognized standards body, or, in the case of
120 | interfaces specified for a particular programming language, one that
121 | is widely used among developers working in that language.
122 |
123 | The "System Libraries" of an executable work include anything, other
124 | than the work as a whole, that (a) is included in the normal form of
125 | packaging a Major Component, but which is not part of that Major
126 | Component, and (b) serves only to enable use of the work with that
127 | Major Component, or to implement a Standard Interface for which an
128 | implementation is available to the public in source code form. A
129 | "Major Component", in this context, means a major essential component
130 | (kernel, window system, and so on) of the specific operating system
131 | (if any) on which the executable work runs, or a compiler used to
132 | produce the work, or an object code interpreter used to run it.
133 |
134 | The "Corresponding Source" for a work in object code form means all
135 | the source code needed to generate, install, and (for an executable
136 | work) run the object code and to modify the work, including scripts to
137 | control those activities. However, it does not include the work's
138 | System Libraries, or general-purpose tools or generally available free
139 | programs which are used unmodified in performing those activities but
140 | which are not part of the work. For example, Corresponding Source
141 | includes interface definition files associated with source files for
142 | the work, and the source code for shared libraries and dynamically
143 | linked subprograms that the work is specifically designed to require,
144 | such as by intimate data communication or control flow between those
145 | subprograms and other parts of the work.
146 |
147 | The Corresponding Source need not include anything that users
148 | can regenerate automatically from other parts of the Corresponding
149 | Source.
150 |
151 | The Corresponding Source for a work in source code form is that
152 | same work.
153 |
154 | 2. Basic Permissions.
155 |
156 | All rights granted under this License are granted for the term of
157 | copyright on the Program, and are irrevocable provided the stated
158 | conditions are met. This License explicitly affirms your unlimited
159 | permission to run the unmodified Program. The output from running a
160 | covered work is covered by this License only if the output, given its
161 | content, constitutes a covered work. This License acknowledges your
162 | rights of fair use or other equivalent, as provided by copyright law.
163 |
164 | You may make, run and propagate covered works that you do not
165 | convey, without conditions so long as your license otherwise remains
166 | in force. You may convey covered works to others for the sole purpose
167 | of having them make modifications exclusively for you, or provide you
168 | with facilities for running those works, provided that you comply with
169 | the terms of this License in conveying all material for which you do
170 | not control copyright. Those thus making or running the covered works
171 | for you must do so exclusively on your behalf, under your direction
172 | and control, on terms that prohibit them from making any copies of
173 | your copyrighted material outside their relationship with you.
174 |
175 | Conveying under any other circumstances is permitted solely under
176 | the conditions stated below. Sublicensing is not allowed; section 10
177 | makes it unnecessary.
178 |
179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law.
180 |
181 | No covered work shall be deemed part of an effective technological
182 | measure under any applicable law fulfilling obligations under article
183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or
184 | similar laws prohibiting or restricting circumvention of such
185 | measures.
186 |
187 | When you convey a covered work, you waive any legal power to forbid
188 | circumvention of technological measures to the extent such circumvention
189 | is effected by exercising rights under this License with respect to
190 | the covered work, and you disclaim any intention to limit operation or
191 | modification of the work as a means of enforcing, against the work's
192 | users, your or third parties' legal rights to forbid circumvention of
193 | technological measures.
194 |
195 | 4. Conveying Verbatim Copies.
196 |
197 | You may convey verbatim copies of the Program's source code as you
198 | receive it, in any medium, provided that you conspicuously and
199 | appropriately publish on each copy an appropriate copyright notice;
200 | keep intact all notices stating that this License and any
201 | non-permissive terms added in accord with section 7 apply to the code;
202 | keep intact all notices of the absence of any warranty; and give all
203 | recipients a copy of this License along with the Program.
204 |
205 | You may charge any price or no price for each copy that you convey,
206 | and you may offer support or warranty protection for a fee.
207 |
208 | 5. Conveying Modified Source Versions.
209 |
210 | You may convey a work based on the Program, or the modifications to
211 | produce it from the Program, in the form of source code under the
212 | terms of section 4, provided that you also meet all of these conditions:
213 |
214 | a) The work must carry prominent notices stating that you modified
215 | it, and giving a relevant date.
216 |
217 | b) The work must carry prominent notices stating that it is
218 | released under this License and any conditions added under section
219 | 7. This requirement modifies the requirement in section 4 to
220 | "keep intact all notices".
221 |
222 | c) You must license the entire work, as a whole, under this
223 | License to anyone who comes into possession of a copy. This
224 | License will therefore apply, along with any applicable section 7
225 | additional terms, to the whole of the work, and all its parts,
226 | regardless of how they are packaged. This License gives no
227 | permission to license the work in any other way, but it does not
228 | invalidate such permission if you have separately received it.
229 |
230 | d) If the work has interactive user interfaces, each must display
231 | Appropriate Legal Notices; however, if the Program has interactive
232 | interfaces that do not display Appropriate Legal Notices, your
233 | work need not make them do so.
234 |
235 | A compilation of a covered work with other separate and independent
236 | works, which are not by their nature extensions of the covered work,
237 | and which are not combined with it such as to form a larger program,
238 | in or on a volume of a storage or distribution medium, is called an
239 | "aggregate" if the compilation and its resulting copyright are not
240 | used to limit the access or legal rights of the compilation's users
241 | beyond what the individual works permit. Inclusion of a covered work
242 | in an aggregate does not cause this License to apply to the other
243 | parts of the aggregate.
244 |
245 | 6. Conveying Non-Source Forms.
246 |
247 | You may convey a covered work in object code form under the terms
248 | of sections 4 and 5, provided that you also convey the
249 | machine-readable Corresponding Source under the terms of this License,
250 | in one of these ways:
251 |
252 | a) Convey the object code in, or embodied in, a physical product
253 | (including a physical distribution medium), accompanied by the
254 | Corresponding Source fixed on a durable physical medium
255 | customarily used for software interchange.
256 |
257 | b) Convey the object code in, or embodied in, a physical product
258 | (including a physical distribution medium), accompanied by a
259 | written offer, valid for at least three years and valid for as
260 | long as you offer spare parts or customer support for that product
261 | model, to give anyone who possesses the object code either (1) a
262 | copy of the Corresponding Source for all the software in the
263 | product that is covered by this License, on a durable physical
264 | medium customarily used for software interchange, for a price no
265 | more than your reasonable cost of physically performing this
266 | conveying of source, or (2) access to copy the
267 | Corresponding Source from a network server at no charge.
268 |
269 | c) Convey individual copies of the object code with a copy of the
270 | written offer to provide the Corresponding Source. This
271 | alternative is allowed only occasionally and noncommercially, and
272 | only if you received the object code with such an offer, in accord
273 | with subsection 6b.
274 |
275 | d) Convey the object code by offering access from a designated
276 | place (gratis or for a charge), and offer equivalent access to the
277 | Corresponding Source in the same way through the same place at no
278 | further charge. You need not require recipients to copy the
279 | Corresponding Source along with the object code. If the place to
280 | copy the object code is a network server, the Corresponding Source
281 | may be on a different server (operated by you or a third party)
282 | that supports equivalent copying facilities, provided you maintain
283 | clear directions next to the object code saying where to find the
284 | Corresponding Source. Regardless of what server hosts the
285 | Corresponding Source, you remain obligated to ensure that it is
286 | available for as long as needed to satisfy these requirements.
287 |
288 | e) Convey the object code using peer-to-peer transmission, provided
289 | you inform other peers where the object code and Corresponding
290 | Source of the work are being offered to the general public at no
291 | charge under subsection 6d.
292 |
293 | A separable portion of the object code, whose source code is excluded
294 | from the Corresponding Source as a System Library, need not be
295 | included in conveying the object code work.
296 |
297 | A "User Product" is either (1) a "consumer product", which means any
298 | tangible personal property which is normally used for personal, family,
299 | or household purposes, or (2) anything designed or sold for incorporation
300 | into a dwelling. In determining whether a product is a consumer product,
301 | doubtful cases shall be resolved in favor of coverage. For a particular
302 | product received by a particular user, "normally used" refers to a
303 | typical or common use of that class of product, regardless of the status
304 | of the particular user or of the way in which the particular user
305 | actually uses, or expects or is expected to use, the product. A product
306 | is a consumer product regardless of whether the product has substantial
307 | commercial, industrial or non-consumer uses, unless such uses represent
308 | the only significant mode of use of the product.
309 |
310 | "Installation Information" for a User Product means any methods,
311 | procedures, authorization keys, or other information required to install
312 | and execute modified versions of a covered work in that User Product from
313 | a modified version of its Corresponding Source. The information must
314 | suffice to ensure that the continued functioning of the modified object
315 | code is in no case prevented or interfered with solely because
316 | modification has been made.
317 |
318 | If you convey an object code work under this section in, or with, or
319 | specifically for use in, a User Product, and the conveying occurs as
320 | part of a transaction in which the right of possession and use of the
321 | User Product is transferred to the recipient in perpetuity or for a
322 | fixed term (regardless of how the transaction is characterized), the
323 | Corresponding Source conveyed under this section must be accompanied
324 | by the Installation Information. But this requirement does not apply
325 | if neither you nor any third party retains the ability to install
326 | modified object code on the User Product (for example, the work has
327 | been installed in ROM).
328 |
329 | The requirement to provide Installation Information does not include a
330 | requirement to continue to provide support service, warranty, or updates
331 | for a work that has been modified or installed by the recipient, or for
332 | the User Product in which it has been modified or installed. Access to a
333 | network may be denied when the modification itself materially and
334 | adversely affects the operation of the network or violates the rules and
335 | protocols for communication across the network.
336 |
337 | Corresponding Source conveyed, and Installation Information provided,
338 | in accord with this section must be in a format that is publicly
339 | documented (and with an implementation available to the public in
340 | source code form), and must require no special password or key for
341 | unpacking, reading or copying.
342 |
343 | 7. Additional Terms.
344 |
345 | "Additional permissions" are terms that supplement the terms of this
346 | License by making exceptions from one or more of its conditions.
347 | Additional permissions that are applicable to the entire Program shall
348 | be treated as though they were included in this License, to the extent
349 | that they are valid under applicable law. If additional permissions
350 | apply only to part of the Program, that part may be used separately
351 | under those permissions, but the entire Program remains governed by
352 | this License without regard to the additional permissions.
353 |
354 | When you convey a copy of a covered work, you may at your option
355 | remove any additional permissions from that copy, or from any part of
356 | it. (Additional permissions may be written to require their own
357 | removal in certain cases when you modify the work.) You may place
358 | additional permissions on material, added by you to a covered work,
359 | for which you have or can give appropriate copyright permission.
360 |
361 | Notwithstanding any other provision of this License, for material you
362 | add to a covered work, you may (if authorized by the copyright holders of
363 | that material) supplement the terms of this License with terms:
364 |
365 | a) Disclaiming warranty or limiting liability differently from the
366 | terms of sections 15 and 16 of this License; or
367 |
368 | b) Requiring preservation of specified reasonable legal notices or
369 | author attributions in that material or in the Appropriate Legal
370 | Notices displayed by works containing it; or
371 |
372 | c) Prohibiting misrepresentation of the origin of that material, or
373 | requiring that modified versions of such material be marked in
374 | reasonable ways as different from the original version; or
375 |
376 | d) Limiting the use for publicity purposes of names of licensors or
377 | authors of the material; or
378 |
379 | e) Declining to grant rights under trademark law for use of some
380 | trade names, trademarks, or service marks; or
381 |
382 | f) Requiring indemnification of licensors and authors of that
383 | material by anyone who conveys the material (or modified versions of
384 | it) with contractual assumptions of liability to the recipient, for
385 | any liability that these contractual assumptions directly impose on
386 | those licensors and authors.
387 |
388 | All other non-permissive additional terms are considered "further
389 | restrictions" within the meaning of section 10. If the Program as you
390 | received it, or any part of it, contains a notice stating that it is
391 | governed by this License along with a term that is a further
392 | restriction, you may remove that term. If a license document contains
393 | a further restriction but permits relicensing or conveying under this
394 | License, you may add to a covered work material governed by the terms
395 | of that license document, provided that the further restriction does
396 | not survive such relicensing or conveying.
397 |
398 | If you add terms to a covered work in accord with this section, you
399 | must place, in the relevant source files, a statement of the
400 | additional terms that apply to those files, or a notice indicating
401 | where to find the applicable terms.
402 |
403 | Additional terms, permissive or non-permissive, may be stated in the
404 | form of a separately written license, or stated as exceptions;
405 | the above requirements apply either way.
406 |
407 | 8. Termination.
408 |
409 | You may not propagate or modify a covered work except as expressly
410 | provided under this License. Any attempt otherwise to propagate or
411 | modify it is void, and will automatically terminate your rights under
412 | this License (including any patent licenses granted under the third
413 | paragraph of section 11).
414 |
415 | However, if you cease all violation of this License, then your
416 | license from a particular copyright holder is reinstated (a)
417 | provisionally, unless and until the copyright holder explicitly and
418 | finally terminates your license, and (b) permanently, if the copyright
419 | holder fails to notify you of the violation by some reasonable means
420 | prior to 60 days after the cessation.
421 |
422 | Moreover, your license from a particular copyright holder is
423 | reinstated permanently if the copyright holder notifies you of the
424 | violation by some reasonable means, this is the first time you have
425 | received notice of violation of this License (for any work) from that
426 | copyright holder, and you cure the violation prior to 30 days after
427 | your receipt of the notice.
428 |
429 | Termination of your rights under this section does not terminate the
430 | licenses of parties who have received copies or rights from you under
431 | this License. If your rights have been terminated and not permanently
432 | reinstated, you do not qualify to receive new licenses for the same
433 | material under section 10.
434 |
435 | 9. Acceptance Not Required for Having Copies.
436 |
437 | You are not required to accept this License in order to receive or
438 | run a copy of the Program. Ancillary propagation of a covered work
439 | occurring solely as a consequence of using peer-to-peer transmission
440 | to receive a copy likewise does not require acceptance. However,
441 | nothing other than this License grants you permission to propagate or
442 | modify any covered work. These actions infringe copyright if you do
443 | not accept this License. Therefore, by modifying or propagating a
444 | covered work, you indicate your acceptance of this License to do so.
445 |
446 | 10. Automatic Licensing of Downstream Recipients.
447 |
448 | Each time you convey a covered work, the recipient automatically
449 | receives a license from the original licensors, to run, modify and
450 | propagate that work, subject to this License. You are not responsible
451 | for enforcing compliance by third parties with this License.
452 |
453 | An "entity transaction" is a transaction transferring control of an
454 | organization, or substantially all assets of one, or subdividing an
455 | organization, or merging organizations. If propagation of a covered
456 | work results from an entity transaction, each party to that
457 | transaction who receives a copy of the work also receives whatever
458 | licenses to the work the party's predecessor in interest had or could
459 | give under the previous paragraph, plus a right to possession of the
460 | Corresponding Source of the work from the predecessor in interest, if
461 | the predecessor has it or can get it with reasonable efforts.
462 |
463 | You may not impose any further restrictions on the exercise of the
464 | rights granted or affirmed under this License. For example, you may
465 | not impose a license fee, royalty, or other charge for exercise of
466 | rights granted under this License, and you may not initiate litigation
467 | (including a cross-claim or counterclaim in a lawsuit) alleging that
468 | any patent claim is infringed by making, using, selling, offering for
469 | sale, or importing the Program or any portion of it.
470 |
471 | 11. Patents.
472 |
473 | A "contributor" is a copyright holder who authorizes use under this
474 | License of the Program or a work on which the Program is based. The
475 | work thus licensed is called the contributor's "contributor version".
476 |
477 | A contributor's "essential patent claims" are all patent claims
478 | owned or controlled by the contributor, whether already acquired or
479 | hereafter acquired, that would be infringed by some manner, permitted
480 | by this License, of making, using, or selling its contributor version,
481 | but do not include claims that would be infringed only as a
482 | consequence of further modification of the contributor version. For
483 | purposes of this definition, "control" includes the right to grant
484 | patent sublicenses in a manner consistent with the requirements of
485 | this License.
486 |
487 | Each contributor grants you a non-exclusive, worldwide, royalty-free
488 | patent license under the contributor's essential patent claims, to
489 | make, use, sell, offer for sale, import and otherwise run, modify and
490 | propagate the contents of its contributor version.
491 |
492 | In the following three paragraphs, a "patent license" is any express
493 | agreement or commitment, however denominated, not to enforce a patent
494 | (such as an express permission to practice a patent or covenant not to
495 | sue for patent infringement). To "grant" such a patent license to a
496 | party means to make such an agreement or commitment not to enforce a
497 | patent against the party.
498 |
499 | If you convey a covered work, knowingly relying on a patent license,
500 | and the Corresponding Source of the work is not available for anyone
501 | to copy, free of charge and under the terms of this License, through a
502 | publicly available network server or other readily accessible means,
503 | then you must either (1) cause the Corresponding Source to be so
504 | available, or (2) arrange to deprive yourself of the benefit of the
505 | patent license for this particular work, or (3) arrange, in a manner
506 | consistent with the requirements of this License, to extend the patent
507 | license to downstream recipients. "Knowingly relying" means you have
508 | actual knowledge that, but for the patent license, your conveying the
509 | covered work in a country, or your recipient's use of the covered work
510 | in a country, would infringe one or more identifiable patents in that
511 | country that you have reason to believe are valid.
512 |
513 | If, pursuant to or in connection with a single transaction or
514 | arrangement, you convey, or propagate by procuring conveyance of, a
515 | covered work, and grant a patent license to some of the parties
516 | receiving the covered work authorizing them to use, propagate, modify
517 | or convey a specific copy of the covered work, then the patent license
518 | you grant is automatically extended to all recipients of the covered
519 | work and works based on it.
520 |
521 | A patent license is "discriminatory" if it does not include within
522 | the scope of its coverage, prohibits the exercise of, or is
523 | conditioned on the non-exercise of one or more of the rights that are
524 | specifically granted under this License. You may not convey a covered
525 | work if you are a party to an arrangement with a third party that is
526 | in the business of distributing software, under which you make payment
527 | to the third party based on the extent of your activity of conveying
528 | the work, and under which the third party grants, to any of the
529 | parties who would receive the covered work from you, a discriminatory
530 | patent license (a) in connection with copies of the covered work
531 | conveyed by you (or copies made from those copies), or (b) primarily
532 | for and in connection with specific products or compilations that
533 | contain the covered work, unless you entered into that arrangement,
534 | or that patent license was granted, prior to 28 March 2007.
535 |
536 | Nothing in this License shall be construed as excluding or limiting
537 | any implied license or other defenses to infringement that may
538 | otherwise be available to you under applicable patent law.
539 |
540 | 12. No Surrender of Others' Freedom.
541 |
542 | If conditions are imposed on you (whether by court order, agreement or
543 | otherwise) that contradict the conditions of this License, they do not
544 | excuse you from the conditions of this License. If you cannot convey a
545 | covered work so as to satisfy simultaneously your obligations under this
546 | License and any other pertinent obligations, then as a consequence you may
547 | not convey it at all. For example, if you agree to terms that obligate you
548 | to collect a royalty for further conveying from those to whom you convey
549 | the Program, the only way you could satisfy both those terms and this
550 | License would be to refrain entirely from conveying the Program.
551 |
552 | 13. Use with the GNU Affero General Public License.
553 |
554 | Notwithstanding any other provision of this License, you have
555 | permission to link or combine any covered work with a work licensed
556 | under version 3 of the GNU Affero General Public License into a single
557 | combined work, and to convey the resulting work. The terms of this
558 | License will continue to apply to the part which is the covered work,
559 | but the special requirements of the GNU Affero General Public License,
560 | section 13, concerning interaction through a network will apply to the
561 | combination as such.
562 |
563 | 14. Revised Versions of this License.
564 |
565 | The Free Software Foundation may publish revised and/or new versions of
566 | the GNU General Public License from time to time. Such new versions will
567 | be similar in spirit to the present version, but may differ in detail to
568 | address new problems or concerns.
569 |
570 | Each version is given a distinguishing version number. If the
571 | Program specifies that a certain numbered version of the GNU General
572 | Public License "or any later version" applies to it, you have the
573 | option of following the terms and conditions either of that numbered
574 | version or of any later version published by the Free Software
575 | Foundation. If the Program does not specify a version number of the
576 | GNU General Public License, you may choose any version ever published
577 | by the Free Software Foundation.
578 |
579 | If the Program specifies that a proxy can decide which future
580 | versions of the GNU General Public License can be used, that proxy's
581 | public statement of acceptance of a version permanently authorizes you
582 | to choose that version for the Program.
583 |
584 | Later license versions may give you additional or different
585 | permissions. However, no additional obligations are imposed on any
586 | author or copyright holder as a result of your choosing to follow a
587 | later version.
588 |
589 | 15. Disclaimer of Warranty.
590 |
591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
599 |
600 | 16. Limitation of Liability.
601 |
602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
610 | SUCH DAMAGES.
611 |
612 | 17. Interpretation of Sections 15 and 16.
613 |
614 | If the disclaimer of warranty and limitation of liability provided
615 | above cannot be given local legal effect according to their terms,
616 | reviewing courts shall apply local law that most closely approximates
617 | an absolute waiver of all civil liability in connection with the
618 | Program, unless a warranty or assumption of liability accompanies a
619 | copy of the Program in return for a fee.
620 |
621 | END OF TERMS AND CONDITIONS
622 |
623 | How to Apply These Terms to Your New Programs
624 |
625 | If you develop a new program, and you want it to be of the greatest
626 | possible use to the public, the best way to achieve this is to make it
627 | free software which everyone can redistribute and change under these terms.
628 |
629 | To do so, attach the following notices to the program. It is safest
630 | to attach them to the start of each source file to most effectively
631 | state the exclusion of warranty; and each file should have at least
632 | the "copyright" line and a pointer to where the full notice is found.
633 |
634 |
635 | Copyright (C)
636 |
637 | This program is free software: you can redistribute it and/or modify
638 | it under the terms of the GNU General Public License as published by
639 | the Free Software Foundation, either version 3 of the License, or
640 | (at your option) any later version.
641 |
642 | This program is distributed in the hope that it will be useful,
643 | but WITHOUT ANY WARRANTY; without even the implied warranty of
644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
645 | GNU General Public License for more details.
646 |
647 | You should have received a copy of the GNU General Public License
648 | along with this program. If not, see .
649 |
650 | Also add information on how to contact you by electronic and paper mail.
651 |
652 | If the program does terminal interaction, make it output a short
653 | notice like this when it starts in an interactive mode:
654 |
655 | Copyright (C)
656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
657 | This is free software, and you are welcome to redistribute it
658 | under certain conditions; type `show c' for details.
659 |
660 | The hypothetical commands `show w' and `show c' should show the appropriate
661 | parts of the General Public License. Of course, your program's commands
662 | might be different; for a GUI interface, you would use an "about box".
663 |
664 | You should also get your employer (if you work as a programmer) or school,
665 | if any, to sign a "copyright disclaimer" for the program, if necessary.
666 | For more information on this, and how to apply and follow the GNU GPL, see
667 | .
668 |
669 | The GNU General Public License does not permit incorporating your program
670 | into proprietary programs. If your program is a subroutine library, you
671 | may consider it more useful to permit linking proprietary applications with
672 | the library. If this is what you want to do, use the GNU Lesser General
673 | Public License instead of this License. But first, please read
674 | .
675 |
676 |
--------------------------------------------------------------------------------