mirror of
https://github.com/josdejong/mathjs.git
synced 2025-12-08 19:46:04 +00:00
* Add `.js` extension to source file imports * Specify package `exports` in `package.json` Specify package type as `commonjs` (It's good to be specific) * Move all compiled scripts into `lib` directory Remove ./number.js (You can use the compiled ones in `./lib/*`) Tell node that the `esm` directory is type `module` and enable tree shaking. Remove unused files from packages `files` property * Allow importing of package.json * Make library ESM first * - Fix merge conflicts - Refactor `bundleAny` into `defaultInstance.js` and `browserBundle.cjs` - Refactor unit tests to be able to run with plain nodejs (no transpiling) - Fix browser examples * Fix browser and browserstack tests * Fix running unit tests on Node 10 (which has no support for modules) * Fix node.js examples (those are still commonjs) * Remove the need for `browserBundle.cjs` * Generate minified bundle only * [Security] Bump node-fetch from 2.6.0 to 2.6.1 (#1963) Bumps [node-fetch](https://github.com/bitinn/node-fetch) from 2.6.0 to 2.6.1. **This update includes a security fix.** - [Release notes](https://github.com/bitinn/node-fetch/releases) - [Changelog](https://github.com/node-fetch/node-fetch/blob/master/docs/CHANGELOG.md) - [Commits](https://github.com/bitinn/node-fetch/compare/v2.6.0...v2.6.1) Signed-off-by: dependabot-preview[bot] <support@dependabot.com> Co-authored-by: dependabot-preview[bot] <27856297+dependabot-preview[bot]@users.noreply.github.com> * Cleanup console.log * Add integration tests to test the entry points (commonjs/esm, full/number only) * Create backward compatibility error messages in the files moved/removed since v8 * Describe breaking changes in HISTORY.md * Bump karma from 5.2.1 to 5.2.2 (#1965) Bumps [karma](https://github.com/karma-runner/karma) from 5.2.1 to 5.2.2. - [Release notes](https://github.com/karma-runner/karma/releases) - [Changelog](https://github.com/karma-runner/karma/blob/master/CHANGELOG.md) - [Commits](https://github.com/karma-runner/karma/compare/v5.2.1...v5.2.2) Signed-off-by: dependabot-preview[bot] <support@dependabot.com> Co-authored-by: dependabot-preview[bot] <27856297+dependabot-preview[bot]@users.noreply.github.com> Co-authored-by: Lee Langley-Rees <lee@greenimp.co.uk> Co-authored-by: dependabot-preview[bot] <27856297+dependabot-preview[bot]@users.noreply.github.com>
114 lines
4.0 KiB
JavaScript
114 lines
4.0 KiB
JavaScript
import assert from 'assert'
|
|
import math from '../../../src/defaultInstance.js'
|
|
import { getAssociativity, getPrecedence, isAssociativeWith } from '../../../src/expression/operators.js'
|
|
const OperatorNode = math.OperatorNode
|
|
const AssignmentNode = math.AssignmentNode
|
|
const SymbolNode = math.SymbolNode
|
|
const ConstantNode = math.ConstantNode
|
|
const Node = math.Node
|
|
const ParenthesisNode = math.ParenthesisNode
|
|
|
|
describe('operators', function () {
|
|
it('should return the precedence of a node', function () {
|
|
const a = new ConstantNode(1)
|
|
const b = new ConstantNode(2)
|
|
|
|
const n1 = new AssignmentNode(new SymbolNode('a'), a)
|
|
const n2 = new OperatorNode('or', 'or', [a, b])
|
|
|
|
assert.strictEqual(getPrecedence(n1, 'keep'), 0)
|
|
assert.strictEqual(getPrecedence(n2, 'keep'), 2)
|
|
})
|
|
|
|
it('should return null if precedence is not defined for a node', function () {
|
|
const n = new Node()
|
|
|
|
assert.strictEqual(getPrecedence(n, 'keep'), null)
|
|
})
|
|
|
|
it('should return the precedence of a ParenthesisNode', function () {
|
|
const c = new ConstantNode(1)
|
|
|
|
const op = new OperatorNode('or', 'or', [c, c])
|
|
|
|
const p = new ParenthesisNode(op)
|
|
|
|
assert.strictEqual(getPrecedence(p, 'all'), getPrecedence(op, 'all'))
|
|
assert.strictEqual(getPrecedence(p, 'auto'), getPrecedence(op, 'all'))
|
|
assert.strictEqual(getPrecedence(p, 'keep'), null)
|
|
})
|
|
|
|
it('should return the associativity of a node', function () {
|
|
const a = new ConstantNode(1)
|
|
|
|
const n1 = new OperatorNode('+', 'add', [a, a])
|
|
const n2 = new OperatorNode('^', 'pow', [a, a])
|
|
const n3 = new OperatorNode('-', 'unaryMinus', [a])
|
|
const n4 = new OperatorNode('!', 'factorial', [a])
|
|
|
|
assert.strictEqual(getAssociativity(n1, 'keep'), 'left')
|
|
assert.strictEqual(getAssociativity(n2, 'keep'), 'right')
|
|
assert.strictEqual(getAssociativity(n3, 'keep'), 'right')
|
|
assert.strictEqual(getAssociativity(n4, 'keep'), 'left')
|
|
})
|
|
|
|
it('should return the associativity of a ParenthesisNode', function () {
|
|
const c = new ConstantNode(1)
|
|
|
|
const op = new OperatorNode('or', 'or', [c, c])
|
|
|
|
const p = new ParenthesisNode(op)
|
|
|
|
assert.strictEqual(getAssociativity(p, 'all'), getAssociativity(op, 'keep'))
|
|
assert.strictEqual(getAssociativity(p, 'auto'), getAssociativity(op, 'keep'))
|
|
assert.strictEqual(getAssociativity(p, 'keep'), null)
|
|
})
|
|
|
|
it('should return null if associativity is not defined for a node', function () {
|
|
const a = new ConstantNode(1)
|
|
|
|
const n1 = new Node()
|
|
const n2 = new AssignmentNode(new SymbolNode('a'), a)
|
|
|
|
assert.strictEqual(getAssociativity(n1, 'keep'), null)
|
|
assert.strictEqual(getAssociativity(n2, 'keep'), null)
|
|
})
|
|
|
|
it('should return if a Node is associative with another Node', function () {
|
|
const a = new ConstantNode(1)
|
|
|
|
const n1 = new OperatorNode('+', 'add', [a, a])
|
|
const n2 = new OperatorNode('-', 'subtract', [a, a])
|
|
|
|
assert.strictEqual(isAssociativeWith(n1, n1, 'keep'), true)
|
|
assert.strictEqual(isAssociativeWith(n1, n2, 'keep'), true)
|
|
assert.strictEqual(isAssociativeWith(n2, n2, 'keep'), false)
|
|
assert.strictEqual(isAssociativeWith(n2, n1, 'keep'), false)
|
|
})
|
|
|
|
it('should return null if the associativity between two Nodes is not defined', function () {
|
|
const a = new ConstantNode(1)
|
|
|
|
const n1 = new Node()
|
|
const n2 = new AssignmentNode(new SymbolNode('a'), a)
|
|
|
|
assert.strictEqual(isAssociativeWith(n1, n1, 'keep'), null)
|
|
assert.strictEqual(isAssociativeWith(n1, n2, 'keep'), null)
|
|
assert.strictEqual(isAssociativeWith(n2, n2, 'keep'), null)
|
|
assert.strictEqual(isAssociativeWith(n2, n1, 'keep'), null)
|
|
})
|
|
|
|
it('should return if a ParenthesisNode is associative with another Node', function () {
|
|
const a = new ConstantNode(1)
|
|
|
|
const add = new OperatorNode('+', 'add', [a, a])
|
|
const sub = new OperatorNode('-', 'subtract', [a, a])
|
|
|
|
const p = new ParenthesisNode(add)
|
|
|
|
assert.strictEqual(isAssociativeWith(p, sub, 'all'), true)
|
|
assert.strictEqual(isAssociativeWith(p, sub, 'auto'), true)
|
|
assert.strictEqual(isAssociativeWith(p, sub, 'keep'), null)
|
|
})
|
|
})
|