mirror of
https://github.com/josdejong/mathjs.git
synced 2025-12-08 19:46:04 +00:00
* refactor: Remove the automatic conversion from number to string. (#2482) This is a breaking change. However, nothing in the unit tests or examples actually depended on such a conversion, and it's difficult to construct situations in which it's necessary. The best such example is e.g. `count(57)` which formerly gave the number of digits in its numeric argument. Of course, after this commit, that behavior can still be obtained by the just slightly longer expression `count(string(57))` The change is proposed in preparation for an addition of new facilities/ handlers to allow symbolic computation in a couple of different ways (see #2475 and #2470). * feat(simplifyCore): convert equivalent function calls into operators (#2466) * feat(simplifyCore): convert equivalent function calls into operators Resolves #2415. * docs: Every operator has a function form Also documents the new behavior of simplifyCore to convert function calls into any equivalent operator form they may have. Also fixes the syntax errors so that simplifyCore will successfully doctest. * docs: Fix table syntax for operator->function correspondence * fix(parse): Implement amended "Rule 2" As per the discussion in #2370, the amended "Rule 2" is "when having a division followed by an implicit multiplication, the division gets higher precedence over the implicit multiplication when (a) the numerator is a constant with optionally a prefix operator (-, +, ~), and (b) the denominator is a constant." This commit implements that behavior and adds tests for it. Resolves #2370. * fix: OperatorNode.toString() outputs match implicit multiplication parsing Also greatly extends the tests on OperatorNode.toString() and .toTex(), and ensures that all tests are performed on both. (toHTML() is still a testing stepchild.) Also fixes other small bugs in .toString() and .toTex() revealed by the new tests. Resolves #1431. * test(parse): More cases of implicit multiplication * refactor: Alter the precedence of implicit multiplication This greatly simplifies OperatorNode:calculateNecessaryParentheses, as opposed to trying to correct for the change in precedence after the fact. * Fix broken unit test * Replace `options && options.implicit` with `options?.implicit` * Replace `options?.implicit` with `options && options.implicit` again, it breaks the Node 12 tests * chore: Prevent confusion with standard matrix functions. (#2465) * chore: Prevent consfusion with standard matrix functions. Prior to this commit, many functions operated elementwise on matrices even though in standard mathematical usage they have a different meaning on square matrices. Since the elementwise operation is easily recoverable using `math.map`, this commit removes the elementwise operation on arrays and matrices from these functions. Affected functions include all trigonometric functions, exp, log, gamma, square, sqrt, cube, and cbrt. Resolves #2440. * chore(typescript): Revise usages in light of changes sqrt() is now correctly typed as `number | Complex` and so must be explicitly cast to number when called on a positive and used where a Complex is disallowed; sqrt() no longer applies to matrices at all. * feat: Provide better error messages for v10 -> v11 transition Uses new `typed.onMismatch` handler so that matrix calls that used to work will suggest a replacement. * Fix #2412: let function diff return an empty matrix when the input contains only one element (#2422) * Fix #2412: let function diff return an empty matrix when the input has only one element * Undo changes in History in this fixme * Add TypeScript definitions for src/utils/is.js (#2432) This is a first step toward full publication of these functions, that were already being exported by mathjs but had not yet had the associated actions (documentation/available in parser/typed, etc.) Also, makes most of them into TypeScript type guards, and adds Matrix as a constructor type. Resolved #2431. Co-authored-by: Glen Whitney <glen@studioinfinity.org> * test: add two-dimensional test cases for diff of length 1 Co-authored-by: Chris Chudzicki <christopher.chudzicki@gmail.com> Co-authored-by: Glen Whitney <glen@studioinfinity.org> * Refactor/simplify core cleanup (#2490) * refactor: don't simplify constants in simplifyCore Keeps the operation of simplifyCore cleanly separate from simplifyConstant. * fix; handle multiple consecutive operations in simplifyCore() Also adds support for logical operators. Resolves #2484. * feat: export simplifyConstant Now that simplifyCore does not do any constant folding, clients may wish to access that behavior via simplifyConstant. Moreover, exporting it makes it easier to use in custom rule lists for simplify(). Also adds docs, embedded docs, and tests for simplifyConstant(). Also fixes simplifyCore() on logical functions (they always return boolean, rather than "short-circuiting"). Resolves #2459. * refactor: Rename matrix algorithms to stay sane in next refactor * refactor: Create a generator for boilerplate matrix versions of operations This reduces code length and duplication, and significantly reduces the number of instances of 'this' that will require replacement when moving on top of typed-function v3. * refactor: add automatic conversion from string to Node Eliminates many `this` calls in src/function/algebra, which will help conversion to typed-function v3a. Also make `resolve` into a typed function so that it will now work on strings as well, and adds a test that it does. * refactor: Use temporary conversions to simplify typed-function definitions Specifically, temporarily converting Object to Map eases the definition of 'simplify' and a new, generally ignored type 'identifier' (a subtype of 'string') with a temporary conversion to 'SymbolNode' simplifies the definition of 'derivative'. These refactors eliminate multiple instances of this, which will ease conversion to typed-function v3a. * refactor: Speed up utils/is.js typeOf function In preparation for using it as the function selector for the Unit class. Also fixes the inconsistency between the `typed` type hierarchy 'function' and typeOf returning 'Function' in favor of 'function', again to minimize the special cases in typeOf * feat(Unit): Add a method giving the (string name of the) type of the value E.g. `math.unit('5cm').valType()` returns `number`. Also uses this for an internal method that directly gives the number converter for a Unit. Also fixes lint errors from previous commit (not clean, I know, I forgot that build-and-test does not run lint). Adds tests for unit.valType() * refactor: Eliminate hyperbolic functions operating on angles There is no mathematical meaning to a hyperbolic function operating on an angle (the proper units of its argument is actually area), and it eliminates a number of uses of `this`, so remove such arguments. * refactor: Remove miscellaneous unnecessary typed-function this refs * refactor: Adapt to typed-function v3a Mostly this involves replaceing instances of 'this' with used of (preferably) typed.referTo() or typed.referToSelf(). Some repeated batterns of boilerpolate signatures within different divisions of functions (bitwise, relational, trigonometry) were factored out into their own files and reused in several of the individual functions. * tests: Only require that derivative tests mention the proper node type * refactor: remove typed.ignore * chore: Update to typed-function 3.0 Also had to deal with new typing for `resolve()` in that it now accepts strings and Matrices; added tests for the new possibilities for `resolve()`, and eliminated empty comments from the Node representation of parsed strings as they can't really be doing anyone any good and they are a pain for testing. Also updates the TypeScript declarations and tests for `resolve()` * chore: Object.hasOwn not supported in Node 14 Also removes 'resolve' from the known failing doc tests, now that it handles strings. * chore: Drop ES5 / IE 11 support. * fix(types): Remove no-longer-implementd matrix overloads * test(identifier): As requested in review item 2 * refactor(Unit): valType => valueType as per review item 3 * test(hasNumericValue): Test boolean arguments as per review item 4 * refactor(Node): Use class syntax rather than assigning prototypes This change simplifies the typeOf() function, because now all subclasses of Node have the expected constructor name. Also, reformats the documentation of the typeOf() function so that the doc test of that function will serve as an exhaustive test that the bundle returns the proper types. * Prevent chain functions from matching stored value with a rest parameter (#2559) * chore: Prevent confusion with standard matrix functions. (#2465) * chore: Prevent consfusion with standard matrix functions. Prior to this commit, many functions operated elementwise on matrices even though in standard mathematical usage they have a different meaning on square matrices. Since the elementwise operation is easily recoverable using `math.map`, this commit removes the elementwise operation on arrays and matrices from these functions. Affected functions include all trigonometric functions, exp, log, gamma, square, sqrt, cube, and cbrt. Resolves #2440. * chore(typescript): Revise usages in light of changes sqrt() is now correctly typed as `number | Complex` and so must be explicitly cast to number when called on a positive and used where a Complex is disallowed; sqrt() no longer applies to matrices at all. * feat: Provide better error messages for v10 -> v11 transition Uses new `typed.onMismatch` handler so that matrix calls that used to work will suggest a replacement. * fix: prevent chain from matching rest parameter with stored value Since the revised code needs the isTypedFunction predicate, switch to using the typed-function implementation for that throughout mathjs, rather than rolling our own here. Also adds a test that chain() no longer allows this kind of usage. Removes the two type declarations in types/index.d.ts that were allowing this sort of "split rest" call and added tests that such calls are forbidden. Adds to the chaining documentation page that such "split" calls are not allowed. * chore: Refresh this PR to reflect underlying changes Also addresses the review request with a detailed comment on the correctness of a new code section. Note that it reverts some changes to the TypeScript signatures of the matrix functions ones() and zeros() -- they do not actually have a typed-function signature of two numbers and an optional format specifically for two dimensions. What they have is a single rest parameter, from which the format is extracted if present. Hence, due to the ban on breaking rest parameters, it is not valid to call math.chain(3).zeros(2) to make a 3-by-2 matrix of zeros, which seems like a perfectly valid ban as the division of the dimensions is very confusing; this should be written as math.chain([3,2]).zeros(). The TypeScript signatures are fixed accordingly, along with the edge case of no arguments to ones() and zeros() at all, which does work to produce the "empty matrix". * Unit test `typeOf` on the minified bundle (currently failing) * Update AUTHORS * Improve testing of typeOf on browser bundle (WIP) * fix #2621: Module "mathjs" has no exported member "count" .ts(2305) (#2622) * fix #2621: Module "mathjs" has no exported member "count" .ts(2305) * feat: Update comments of count * feat: update the signature for count * feat: add usage example for count and sum * chore: Ensure type info remains in bundling Co-authored-by: Glen Whitney <glen@studioinfinity.org> Co-authored-by: Chris Chudzicki <christopher.chudzicki@gmail.com> Co-authored-by: Hansuku <1556207795@qq.com>
669 lines
23 KiB
JavaScript
669 lines
23 KiB
JavaScript
// test FunctionNode
|
|
import assert from 'assert'
|
|
|
|
import math from '../../../../src/defaultInstance.js'
|
|
import { toObject } from '../../../../src/utils/map.js'
|
|
const Node = math.Node
|
|
const ConstantNode = math.ConstantNode
|
|
const SymbolNode = math.SymbolNode
|
|
const FunctionNode = math.FunctionNode
|
|
const OperatorNode = math.OperatorNode
|
|
const RangeNode = math.RangeNode
|
|
const IndexNode = math.IndexNode
|
|
const AccessorNode = math.AccessorNode
|
|
const FunctionAssignmentNode = math.FunctionAssignmentNode
|
|
|
|
describe('FunctionNode', function () {
|
|
it('should create a FunctionNode', function () {
|
|
const c = new ConstantNode(4)
|
|
const n = new FunctionNode(new SymbolNode('sqrt'), [c])
|
|
assert(n instanceof FunctionNode)
|
|
assert(n instanceof Node)
|
|
assert.strictEqual(n.type, 'FunctionNode')
|
|
})
|
|
|
|
it('should have isFunctionNode', function () {
|
|
const c = new ConstantNode(1)
|
|
const node = new FunctionNode(new SymbolNode('square'), [c])
|
|
assert(node.isFunctionNode)
|
|
})
|
|
|
|
it('should throw an error when calling without new operator', function () {
|
|
const s = new SymbolNode('sqrt')
|
|
const c = new ConstantNode(4)
|
|
assert.throws(function () { FunctionNode(s, [c]) }, TypeError)
|
|
})
|
|
|
|
it('should throw an error when calling with wrong arguments', function () {
|
|
const s = new SymbolNode('sqrt')
|
|
const c = new ConstantNode(4)
|
|
assert.throws(function () { console.log(new FunctionNode(new Date(), [])) }, TypeError)
|
|
assert.throws(function () { console.log(new FunctionNode(s, [2, 3])) }, TypeError)
|
|
assert.throws(function () { console.log(new FunctionNode(s, [c, 3])) }, TypeError)
|
|
})
|
|
|
|
it('should get the name of a FunctionNode', function () {
|
|
const n1 = new FunctionNode(new SymbolNode('sqrt'), [new ConstantNode(4)])
|
|
assert.strictEqual(n1.name, 'sqrt')
|
|
|
|
const n = new AccessorNode(new SymbolNode('a'), new IndexNode([new ConstantNode('toString')]))
|
|
const n2 = new FunctionNode(n, [new ConstantNode(4)])
|
|
assert.strictEqual(n2.name, 'toString')
|
|
|
|
const n3 = new FunctionNode(new OperatorNode('+', 'add', []), [new ConstantNode(4)])
|
|
assert.strictEqual(n3.name, '')
|
|
})
|
|
|
|
it('should throw an error when evaluating an undefined function', function () {
|
|
const scope = {}
|
|
const s = new FunctionNode('foo', [])
|
|
assert.throws(function () { s.compile().evaluate(scope) }, /Error: Undefined function foo/)
|
|
})
|
|
|
|
it('should compile a FunctionNode', function () {
|
|
const s = new SymbolNode('sqrt')
|
|
const c = new ConstantNode(4)
|
|
const n = new FunctionNode(s, [c])
|
|
|
|
const scope = {}
|
|
assert.strictEqual(n.compile().evaluate(scope), 2)
|
|
})
|
|
|
|
it('should compile a FunctionNode containing an index', function () {
|
|
const s = new SymbolNode('foo')
|
|
const range = [new ConstantNode('bar')]
|
|
const i = new IndexNode(range)
|
|
const a = new AccessorNode(s, i)
|
|
const c = new ConstantNode(4)
|
|
const n = new FunctionNode(a, [c])
|
|
|
|
const scope = {
|
|
foo: {
|
|
bar: function (x) {
|
|
return x * x
|
|
}
|
|
}
|
|
}
|
|
assert.strictEqual(n.compile().evaluate(scope), 16)
|
|
})
|
|
|
|
it('should execute a FunctionNode with the right context', function () {
|
|
const s = new SymbolNode('foo')
|
|
const i = new IndexNode([new ConstantNode('getCount')])
|
|
const a = new AccessorNode(s, i)
|
|
const c = new ConstantNode(4)
|
|
const n = new FunctionNode(a, [c])
|
|
|
|
const scope = {
|
|
foo: {
|
|
count: 42,
|
|
getCount: function () {
|
|
return this.count
|
|
}
|
|
}
|
|
}
|
|
assert.strictEqual(n.compile().evaluate(scope), 42)
|
|
})
|
|
|
|
it('should compile a FunctionNode with a raw function', function () {
|
|
const mymath = math.create()
|
|
function myFunction (args, _math, _scope) {
|
|
assert.strictEqual(args.length, 2)
|
|
assert(args[0] instanceof mymath.Node)
|
|
assert(args[1] instanceof mymath.Node)
|
|
assert.deepStrictEqual(toObject(_scope), scope)
|
|
return 'myFunction(' + args.join(', ') + ')'
|
|
}
|
|
myFunction.rawArgs = true
|
|
mymath.import({ myFunction })
|
|
|
|
const s = new SymbolNode('myFunction')
|
|
const a = new mymath.ConstantNode(4)
|
|
const b = new mymath.ConstantNode(5)
|
|
const n = new mymath.FunctionNode(s, [a, b])
|
|
|
|
const scope = {
|
|
foo: 'bar'
|
|
}
|
|
assert.strictEqual(n.compile().evaluate(scope), 'myFunction(4, 5)')
|
|
})
|
|
|
|
it('should compile a FunctionNode containing an index resolving to a function with rawArgs', function () {
|
|
const scope = {
|
|
obj: {}
|
|
}
|
|
|
|
const mymath = math.create()
|
|
function myFunction (args, _math, _scope) {
|
|
assert.strictEqual(args.length, 2)
|
|
assert(args[0] instanceof mymath.Node)
|
|
assert(args[1] instanceof mymath.Node)
|
|
assert.deepStrictEqual(toObject(_scope), scope)
|
|
return 'myFunction(' + args.join(', ') + ')'
|
|
}
|
|
myFunction.rawArgs = true
|
|
|
|
const obj = new SymbolNode('obj')
|
|
const prop = new ConstantNode('myFunction')
|
|
const i = new IndexNode([prop])
|
|
const a = new AccessorNode(obj, i)
|
|
const b = new mymath.ConstantNode(4)
|
|
const c = new mymath.ConstantNode(5)
|
|
const n = new mymath.FunctionNode(a, [b, c])
|
|
|
|
scope.obj.myFunction = myFunction
|
|
|
|
assert.strictEqual(n.compile().evaluate(scope), 'myFunction(4, 5)')
|
|
})
|
|
|
|
it('should compile a FunctionNode with overloaded a raw function', function () {
|
|
const mymath = math.create()
|
|
function myFunction (args, _math, _scope) {
|
|
assert.ok(false, 'should not be executed')
|
|
}
|
|
myFunction.rawArgs = true
|
|
mymath.import({ myFunction })
|
|
|
|
const s = new mymath.SymbolNode('myFunction')
|
|
const a = new mymath.ConstantNode(4)
|
|
const b = new mymath.ConstantNode(5)
|
|
const n = new mymath.FunctionNode(s, [a, b])
|
|
|
|
const scope = {
|
|
myFunction: function () {
|
|
return 42
|
|
}
|
|
}
|
|
assert.strictEqual(n.compile().evaluate(scope), 42)
|
|
})
|
|
|
|
it('should filter a FunctionNode', function () {
|
|
const s = new SymbolNode('a')
|
|
const b = new ConstantNode(2)
|
|
const c = new ConstantNode(1)
|
|
const n = new FunctionNode(s, [b, c])
|
|
|
|
assert.deepStrictEqual(n.filter(function (node) { return node instanceof FunctionNode }), [n])
|
|
assert.deepStrictEqual(n.filter(function (node) { return node instanceof RangeNode }), [])
|
|
assert.deepStrictEqual(n.filter(function (node) { return node instanceof ConstantNode }), [b, c])
|
|
assert.deepStrictEqual(n.filter(function (node) { return node instanceof ConstantNode && node.value === 2 }), [b])
|
|
assert.deepStrictEqual(n.filter(function (node) { return node instanceof ConstantNode && node.value === 4 }), [])
|
|
})
|
|
|
|
it('should run forEach on a FunctionNode', function () {
|
|
// multiply(x + 2, x)
|
|
const s = new SymbolNode('multiply')
|
|
const a = new SymbolNode('x')
|
|
const b = new ConstantNode(2)
|
|
const c = new OperatorNode('+', 'add', [a, b])
|
|
const d = new SymbolNode('x')
|
|
const f = new FunctionNode(s, [c, d])
|
|
|
|
const nodes = []
|
|
const paths = []
|
|
f.forEach(function (node, path, parent) {
|
|
nodes.push(node)
|
|
paths.push(path)
|
|
assert.strictEqual(parent, f)
|
|
})
|
|
|
|
assert.strictEqual(nodes.length, 3)
|
|
assert.strictEqual(nodes[0], s)
|
|
assert.strictEqual(nodes[1], c)
|
|
assert.strictEqual(nodes[2], d)
|
|
assert.deepStrictEqual(paths, ['fn', 'args[0]', 'args[1]'])
|
|
})
|
|
|
|
it('should map a FunctionNode', function () {
|
|
// multiply(x + 2, x)
|
|
const s = new SymbolNode('multiply')
|
|
const a = new SymbolNode('x')
|
|
const b = new ConstantNode(2)
|
|
const c = new OperatorNode('+', 'add', [a, b])
|
|
const d = new SymbolNode('x')
|
|
const f = new FunctionNode(s, [c, d])
|
|
|
|
const nodes = []
|
|
const paths = []
|
|
const g = new ConstantNode(3)
|
|
const h = f.map(function (node, path, parent) {
|
|
nodes.push(node)
|
|
paths.push(path)
|
|
assert.strictEqual(parent, f)
|
|
|
|
return node instanceof SymbolNode && node.name === 'x' ? g : node
|
|
})
|
|
|
|
assert.strictEqual(nodes.length, 3)
|
|
assert.strictEqual(nodes[0], s)
|
|
assert.strictEqual(nodes[1], c)
|
|
assert.strictEqual(nodes[2], d)
|
|
assert.deepStrictEqual(paths, ['fn', 'args[0]', 'args[1]'])
|
|
|
|
assert.notStrictEqual(h, f)
|
|
assert.strictEqual(h.fn.name, 'multiply')
|
|
assert.strictEqual(h.args[0], c)
|
|
assert.strictEqual(h.args[0].args[0], a)
|
|
assert.strictEqual(h.args[0].args[1], b)
|
|
assert.strictEqual(h.args[1], g)
|
|
})
|
|
|
|
it('should throw an error when the map callback does not return a node', function () {
|
|
const s = new SymbolNode('factorial')
|
|
const b = new ConstantNode(2)
|
|
const f = new FunctionNode(s, [b])
|
|
|
|
assert.throws(function () {
|
|
f.map(function () { return undefined })
|
|
}, /Callback function must return a Node/)
|
|
})
|
|
|
|
it('should transform a FunctionNodes (nested) parameters', function () {
|
|
// multiply(x + 2, x)
|
|
const s = new SymbolNode('multiply')
|
|
const a = new SymbolNode('x')
|
|
const b = new ConstantNode(2)
|
|
const c = new OperatorNode('+', 'add', [a, b])
|
|
const d = new SymbolNode('x')
|
|
const f = new FunctionNode(s, [c, d])
|
|
|
|
const g = new ConstantNode(3)
|
|
const h = f.transform(function (node) {
|
|
return node instanceof SymbolNode && node.name === 'x' ? g : node
|
|
})
|
|
|
|
assert.notStrictEqual(h, f)
|
|
assert.deepStrictEqual(h.args[0].args[0], g)
|
|
assert.deepStrictEqual(h.args[0].args[1], b)
|
|
assert.deepStrictEqual(h.name, 'multiply')
|
|
assert.deepStrictEqual(h.args[1], g)
|
|
})
|
|
|
|
it('should transform a FunctionNodes name', function () {
|
|
// add(2, 3)
|
|
const s = new SymbolNode('add')
|
|
const b = new ConstantNode(2)
|
|
const c = new ConstantNode(3)
|
|
const d = new FunctionNode(s, [b, c])
|
|
|
|
const f = d.transform(function (node) {
|
|
if (node instanceof FunctionNode) {
|
|
node.fn = new SymbolNode('subtract')
|
|
}
|
|
return node
|
|
})
|
|
|
|
assert.notStrictEqual(f, d)
|
|
assert.deepStrictEqual(f.name, 'subtract')
|
|
})
|
|
|
|
it('should transform a FunctionNode itself', function () {
|
|
// add(2, 3)
|
|
const s = new SymbolNode('add')
|
|
const b = new ConstantNode(2)
|
|
const c = new ConstantNode(3)
|
|
const d = new FunctionNode(s, [b, c])
|
|
|
|
const e = new ConstantNode(5)
|
|
const f = d.transform(function (node) {
|
|
return node instanceof FunctionNode ? e : node
|
|
})
|
|
|
|
assert.deepStrictEqual(f, e)
|
|
})
|
|
|
|
it('should traverse a FunctionNode', function () {
|
|
// add(2, 3)
|
|
const s = new SymbolNode('add')
|
|
const b = new ConstantNode(2)
|
|
const c = new ConstantNode(3)
|
|
const d = new FunctionNode(s, [b, c])
|
|
|
|
let count = 0
|
|
d.traverse(function (node, path, parent) {
|
|
count++
|
|
|
|
switch (count) {
|
|
case 1:
|
|
assert.strictEqual(node, d)
|
|
assert.strictEqual(path, null)
|
|
assert.strictEqual(parent, null)
|
|
break
|
|
|
|
case 2:
|
|
assert.strictEqual(node, s)
|
|
assert.strictEqual(path, 'fn')
|
|
assert.strictEqual(parent, d)
|
|
break
|
|
|
|
case 3:
|
|
assert.strictEqual(node, b)
|
|
assert.strictEqual(path, 'args[0]')
|
|
assert.strictEqual(parent, d)
|
|
break
|
|
|
|
case 4:
|
|
assert.strictEqual(node, c)
|
|
assert.strictEqual(path, 'args[1]')
|
|
assert.strictEqual(parent, d)
|
|
break
|
|
}
|
|
})
|
|
|
|
assert.strictEqual(count, 4)
|
|
})
|
|
|
|
it('should clone a FunctionNode', function () {
|
|
// add(2, 3)
|
|
const s = new SymbolNode('add')
|
|
const b = new ConstantNode(2)
|
|
const c = new ConstantNode(3)
|
|
const d = new FunctionNode(s, [b, c])
|
|
|
|
const e = d.clone()
|
|
assert(e instanceof FunctionNode)
|
|
assert.deepStrictEqual(e, d)
|
|
assert.notStrictEqual(e, d)
|
|
assert.strictEqual(e.name, d.name)
|
|
assert.notStrictEqual(e.args, d.args)
|
|
assert.strictEqual(e.args[0], d.args[0])
|
|
assert.strictEqual(e.args[1], d.args[1])
|
|
})
|
|
|
|
it('test equality another Node', function () {
|
|
const a = new FunctionNode(new SymbolNode('add'), [new ConstantNode(2), new ConstantNode(3)])
|
|
const b = new FunctionNode(new SymbolNode('add'), [new ConstantNode(2), new ConstantNode(3)])
|
|
const c = new FunctionNode(new SymbolNode('subtract'), [new ConstantNode(2), new ConstantNode(3)])
|
|
const d = new FunctionNode(new SymbolNode('add'), [new ConstantNode(4), new ConstantNode(3)])
|
|
const e = new SymbolNode('add')
|
|
|
|
assert.strictEqual(a.equals(null), false)
|
|
assert.strictEqual(a.equals(undefined), false)
|
|
assert.strictEqual(a.equals(b), true)
|
|
assert.strictEqual(a.equals(c), false)
|
|
assert.strictEqual(a.equals(d), false)
|
|
assert.strictEqual(a.equals(e), false)
|
|
})
|
|
|
|
it('should stringify a FunctionNode', function () {
|
|
const s = new SymbolNode('sqrt')
|
|
const c = new ConstantNode(4)
|
|
const n = new FunctionNode(s, [c])
|
|
|
|
assert.strictEqual(n.toString(), 'sqrt(4)')
|
|
})
|
|
|
|
it('should stringify a FunctionNode with an immediately invoked function assignment', function () {
|
|
const f = new FunctionAssignmentNode('f', ['x'], new SymbolNode('x')) // f(x) = x
|
|
const c = new ConstantNode(4)
|
|
const n = new FunctionNode(f, [c])
|
|
|
|
assert.strictEqual(n.toString(), '(f(x) = x)(4)')
|
|
})
|
|
|
|
it('should pass options when stringifying a FunctionNode', function () {
|
|
const s = new SymbolNode('sqrt')
|
|
const a = new ConstantNode(2)
|
|
const b = new SymbolNode('x')
|
|
const c = new OperatorNode('*', 'multiply', [a, b], true) // implicit
|
|
const n = new FunctionNode(s, [c])
|
|
|
|
assert.strictEqual(n.toString(), 'sqrt(2 x)')
|
|
const options = { implicit: 'show' }
|
|
assert.strictEqual(n.toString(options), 'sqrt(2 * x)')
|
|
})
|
|
|
|
it('should stringify a FunctionNode with custom toString', function () {
|
|
// Also checks if the custom functions get passed on to the children
|
|
const customFunction = function (node, options) {
|
|
if (node.type === 'FunctionNode') {
|
|
let string = '[' + node.name + ']('
|
|
node.args.forEach(function (arg) {
|
|
string += arg.toString(options) + ', '
|
|
})
|
|
string += ')'
|
|
return string
|
|
} else if (node.type === 'ConstantNode') {
|
|
return 'const(' + node.value + ', ' + math.typeOf(node.value) + ')'
|
|
}
|
|
}
|
|
|
|
const a = new ConstantNode(1)
|
|
const b = new ConstantNode(2)
|
|
|
|
const n1 = new FunctionNode(new SymbolNode('add'), [a, b])
|
|
const n2 = new FunctionNode(new SymbolNode('subtract'), [a, b])
|
|
|
|
assert.strictEqual(n1.toString({ handler: customFunction }), '[add](const(1, number), const(2, number), )')
|
|
assert.strictEqual(n2.toString({ handler: customFunction }), '[subtract](const(1, number), const(2, number), )')
|
|
})
|
|
|
|
it('should stringify a FunctionNode with custom toString for a single function', function () {
|
|
// Also checks if the custom functions get passed on to the children
|
|
const customFunction = {
|
|
add: function (node, options) {
|
|
return node.args[0].toString(options) +
|
|
' ' + node.name + ' ' +
|
|
node.args[1].toString(options)
|
|
}
|
|
}
|
|
|
|
const s = new SymbolNode('add')
|
|
const a = new ConstantNode(1)
|
|
const b = new ConstantNode(2)
|
|
const n = new FunctionNode(s, [a, b])
|
|
|
|
assert.strictEqual(n.toString({ handler: customFunction }), '1 add 2')
|
|
})
|
|
|
|
it('toJSON and fromJSON', function () {
|
|
const a = new SymbolNode('add')
|
|
const b = new ConstantNode(2)
|
|
const c = new ConstantNode(4)
|
|
const node = new FunctionNode(a, [b, c])
|
|
|
|
const json = node.toJSON()
|
|
|
|
assert.deepStrictEqual(json, {
|
|
mathjs: 'FunctionNode',
|
|
fn: a,
|
|
args: [b, c]
|
|
})
|
|
|
|
const parsed = FunctionNode.fromJSON(json)
|
|
assert.deepStrictEqual(parsed, node)
|
|
})
|
|
|
|
it('should LaTeX a FunctionNode', function () {
|
|
const s = new SymbolNode('sqrt')
|
|
const c1 = new ConstantNode(4)
|
|
const c2 = new ConstantNode(5)
|
|
const n = new FunctionNode(s, [c1])
|
|
assert.strictEqual(n.toTex(), '\\sqrt{4}')
|
|
|
|
// test permutations
|
|
const n2 = new FunctionNode(new SymbolNode('permutations'), [c1])
|
|
assert.strictEqual(n2.toTex(), '\\mathrm{permutations}\\left(4\\right)')
|
|
|
|
const o = new OperatorNode('+', 'add', [c1, c2])
|
|
const n3 = new FunctionNode(new SymbolNode('permutations'), [o])
|
|
assert.strictEqual(n3.toTex(), '\\mathrm{permutations}\\left(4+5\\right)')
|
|
})
|
|
|
|
it('should have an identifier', function () {
|
|
const s = new SymbolNode('factorial')
|
|
const a = new ConstantNode(2)
|
|
const n = new FunctionNode(s, [a])
|
|
|
|
assert.strictEqual(n.getIdentifier(), 'FunctionNode:factorial')
|
|
})
|
|
|
|
it('should LaTeX a FunctionNode with custom toTex', function () {
|
|
// Also checks if the custom functions get passed on to the children
|
|
const customFunction = function (node, options) {
|
|
if (node.type === 'FunctionNode') {
|
|
let latex = '\\mbox{' + node.name + '}\\left('
|
|
node.args.forEach(function (arg) {
|
|
latex += arg.toTex(options) + ', '
|
|
})
|
|
latex += '\\right)'
|
|
return latex
|
|
} else if (node.type === 'ConstantNode') {
|
|
return 'const\\left(' + node.value + ', ' + math.typeOf(node.value) + '\\right)'
|
|
}
|
|
}
|
|
|
|
const a = new ConstantNode(1)
|
|
const b = new ConstantNode(2)
|
|
|
|
const n1 = new FunctionNode(new SymbolNode('add'), [a, b])
|
|
const n2 = new FunctionNode(new SymbolNode('subtract'), [a, b])
|
|
|
|
assert.strictEqual(n1.toTex({ handler: customFunction }), '\\mbox{add}\\left(const\\left(1, number\\right), const\\left(2, number\\right), \\right)')
|
|
assert.strictEqual(n2.toTex({ handler: customFunction }), '\\mbox{subtract}\\left(const\\left(1, number\\right), const\\left(2, number\\right), \\right)')
|
|
})
|
|
|
|
it('should LaTeX a FunctionNode with custom toTex for a single function', function () {
|
|
// Also checks if the custom functions get passed on to the children
|
|
const customFunction = {
|
|
add: function (node, options) {
|
|
return node.args[0].toTex(options) +
|
|
' ' + node.name + ' ' +
|
|
node.args[1].toTex(options)
|
|
}
|
|
}
|
|
|
|
const s = new SymbolNode('add')
|
|
const a = new ConstantNode(1)
|
|
const b = new ConstantNode(2)
|
|
const n = new FunctionNode(s, [a, b])
|
|
|
|
assert.strictEqual(n.toTex({ handler: customFunction }), '1 add 2')
|
|
})
|
|
|
|
it('should LaTeX a FunctionNode with callback attached to the function', function () {
|
|
const customMath = math.create()
|
|
customMath.add.toTex = function (node, options) {
|
|
return node.args[0].toTex(options) + ' plus ' + node.args[1].toTex(options)
|
|
}
|
|
|
|
assert.strictEqual(customMath.parse('add(1,2)').toTex(), '1 plus 2')
|
|
})
|
|
|
|
it('should LaTeX a FunctionNode with template string attached to the function', function () {
|
|
const customMath = math.create()
|
|
customMath.add.toTex = '${args[0]} plus ${args[1]}' /* eslint-disable-line no-template-curly-in-string */
|
|
|
|
assert.strictEqual(customMath.parse('add(1,2)').toTex(), '1 plus 2')
|
|
})
|
|
|
|
it('should LaTeX a FunctionNode with object of callbacks attached to the function', function () {
|
|
const customMath = math.create()
|
|
customMath.sum.toTex = {
|
|
2: '${args[0]}+${args[1]}', /* eslint-disable-line no-template-curly-in-string */
|
|
3: function (node, options) {
|
|
return node.args[0] + '+' + node.args[1] + '+' + node.args[2]
|
|
}
|
|
}
|
|
|
|
assert.strictEqual(customMath.parse('sum(1,2)').toTex(), '1+2')
|
|
assert.strictEqual(customMath.parse('sum(1,2,3)').toTex(), '1+2+3')
|
|
})
|
|
|
|
it('should LaTeX templates with string properties', function () {
|
|
const customMath = math.create()
|
|
customMath.add.toTex = '${name}' /* eslint-disable-line no-template-curly-in-string */
|
|
|
|
assert.strictEqual(customMath.parse('add(1,2)').toTex(), 'add')
|
|
})
|
|
|
|
it('should LaTeX templates with node properties', function () {
|
|
const customMath = math.create()
|
|
customMath.add.toTex = '${args[0]} plus ${args[1]}' /* eslint-disable-line no-template-curly-in-string */
|
|
|
|
assert.strictEqual(customMath.parse('add(1,2)').toTex(), '1 plus 2')
|
|
})
|
|
|
|
it('should LaTeX templates with properties that are arrays of Nodes', function () {
|
|
const customMath = math.create()
|
|
customMath.add.toTex = '${args}' /* eslint-disable-line no-template-curly-in-string */
|
|
|
|
assert.strictEqual(customMath.parse('add(1,2)').toTex(), '1,2')
|
|
})
|
|
|
|
it('should throw an Error for templates with properties that don\'t exist', function () {
|
|
const customMath = math.create()
|
|
customMath.add.toTex = '${some_property}' /* eslint-disable-line no-template-curly-in-string */
|
|
|
|
assert.throws(function () { customMath.parse('add(1,2)').toTex() }, ReferenceError)
|
|
})
|
|
|
|
it('should throw an Error for templates with properties that aren\'t Nodes or Strings or Arrays of Nodes', function () {
|
|
const customMath = math.create()
|
|
customMath.add.toTex = '${some_property}' /* eslint-disable-line no-template-curly-in-string */
|
|
const tree = customMath.parse('add(1,2)')
|
|
|
|
tree.some_property = {}
|
|
assert.throws(function () { tree.toTex() }, TypeError)
|
|
|
|
customMath.add.prototype.some_property = 1
|
|
tree.some_property = 1
|
|
assert.throws(function () { tree.toTex() }, TypeError)
|
|
})
|
|
|
|
it('should throw an Error for templates with properties that are arrays of non Nodes', function () {
|
|
const customMath = math.create()
|
|
customMath.add.toTex = '${some_property}' /* eslint-disable-line no-template-curly-in-string */
|
|
const tree = customMath.parse('add(1,2)')
|
|
tree.some_property = [1, 2]
|
|
|
|
assert.throws(function () { tree.toTex() }, TypeError)
|
|
})
|
|
|
|
it('evaluates different sorts of function calls', function () {
|
|
const examples = [
|
|
['1; square(3)', 9],
|
|
['f(x) = x*x; f(3)', 9],
|
|
['a={n:7, f: lambda(x) = x*x}; a.f(3)', 9],
|
|
['a=[7, f(x)=x*x]; a[2](3)', 9],
|
|
['twiceOn(f,x) = f(f(x)); twiceOn(square, 3)', 81],
|
|
['twice(f) = lambda(x) = f(f(x)); fourth = twice(square); fourth(3)', 81],
|
|
['twice(f) = lambda(x) = f(f(x)); [twice(square)][1](3)', 81]
|
|
]
|
|
for (const example of examples) {
|
|
const answer = math.evaluate(example[0]).valueOf()[0]
|
|
assert.strictEqual(answer, example[1])
|
|
}
|
|
})
|
|
|
|
it('produces clear error messages when the callee is not a function', function () {
|
|
const throwers = [
|
|
['tau(3)', TypeError, /tau.*value[\s\S]*6.28/],
|
|
['f = 7; f(3)', TypeError, /f.*value[\s\S]*7/],
|
|
['a={f: 7}; a.f(3)', Error, /method.*f/],
|
|
['a=[1,2]; a[2](3)', TypeError, /a\[2\].*value[\s\S]*2/],
|
|
['twiceOn(f, x) = f(f(x)); twiceOn(7, 3)',
|
|
TypeError,
|
|
/f.*received[\s\S]*7/],
|
|
['twice(f) = lambda(x) = f(f(x)); weird = twice(7); weird(3)',
|
|
TypeError,
|
|
/f.*received[\s\S]*7/],
|
|
['twice(f) = lambda(x) = f(f(x)); [twice(7)][1](3)',
|
|
TypeError,
|
|
/f.*received[\s\S]*7/],
|
|
['[square(7)][1](3)', TypeError, /square\(7\).*evaluate[\s\S]*49/]
|
|
]
|
|
for (const problem of throwers) {
|
|
assert.throws(() => math.evaluate(problem[0]), problem[1])
|
|
assert.throws(() => math.evaluate(problem[0]), problem[2])
|
|
}
|
|
})
|
|
|
|
// FIXME: custom instances should have there own function, not return the same function?
|
|
after(function () {
|
|
const customMath = math.create()
|
|
delete customMath.add.toTex
|
|
delete customMath.sum.toTex
|
|
})
|
|
})
|