mathjs/lib/expression/node/RangeNode.js
Max Bruckner 2959858b99 operators: Use config when calculating precedence etc.
Use the parenthesis configuration to decide wether ParenthesisNodes
should be skipped or not.
2015-05-07 10:13:43 +02:00

145 lines
4.2 KiB
JavaScript

'use strict';
var operators = require('../operators');
function factory (type, config, load, typed) {
var Node = load(require('./Node'));
/**
* @constructor RangeNode
* @extends {Node}
* create a range
* @param {Node} start included lower-bound
* @param {Node} end included lower-bound
* @param {Node} [step] optional step
*/
function RangeNode(start, end, step) {
if (!(this instanceof RangeNode)) {
throw new SyntaxError('Constructor must be called with the new operator');
}
// validate inputs
if (!(start && start.isNode)) throw new TypeError('Node expected');
if (!(end && end.isNode)) throw new TypeError('Node expected');
if (step && !(step && step.isNode)) throw new TypeError('Node expected');
if (arguments.length > 3) throw new Error('Too many arguments');
this.start = start; // included lower-bound
this.end = end; // included upper-bound
this.step = step || null; // optional step
}
RangeNode.prototype = new Node();
RangeNode.prototype.type = 'RangeNode';
RangeNode.prototype.isRangeNode = true;
/**
* Compile the node to javascript code
* @param {Object} defs Object which can be used to define functions
* or constants globally available for the compiled
* expression
* @return {String} js
* @private
*/
RangeNode.prototype._compile = function (defs) {
return 'math.range(' +
this.start._compile(defs) + ', ' +
this.end._compile(defs) +
(this.step ? (', ' + this.step._compile(defs)) : '') +
')';
};
/**
* Execute a callback for each of the child nodes of this node
* @param {function(child: Node, path: string, parent: Node)} callback
*/
RangeNode.prototype.forEach = function (callback) {
callback(this.start, 'start', this);
callback(this.end, 'end', this);
if (this.step) {
callback(this.step, 'step', this);
}
};
/**
* Create a new RangeNode having it's childs be the results of calling
* the provided callback function for each of the childs of the original node.
* @param {function(child: Node, path: string, parent: Node): Node} callback
* @returns {RangeNode} Returns a transformed copy of the node
*/
RangeNode.prototype.map = function (callback) {
return new RangeNode(
this._ifNode(callback(this.start, 'start', this)),
this._ifNode(callback(this.end, 'end', this)),
this.step && this._ifNode(callback(this.step, 'step', this))
);
};
/**
* Create a clone of this node, a shallow copy
* @return {RangeNode}
*/
RangeNode.prototype.clone = function () {
return new RangeNode(this.start, this.end, this.step && this.step);
};
/**
* Get string representation
* @return {String} str
*/
RangeNode.prototype._toString = function () {
var precedence = operators.getPrecedence(this, config);
//format string as start:step:stop
var str;
var start = this.start.toString();
var startPrecedence = operators.getPrecedence(this.start, config);
if ((startPrecedence !== null) && (startPrecedence <= precedence)) {
start = '(' + start + ')';
}
str = start;
if (this.step) {
var step = this.step.toString();
var stepPrecedence = operators.getPrecedence(this.step, config);
if ((stepPrecedence !== null) && (stepPrecedence <= precedence)) {
step = '(' + step + ')';
}
str += ':' + step;
}
var end = this.end.toString();
var endPrecedence = operators.getPrecedence(this.end, config);
if ((endPrecedence !== null) && (endPrecedence <= precedence)) {
end = '(' + end + ')';
}
str += ':' + end;
return str;
};
/**
* Get LaTeX representation
* @params {Object|function} callback(s)
* @return {String} str
*/
RangeNode.prototype._toTex = function (callbacks) {
var str = this.start.toTex(callbacks);
if (this.step) {
str += ':' + this.step.toTex(callbacks);
}
str += ':' + this.end.toTex(callbacks);
return str;
};
return RangeNode;
}
exports.name = 'RangeNode';
exports.path = 'expression.node';
exports.factory = factory;