document.js
Version:
General purpose ODM supporting memory and mongo database adapters
1,877 lines (1,511 loc) • 129 kB
JavaScript
/*!
* document.js (c) 2015 Brian Norton
* This library may be freely distributed under the MIT license.
*/
(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.model = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){
require('progenitor.js')();
var noop = function(c) { c && c(); };
Adapter = Object.progeny('Adapter', {
init: function(modelClass) {
this.modelClass = modelClass;
}
}, {
classMethods: {
connect: noop,
clear: noop,
disconnect: noop
}
});
module.exports = Adapter;
},{"progenitor.js":19}],2:[function(require,module,exports){
require('progenitor.js')();
var noop = function() {};
Count = Object.progeny('Count', {
init: function(relation) {
this.relation = relation;
this.count = null;
this.loaded = false;
this.RSVP = { success: noop, error: noop };
},
kept: function(number) {
this.count = isNumber(number) ? number : null;
this.loaded = true;
makeRSVPCallback.call(this);
},
then: function(success, error) {
this.RSVP.success = success || noop;
this.RSVP.error = error || noop;
makeRSVPCallback.call(this);
}
});
function isNumber(n) {
return !isNaN(parseFloat(n)) && isFinite(n);
}
function makeRSVPCallback() {
if(this.loaded) {
if(this.count === null) this.RSVP.error.call(this);
else this.RSVP.success.call(this, this.count);
}
}
module.exports = Count;
},{"progenitor.js":19}],3:[function(require,module,exports){
require('progenitor.js')();
var extend = require('extend'),
inflect = require('i')(),
adapterCache = { },
noop = function() { };
Document = Object.progeny('Document', {
init: function(options, relation) {
this._data = {};
this._changes = {};
assignOptions.call(this, options);
this.relation = relation;
this.RSVP = { success: noop, error: noop };
this.loaded = false;
},
isValid: function() {
var i, name, valid = true,
validate = this.class.validate || {},
presence = validate.presence || [],
format = validate.format || {},
formatNames = Object.keys(format),
custom = validate.custom || [];
for(i=0; i<presence.length; ++i) {
if(! this.get(presence[i])) {
valid = false; break;
}
}
if(!valid) return false;
for(i=0; i<formatNames.length; ++i) {
name = formatNames[i];
if(!format[name].test(this.get(name))) {
valid = false; break;
}
}
for(i=0; i<custom.length; ++i) {
if(!custom[i].call(this)) {
valid = false; break;
}
}
return valid;
},
get: function(name) {
if(name == 'id') return this.id;
if(this.class.belongsTo.indexOf(name) >= 0) {
var id = this.get(inflect.foreign_key(name));
return id && Document[inflect.classify(name)].find(id);
} else if(this.class.namedFields[name]) {
return (name in this._data) ? this._data[name] : null;
} else if(typeof this[name] === 'function') {
return this[name].call(this);
}
},
set: function() { var name, from, to, options = arguments[0],
keyValue = arguments.length == 2, result = {};
if(!arguments[0]) return;
if(keyValue) { options = {};
options[arguments[0]] = arguments[1];
}
for(name in options) {
var belongsTo = this.class.belongsTo.indexOf(name) >= 0;
if(belongsTo) {
var key = inflect.foreign_key(name);
options[key] = options[name].id;
name = key;
}
if(belongsTo || this.class.namedFields[name]) {
to = typeof options[name] === 'undefined' ? null : options[name];
if((from = this.get(name)) != to) {
this._changes[name] = [from, to];
}
if(name === '_id')
this.id = to;
this._data[name] = result[name] = to;
}
}
return (keyValue ? result[arguments[0]] : result);
},
changedAttributes: function() {
return extend({}, this._changes);
},
save: function() {
var that = this,
changedAttrs = {},
notValid = !this.isValid(),
noChanges = !Object.keys(this.changedAttributes()).length;
if(notValid || (noChanges && this.persisted)) {
this.loaded = true;
return this;
}
this.loaded = false;
this.relation = new Document.Relation(this.class, this);
if(this.persisted) {
Object.keys(this._changes).forEach(function(key) {
changedAttrs[key] = that.get(key);
});
return this.relation.update(changedAttrs);
} else {
(this.class.beforeCreate || []).forEach(function(fn) { fn.call(that); });
return this.relation.create(extend({}, this._data));
}
},
update: function() {
this.set.apply(this, arguments);
return this.save();
},
destroy: function() { var that = this;
this.loaded = false;
this.class.adapter().remove({_id: this.id}, function(value) {
that.loaded = true;
that.kept(that.isDestroyed = !!value);
});
return this;
},
kept: function(options) {
this.set(options);
this.loaded = true;
if(this.RSVP.wasKept = !!options) {
this._changes = {};
this.persisted = true;
this.RSVP.success(this);
} else {
this.RSVP.error();
}
},
then: function(success, error) {
this.RSVP.success = success || noop;
this.RSVP.error = error || noop;
if(this.loaded) {
if(this.RSVP.wasKept) {
this.RSVP.success(this);
} else {
this.RSVP.error();
}
}
},
asJSON: function() {
var name, json = {
id: this.id.toString(),
createdAt: this.get('createdAt'),
updatedAt: this.get('updatedAt')
}, allow = this.class.allow || [];
for(var i = 0; i < allow.length; ++i) {
name = allow[i];
if(/(.+)_id$/.test(name)) {
var value = this.get(name),
shortName = name.slice(0,-3);
value = value ? value.toString() : value;
json[shortName] || (json[shortName] = { id: value });
} else {
value = this.get(name);
value = typeof (value && value.asJSON) === 'function' ? value.asJSON() : value;
}
json[name] = value;
}
return json;
}
}, {
classMethods: {
namedFields: null,
shortFields: null,
defaultFields: {
ObjectID: { _id: '_id' },
Date: { createdAt: 'cT', updatedAt: 'uT' }
},
adapter: function() {
return adapterCache[this.className] || (adapterCache[this.className] = new Document.Adapter(this));
},
inherited: function(base) { var fields;
this[base.className] = base;
base.fields || (base.fields = {});
base.belongsTo || (base.belongsTo = []);
base.fields.ObjectID = extend({}, this.defaultFields.ObjectID, base.fields.ObjectID);
base.fields.Date = extend({}, this.defaultFields.Date, base.fields.Date);
base.namedFields = {}; base.shortFields = {};
base.belongsTo.forEach(function(name) {
base.fields.ObjectID[inflect.foreign_key(name)] = name.slice(0,1)+'_id';
});
for(var type in base.fields) {
for(var attr in (fields = base.fields[type])) {
base.namedFields[attr] = fields[attr];
base.shortFields[fields[attr]] = attr;
}
}
},
find: function(id) { var model;
if(id && (typeof id == 'string' || id._bsontype === 'ObjectID')) {
this.loaded = false;
id = Document.Adapter.ids.isValid(id) ? Document.Adapter.ids.next(id) : id;
var relation = new Document.Relation(this, model = new this({_id: id}));
return (model.relation = relation).find();
} else {
return new Document.Relation(this).find(id);
}
},
count: function() { return new Document.Relation(this).count() },
first: function() { return adapterDirection.call(this, 'first') },
last: function() { return adapterDirection.call(this, 'last') },
shortToLong: function(opts) { return _translateFields.call(this, this.shortFields, opts); },
longToShort: function(opts) { return _translateFields.call(this, this.namedFields, opts); }
}
});
function assignOptions(options) {
var id = options.id || options._id;
this.persisted = false;
if(id) {
if(Document.Adapter.ids.isValid(id)) {
this.id = Document.Adapter.ids.next(id);
} else if(id._bsontype === 'ObjectID') {
this.id = id;
} else {
this.id = id.toString();
}
} else if(id === null) {
this.id = null;
} else {
this.id = Document.Adapter.ids.next();
}
this.set(extend({_id: this.id }, optionsWithout(options, ['id', '_id'])));
this._changes = {};
}
function adapterDirection(name) { // implements .first and .last
var model = new this({_id: null});
this.adapter()[name].call(this.adapter(), function(options) {
options = model.class.shortToLong(options);
model.kept(options);
});
return model;
}
function optionsWithout(options, items) {
var other = {};
for(var o in options) {
if(items.indexOf(o) == -1) {
other[o] = options[o];
}
}
return other;
}
function _translateFields(fields, opts) {
if(!opts || typeof opts !== 'object')
return opts;
var options = {};
Object.keys(opts).forEach(function(key) {
options[fields[key] || key] = opts[key];
});
return options;
}
extend(Document, {
Relation: require('./relation'),
Count: require('./count')
});
module.exports = function(options) {
options = (options || {});
options.store || (options.store = 'memory');
if('memory mongo'.split(' ').indexOf(options.store) == -1) {
throw new Error('Only the `memory` and `mongo` stores are available.');
}
require('./memory_adapter'); require('./mongo_adapter');
Document.Adapter = require('./'+options.store+'_adapter');
return Document;
};
},{"./count":2,"./memory_adapter":4,"./mongo_adapter":5,"./relation":6,"extend":12,"i":14,"progenitor.js":19}],4:[function(require,module,exports){
var noop = function() {},
adapters = [],
extend = require('extend'),
base62 = require('base-62.js'),
Adapter = require('./adapter');
MemoryAdapter = Adapter.progeny('MemoryAdapter', {
init: function() {
this._data = [];
}, create: function(options, callback) {
this._data.push(options);
adapters.push(this);
callback(options);
}, update: function(options, updates, callback) {
var count = 0;
this.where(options, function(items) {
count = items.length;
items.forEach(function(item) {
extend(item, updates);
});
callback(count || null);
});
}, count: function(callback) {
callback(this._data.length);
}, first: function(callback) {
callback(this._data[0] || null);
}, last: function(callback) {
callback(this._data[this._data.length-1] || null);
}, where: function(options, callback) {
if(!options) { // TODO test this at the adapter level
callback && callback(null);
return;
}
var keys = Object.keys(options);
if(!keys.length) {
callback(this.all());
}
callback(this._data.filter(function(model) {
var matches = true;
keys.forEach(function(k) {
if(Array.isArray(model[k])) {
if(model[k].indexOf(options[k]) == -1)
matches = false;
} else if(model[k] != options[k])
matches = false;
});
return matches;
}));
}, all: function() {
return this._data.slice();
},
remove: function(options, callback) {
this._data = this._data.filter(function(model) {
return model._id !== options._id;
});
callback(true);
}, clear: function(callback) {
this._data = [];
callback(true);
}
}, {
classMethods: {
clear: function() {
adapters.forEach(function(adapter) {
adapter.clear(noop);
});
},
ids: {
isValid: function(id) { return !!id; },
next: function(id) { return id || base62.token(); }
}
}
});
module.exports = MemoryAdapter;
},{"./adapter":1,"base-62.js":7,"extend":12}],5:[function(require,module,exports){
(function (process){
var fs = require('fs'),
inflect = require('i')(),
objectID = function() { return require('mongodb').ObjectID },
Adapter = require('./adapter');
MongoAdapter = Adapter.progeny('MongoAdapter', {
collection: function() {
if(this._collection) return this._collection;
var connection = this.class.connection;
if(!connection) throw new Error('MongoDB not connected');
return (this._collection = connection.collection(inflect.tableize(this.modelClass.className)));
},
create: function(options, callback) {
this.collection().insertOne(options, function(err, info) {
callback(err ? null : options);
});
},
update: function(options, updates, callback) {
var done = function(err, doc) {
callback(err ? null : doc);
};
if(options._id) {
this.collection().updateOne(options, { $set: updates }, done);
} else {
this.collection().updateMany(options, { $set: updates }, done);
}
},
count: function(callback) {
this.collection().count(function(err, count) {
callback(err ? null : count);
});
},
first: function(callback) {
this.collection().find({}).limit(1).sort({_id: 1}).toArray(function(err, docs) {
callback(err ? null : (docs[0] || null));
});
},
last: function(callback) {
this.collection().find({}).limit(1).sort({_id: -1}).toArray(function(err, docs) {
callback(err ? null : (docs[0] || null));
});
},
where: function(options, callback) {
if(!options) { // TODO test this at the adapter level
callback && callback(null);
return;
}
this.collection().find(options).toArray(function(err, docs) {
callback(err ? null : docs);
});
},
remove: function(options, callback) {
this.collection().deleteMany(options, function(err, info) {
callback(err ? null : options);
});
},
clear: function(callback) {
this.collection().remove({}, callback);
}
}, {
classMethods: {
connection: null,
connect: function(callback) {
var that = this,
url = JSON.parse(fs.readFileSync(process.cwd()+'/config/mongo.json'))[process.env.NODE_ENV];
require('mongodb').MongoClient.connect(url, function(error, database) {
if(error) { console.warn('Error connecting to MongoDB error: ', error, '<---'); throw new Error('DB connect error', error); }
that.connection = database;
callback();
});
},
disconnect: function(callback) {
this.connection.close(); callback();
},
ids: {
isValid: function(id) {
return objectID().isValid(id);
}, next: function(id) {
return objectID()(id);
}
}
}
});
module.exports = MongoAdapter;
}).call(this,require('_process'))
},{"./adapter":1,"_process":11,"fs":10,"i":14,"mongodb":undefined}],6:[function(require,module,exports){
RelationError = Error.progeny('RelationError', { init: function(m) { this.name = this.className; this.message = m; } });
var extend = require('extend'),
noop = function() {};
Relation = Object.progeny('Relation', {
init: function(modelClass, model) {
this.modelClass = modelClass;
model ? (this.model = model) : (this._query = {});
this.loaded = false;
this.items = null;
this.size = null;
this.RSVP = { success: noop, error: noop, wasKept: false };
},
kept: function(value) {
this.loaded = true;
this.RSVP.wasKept = value;
this.items = this.size = null;
if(Array.isArray(value)) {
this.items = value;
} else if(isNumber(value)) {
this.size = value;
}
makeRSVPCallback.call(this);
},
then: function(success, error) {
this.RSVP.success = success || noop;
this.RSVP.error = error || noop;
makeRSVPCallback.call(this);
},
query: function() {
return this._query ? extend({}, this._query) : null;
},
count: function() { var that = this;
var count = new Document.Count(this);
this.modelClass.adapter().count(function(result) {
that.loaded = true;
count.kept(result);
});
return count;
},
find: function(options) { var that = this;
this.loaded = false;
if(this.model) {
this.modelClass.adapter().where({_id: this.model.id}, function(value) {
that.loaded = true;
value = Array.isArray(value) ? that.model.class.shortToLong(value[0]) : value;
that.model.kept(value);
});
return this.model;
} else {
var Model = this.modelClass;
options = Model.longToShort(options);
this.modelClass.adapter().where(options, function(value) {
if(Array.isArray(value)) {
value = value.map(function(options) {
var model = new Model({_id: null});
model.kept(Model.shortToLong(options));
return model;
});
}
that.kept(value);
});
return this;
}
},
asJSON: function() {
if(this.items) {
return this.items.map(function(model) {
return model.asJSON();
});
} else if (isNumber(this.size)) {
return this.size;
}
return null;
},
create: function(options) { var that = this;
this.loaded = false;
if(!this.model) throw new RelationError('Non-model creates are not supported.');
options = extend(options, { createdAt: new Date(), updatedAt: new Date() });
options = this.modelClass.longToShort(options);
this.modelClass.adapter().create(options, function(value) {
that.loaded = true;
value = that.model.class.shortToLong(value);
that.model.kept(value);
});
return this.model;
},
update: function(options) { var that = this;
this.loaded = false;
options = extend(options, { updatedAt: new Date() });
options = this.modelClass.longToShort(options);
if(this.model) {
this.modelClass.adapter().update({_id: this.model.id}, options, function(value) {
that.loaded = true;
that.model.kept(value);
});
return this.model;
} else {
// TODO query should translate fields when the value of _query can change
this.modelClass.adapter().update(this._query, options, function(value) {
that.kept(value);
});
return this;
}
}
});
function isNumber(n) {
return !isNaN(parseFloat(n)) && isFinite(n);
}
function makeRSVPCallback() {
if(this.loaded) {
if(!this.RSVP.wasKept) this.RSVP.error.call(this);
else this.RSVP.success.call(this, this.RSVP.wasKept);
}
}
module.exports = Relation;
},{"extend":12}],7:[function(require,module,exports){
(function (global){
/*!
* base-62.js (c) 2015 Brian Norton
* This library may be freely distributed under the MIT license.
*/
(function(f){if(typeof exports==="object"&&typeof module!=="undefined"){module.exports=f()}else if(typeof define==="function"&&define.amd){define([],f)}else{var g;if(typeof window!=="undefined"){g=window}else if(typeof global!=="undefined"){g=global}else if(typeof self!=="undefined"){g=self}else{g=this}g.base62 = f()}})(function(){var define,module,exports;return (function e(t,n,r){function s(o,u){if(!n[o]){if(!t[o]){var a=typeof require=="function"&&require;if(!u&&a)return a(o,!0);if(i)return i(o,!0);var f=new Error("Cannot find module '"+o+"'");throw f.code="MODULE_NOT_FOUND",f}var l=n[o]={exports:{}};t[o][0].call(l.exports,function(e){var n=t[o][1][e];return s(n?n:e)},l,l.exports,e,t,n,r)}return n[o].exports}var i=typeof require=="function"&&require;for(var o=0;o<r.length;o++)s(r[o]);return s})({1:[function(require,module,exports){
var Big = require('big.js'),
generate = require('random.js').randomInt,
characterSet = '0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ';
var Base62 = {
encode: function(integer) { var original = integer;
integer = integer.toString();
try {
Big(integer)
} catch(e) {
console.log('Big init error on ', original, integer);
}
var bigInt = Big(integer), result = '';
if (integer == '0') { return '0'; }
while (bigInt.gt(0)) {
result = characterSet[bigInt.mod(62).toFixed()] + result;
bigInt = Big(bigInt.div(62).toFixed(2).split('.')[0]); // Math.floor() aka round down
}
return result;
},
decode: function(base62String) {
base62String = base62String.toString();
var result = Big(0), big62 = Big(62),
characters = base62String.split('').reverse();
characters.forEach(function(character, index) {
result = result.plus(big62.pow(index).times(characterSet.indexOf(character)));
});
return result.toFixed();
},
encodeHex: function(hexString) {
return Base62.encode(hexToInt(hexString.toString()))
},
decodeHex: function(base62String) {
return intToHex(Base62.decode(base62String));
},
short: function(id) {
return id ? Base62.encodeHex(id) : null;
},
id: function(short) {
return short ? Base62.decodeHex(short) : null;
},
token: function() {
return random()+random()+random()+random()+random();
}
};
function random() {
return Base62.encode(generate());
}
function intToHex(decStr) {
var hex = convertBase(decStr, 10, 16);
return hex ? hex : null;
}
function hexToInt(hexStr) {
return convertBase(hexStr.toString().toLowerCase(), 16, 10);
}
// START These methods are provided thanks to http://www.danvk.org/hex2dec.html
//
function add(x, y, base) {
var z = [];
var n = Math.max(x.length, y.length);
var carry = 0;
var i = 0;
while (i < n || carry) {
var xi = i < x.length ? x[i] : 0;
var yi = i < y.length ? y[i] : 0;
var zi = carry + xi + yi;
z.push(zi % base);
carry = Math.floor(zi / base);
i++;
}
return z;
}
function multiplyByNumber(num, x, base) {
if (num < 0) return null;
if (num == 0) return [];
var result = [];
var power = x;
while (true) {
if (num & 1) {
result = add(result, power, base);
}
num = num >> 1;
if (num === 0) break;
power = add(power, power, base);
}
return result;
}
function parseToDigitsArray(str, base) {
var digits = str.split('');
var ary = [];
for (var i = digits.length - 1; i >= 0; i--) {
var n = parseInt(digits[i], base);
if (isNaN(n)) return null;
ary.push(n);
}
return ary;
}
function convertBase(str, fromBase, toBase) {
var digits = parseToDigitsArray(str, fromBase);
if (digits === null) return null;
var outArray = [];
var power = [1];
for (var i = 0; i < digits.length; i++) {
if (digits[i]) {
outArray = add(outArray, multiplyByNumber(digits[i], power, toBase), toBase);
}
power = multiplyByNumber(fromBase, power, toBase);
}
var out = '';
for (var i = outArray.length - 1; i >= 0; i--) {
out += outArray[i].toString(toBase);
}
return out;
}
//
// END These methods are provided thanks to http://www.danvk.org/hex2dec.html
module.exports = Base62;
},{"big.js":2,"random.js":3}],2:[function(require,module,exports){
/* big.js v3.0.2 https://github.com/MikeMcl/big.js/LICENCE */
;(function (global) {
'use strict';
/*
big.js v3.0.2
A small, fast, easy-to-use library for arbitrary-precision decimal arithmetic.
https://github.com/MikeMcl/big.js/
Copyright (c) 2014 Michael Mclaughlin <M8ch88l@gmail.com>
MIT Expat Licence
*/
/***************************** EDITABLE DEFAULTS ******************************/
// The default values below must be integers within the stated ranges.
/*
* The maximum number of decimal places of the results of operations
* involving division: div and sqrt, and pow with negative exponents.
*/
var DP = 20, // 0 to MAX_DP
/*
* The rounding mode used when rounding to the above decimal places.
*
* 0 Towards zero (i.e. truncate, no rounding). (ROUND_DOWN)
* 1 To nearest neighbour. If equidistant, round up. (ROUND_HALF_UP)
* 2 To nearest neighbour. If equidistant, to even. (ROUND_HALF_EVEN)
* 3 Away from zero. (ROUND_UP)
*/
RM = 1, // 0, 1, 2 or 3
// The maximum value of DP and Big.DP.
MAX_DP = 1E6, // 0 to 1000000
// The maximum magnitude of the exponent argument to the pow method.
MAX_POWER = 1E6, // 1 to 1000000
/*
* The exponent value at and beneath which toString returns exponential
* notation.
* JavaScript's Number type: -7
* -1000000 is the minimum recommended exponent value of a Big.
*/
TO_EXP_NEG = -7, // 0 to -1000000
/*
* The exponent value at and above which toString returns exponential
* notation.
* JavaScript's Number type: 21
* 1000000 is the maximum recommended exponent value of a Big.
* (This limit is not enforced or checked.)
*/
TO_EXP_POS = 21, // 0 to 1000000
/******************************************************************************/
// The shared prototype object.
P = {},
isValid = /^-?(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i,
Big;
/*
* Create and return a Big constructor.
*
*/
function bigFactory() {
/*
* The Big constructor and exported function.
* Create and return a new instance of a Big number object.
*
* n {number|string|Big} A numeric value.
*/
function Big(n) {
var x = this;
// Enable constructor usage without new.
if (!(x instanceof Big)) {
return n === void 0 ? bigFactory() : new Big(n);
}
// Duplicate.
if (n instanceof Big) {
x.s = n.s;
x.e = n.e;
x.c = n.c.slice();
} else {
parse(x, n);
}
/*
* Retain a reference to this Big constructor, and shadow
* Big.prototype.constructor which points to Object.
*/
x.constructor = Big;
}
Big.prototype = P;
Big.DP = DP;
Big.RM = RM;
return Big;
}
// Private functions
/*
* Return a string representing the value of Big x in normal or exponential
* notation to dp fixed decimal places or significant digits.
*
* x {Big} The Big to format.
* dp {number} Integer, 0 to MAX_DP inclusive.
* toE {number} 1 (toExponential), 2 (toPrecision) or undefined (toFixed).
*/
function format(x, dp, toE) {
var Big = x.constructor,
// The index (normal notation) of the digit that may be rounded up.
i = dp - (x = new Big(x)).e,
c = x.c;
// Round?
if (c.length > ++dp) {
rnd(x, i, Big.RM);
}
if (!c[0]) {
++i;
} else if (toE) {
i = dp;
// toFixed
} else {
c = x.c;
// Recalculate i as x.e may have changed if value rounded up.
i = x.e + i + 1;
}
// Append zeros?
for (; c.length < i; c.push(0)) {
}
i = x.e;
/*
* toPrecision returns exponential notation if the number of
* significant digits specified is less than the number of digits
* necessary to represent the integer part of the value in normal
* notation.
*/
return toE === 1 || toE && (dp <= i || i <= TO_EXP_NEG) ?
// Exponential notation.
(x.s < 0 && c[0] ? '-' : '') +
(c.length > 1 ? c[0] + '.' + c.join('').slice(1) : c[0]) +
(i < 0 ? 'e' : 'e+') + i
// Normal notation.
: x.toString();
}
/*
* Parse the number or string value passed to a Big constructor.
*
* x {Big} A Big number instance.
* n {number|string} A numeric value.
*/
function parse(x, n) {
var e, i, nL;
// Minus zero?
if (n === 0 && 1 / n < 0) {
n = '-0';
// Ensure n is string and check validity.
} else if (!isValid.test(n += '')) {
throwErr(NaN);
}
// Determine sign.
x.s = n.charAt(0) == '-' ? (n = n.slice(1), -1) : 1;
// Decimal point?
if ((e = n.indexOf('.')) > -1) {
n = n.replace('.', '');
}
// Exponential form?
if ((i = n.search(/e/i)) > 0) {
// Determine exponent.
if (e < 0) {
e = i;
}
e += +n.slice(i + 1);
n = n.substring(0, i);
} else if (e < 0) {
// Integer.
e = n.length;
}
// Determine leading zeros.
for (i = 0; n.charAt(i) == '0'; i++) {
}
if (i == (nL = n.length)) {
// Zero.
x.c = [ x.e = 0 ];
} else {
// Determine trailing zeros.
for (; n.charAt(--nL) == '0';) {
}
x.e = e - i - 1;
x.c = [];
// Convert string to array of digits without leading/trailing zeros.
for (e = 0; i <= nL; x.c[e++] = +n.charAt(i++)) {
}
}
return x;
}
/*
* Round Big x to a maximum of dp decimal places using rounding mode rm.
* Called by div, sqrt and round.
*
* x {Big} The Big to round.
* dp {number} Integer, 0 to MAX_DP inclusive.
* rm {number} 0, 1, 2 or 3 (DOWN, HALF_UP, HALF_EVEN, UP)
* [more] {boolean} Whether the result of division was truncated.
*/
function rnd(x, dp, rm, more) {
var u,
xc = x.c,
i = x.e + dp + 1;
if (rm === 1) {
// xc[i] is the digit after the digit that may be rounded up.
more = xc[i] >= 5;
} else if (rm === 2) {
more = xc[i] > 5 || xc[i] == 5 &&
(more || i < 0 || xc[i + 1] !== u || xc[i - 1] & 1);
} else if (rm === 3) {
more = more || xc[i] !== u || i < 0;
} else {
more = false;
if (rm !== 0) {
throwErr('!Big.RM!');
}
}
if (i < 1 || !xc[0]) {
if (more) {
// 1, 0.1, 0.01, 0.001, 0.0001 etc.
x.e = -dp;
x.c = [1];
} else {
// Zero.
x.c = [x.e = 0];
}
} else {
// Remove any digits after the required decimal places.
xc.length = i--;
// Round up?
if (more) {
// Rounding up may mean the previous digit has to be rounded up.
for (; ++xc[i] > 9;) {
xc[i] = 0;
if (!i--) {
++x.e;
xc.unshift(1);
}
}
}
// Remove trailing zeros.
for (i = xc.length; !xc[--i]; xc.pop()) {
}
}
return x;
}
/*
* Throw a BigError.
*
* message {string} The error message.
*/
function throwErr(message) {
var err = new Error(message);
err.name = 'BigError';
throw err;
}
// Prototype/instance methods
/*
* Return a new Big whose value is the absolute value of this Big.
*/
P.abs = function () {
var x = new this.constructor(this);
x.s = 1;
return x;
};
/*
* Return
* 1 if the value of this Big is greater than the value of Big y,
* -1 if the value of this Big is less than the value of Big y, or
* 0 if they have the same value.
*/
P.cmp = function (y) {
var xNeg,
x = this,
xc = x.c,
yc = (y = new x.constructor(y)).c,
i = x.s,
j = y.s,
k = x.e,
l = y.e;
// Either zero?
if (!xc[0] || !yc[0]) {
return !xc[0] ? !yc[0] ? 0 : -j : i;
}
// Signs differ?
if (i != j) {
return i;
}
xNeg = i < 0;
// Compare exponents.
if (k != l) {
return k > l ^ xNeg ? 1 : -1;
}
i = -1;
j = (k = xc.length) < (l = yc.length) ? k : l;
// Compare digit by digit.
for (; ++i < j;) {
if (xc[i] != yc[i]) {
return xc[i] > yc[i] ^ xNeg ? 1 : -1;
}
}
// Compare lengths.
return k == l ? 0 : k > l ^ xNeg ? 1 : -1;
};
/*
* Return a new Big whose value is the value of this Big divided by the
* value of Big y, rounded, if necessary, to a maximum of Big.DP decimal
* places using rounding mode Big.RM.
*/
P.div = function (y) {
var x = this,
Big = x.constructor,
// dividend
dvd = x.c,
//divisor
dvs = (y = new Big(y)).c,
s = x.s == y.s ? 1 : -1,
dp = Big.DP;
if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {
throwErr('!Big.DP!');
}
// Either 0?
if (!dvd[0] || !dvs[0]) {
// If both are 0, throw NaN
if (dvd[0] == dvs[0]) {
throwErr(NaN);
}
// If dvs is 0, throw +-Infinity.
if (!dvs[0]) {
throwErr(s / 0);
}
// dvd is 0, return +-0.
return new Big(s * 0);
}
var dvsL, dvsT, next, cmp, remI, u,
dvsZ = dvs.slice(),
dvdI = dvsL = dvs.length,
dvdL = dvd.length,
// remainder
rem = dvd.slice(0, dvsL),
remL = rem.length,
// quotient
q = y,
qc = q.c = [],
qi = 0,
digits = dp + (q.e = x.e - y.e) + 1;
q.s = s;
s = digits < 0 ? 0 : digits;
// Create version of divisor with leading zero.
dvsZ.unshift(0);
// Add zeros to make remainder as long as divisor.
for (; remL++ < dvsL; rem.push(0)) {
}
do {
// 'next' is how many times the divisor goes into current remainder.
for (next = 0; next < 10; next++) {
// Compare divisor and remainder.
if (dvsL != (remL = rem.length)) {
cmp = dvsL > remL ? 1 : -1;
} else {
for (remI = -1, cmp = 0; ++remI < dvsL;) {
if (dvs[remI] != rem[remI]) {
cmp = dvs[remI] > rem[remI] ? 1 : -1;
break;
}
}
}
// If divisor < remainder, subtract divisor from remainder.
if (cmp < 0) {
// Remainder can't be more than 1 digit longer than divisor.
// Equalise lengths using divisor with extra leading zero?
for (dvsT = remL == dvsL ? dvs : dvsZ; remL;) {
if (rem[--remL] < dvsT[remL]) {
remI = remL;
for (; remI && !rem[--remI]; rem[remI] = 9) {
}
--rem[remI];
rem[remL] += 10;
}
rem[remL] -= dvsT[remL];
}
for (; !rem[0]; rem.shift()) {
}
} else {
break;
}
}
// Add the 'next' digit to the result array.
qc[qi++] = cmp ? next : ++next;
// Update the remainder.
if (rem[0] && cmp) {
rem[remL] = dvd[dvdI] || 0;
} else {
rem = [ dvd[dvdI] ];
}
} while ((dvdI++ < dvdL || rem[0] !== u) && s--);
// Leading zero? Do not remove if result is simply zero (qi == 1).
if (!qc[0] && qi != 1) {
// There can't be more than one zero.
qc.shift();
q.e--;
}
// Round?
if (qi > digits) {
rnd(q, dp, Big.RM, rem[0] !== u);
}
return q;
};
/*
* Return true if the value of this Big is equal to the value of Big y,
* otherwise returns false.
*/
P.eq = function (y) {
return !this.cmp(y);
};
/*
* Return true if the value of this Big is greater than the value of Big y,
* otherwise returns false.
*/
P.gt = function (y) {
return this.cmp(y) > 0;
};
/*
* Return true if the value of this Big is greater than or equal to the
* value of Big y, otherwise returns false.
*/
P.gte = function (y) {
return this.cmp(y) > -1;
};
/*
* Return true if the value of this Big is less than the value of Big y,
* otherwise returns false.
*/
P.lt = function (y) {
return this.cmp(y) < 0;
};
/*
* Return true if the value of this Big is less than or equal to the value
* of Big y, otherwise returns false.
*/
P.lte = function (y) {
return this.cmp(y) < 1;
};
/*
* Return a new Big whose value is the value of this Big minus the value
* of Big y.
*/
P.sub = P.minus = function (y) {
var i, j, t, xLTy,
x = this,
Big = x.constructor,
a = x.s,
b = (y = new Big(y)).s;
// Signs differ?
if (a != b) {
y.s = -b;
return x.plus(y);
}
var xc = x.c.slice(),
xe = x.e,
yc = y.c,
ye = y.e;
// Either zero?
if (!xc[0] || !yc[0]) {
// y is non-zero? x is non-zero? Or both are zero.
return yc[0] ? (y.s = -b, y) : new Big(xc[0] ? x : 0);
}
// Determine which is the bigger number.
// Prepend zeros to equalise exponents.
if (a = xe - ye) {
if (xLTy = a < 0) {
a = -a;
t = xc;
} else {
ye = xe;
t = yc;
}
t.reverse();
for (b = a; b--; t.push(0)) {
}
t.reverse();
} else {
// Exponents equal. Check digit by digit.
j = ((xLTy = xc.length < yc.length) ? xc : yc).length;
for (a = b = 0; b < j; b++) {
if (xc[b] != yc[b]) {
xLTy = xc[b] < yc[b];
break;
}
}
}
// x < y? Point xc to the array of the bigger number.
if (xLTy) {
t = xc;
xc = yc;
yc = t;
y.s = -y.s;
}
/*
* Append zeros to xc if shorter. No need to add zeros to yc if shorter
* as subtraction only needs to start at yc.length.
*/
if (( b = (j = yc.length) - (i = xc.length) ) > 0) {
for (; b--; xc[i++] = 0) {
}
}
// Subtract yc from xc.
for (b = i; j > a;){
if (xc[--j] < yc[j]) {
for (i = j; i && !xc[--i]; xc[i] = 9) {
}
--xc[i];
xc[j] += 10;
}
xc[j] -= yc[j];
}
// Remove trailing zeros.
for (; xc[--b] === 0; xc.pop()) {
}
// Remove leading zeros and adjust exponent accordingly.
for (; xc[0] === 0;) {
xc.shift();
--ye;
}
if (!xc[0]) {
// n - n = +0
y.s = 1;
// Result must be zero.
xc = [ye = 0];
}
y.c = xc;
y.e = ye;
return y;
};
/*
* Return a new Big whose value is the value of this Big modulo the
* value of Big y.
*/
P.mod = function (y) {
var yGTx,
x = this,
Big = x.constructor,
a = x.s,
b = (y = new Big(y)).s;
if (!y.c[0]) {
throwErr(NaN);
}
x.s = y.s = 1;
yGTx = y.cmp(x) == 1;
x.s = a;
y.s = b;
if (yGTx) {
return new Big(x);
}
a = Big.DP;
b = Big.RM;
Big.DP = Big.RM = 0;
x = x.div(y);
Big.DP = a;
Big.RM = b;
return this.minus( x.times(y) );
};
/*
* Return a new Big whose value is the value of this Big plus the value
* of Big y.
*/
P.add = P.plus = function (y) {
var t,
x = this,
Big = x.constructor,
a = x.s,
b = (y = new Big(y)).s;
// Signs differ?
if (a != b) {
y.s = -b;
return x.minus(y);
}
var xe = x.e,
xc = x.c,
ye = y.e,
yc = y.c;
// Either zero?
if (!xc[0] || !yc[0]) {
// y is non-zero? x is non-zero? Or both are zero.
return yc[0] ? y : new Big(xc[0] ? x : a * 0);
}
xc = xc.slice();
// Prepend zeros to equalise exponents.
// Note: Faster to use reverse then do unshifts.
if (a = xe - ye) {
if (a > 0) {
ye = xe;
t = yc;
} else {
a = -a;
t = xc;
}
t.reverse();
for (; a--; t.push(0)) {
}
t.reverse();
}
// Point xc to the longer array.
if (xc.length - yc.length < 0) {
t = yc;
yc = xc;
xc = t;
}
a = yc.length;
/*
* Only start adding at yc.length - 1 as the further digits of xc can be
* left as they are.
*/
for (b = 0; a;) {
b = (xc[--a] = xc[a] + yc[a] + b) / 10 | 0;
xc[a] %= 10;
}
// No need to check for zero, as +x + +y != 0 && -x + -y != 0
if (b) {
xc.unshift(b);
++ye;
}
// Remove trailing zeros.
for (a = xc.length; xc[--a] === 0; xc.pop()) {
}
y.c = xc;
y.e = ye;
return y;
};
/*
* Return a Big whose value is the value of this Big raised to the power n.
* If n is negative, round, if necessary, to a maximum of Big.DP decimal
* places using rounding mode Big.RM.
*
* n {number} Integer, -MAX_POWER to MAX_POWER inclusive.
*/
P.pow = function (n) {
var x = this,
one = new x.constructor(1),
y = one,
isNeg = n < 0;
if (n !== ~~n || n < -MAX_POWER || n > MAX_POWER) {
throwErr('!pow!');
}
n = isNeg ? -n : n;
for (;;) {
if (n & 1) {
y = y.times(x);
}
n >>= 1;
if (!n) {
break;
}
x = x.times(x);
}
return isNeg ? one.div(y) : y;
};
/*
* Return a new Big whose value is the value of this Big rounded to a
* maximum of dp decimal places using rounding mode rm.
* If dp is not specified, round to 0 decimal places.
* If rm is not specified, use Big.RM.
*
* [dp] {number} Integer, 0 to MAX_DP inclusive.
* [rm] 0, 1, 2 or 3 (ROUND_DOWN, ROUND_HALF_UP, ROUND_HALF_EVEN, ROUND_UP)
*/
P.round = function (dp, rm) {
var x = this,
Big = x.constructor;
if (dp == null) {
dp = 0;
} else if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {
throwErr('!round!');
}
rnd(x = new Big(x), dp, rm == null ? Big.RM : rm);
return x;
};
/*
* Return a new Big whose value is the square root of the value of this Big,
* rounded, if necessary, to a maximum of Big.DP decimal places using
* rounding mode Big.RM.
*/
P.sqrt = function () {
var estimate, r, approx,
x = this,
Big = x.constructor,
xc = x.c,
i = x.s,
e = x.e,
half = new Big('0.5');
// Zero?
if (!xc[0]) {
return new Big(x);
}
// If negative, throw NaN.
if (i < 0) {
throwErr(NaN);
}
// Estimate.
i = Math.sqrt(x.toString());
// Math.sqrt underflow/overflow?
// Pass x to Math.sqrt as integer, then adjust the result exponent.
if (i === 0 || i === 1 / 0) {
estimate = xc.join('');
if (!(estimate.length + e & 1)) {
estimate += '0';
}
r = new Big( Math.sqrt(estimate).toString() );
r.e = ((e + 1) / 2 | 0) - (e < 0 || e & 1);
} else {
r = new Big(i.toString());
}
i = r.e + (Big.DP += 4);
// Newton-Raphson iteration.
do {
approx = r;
r = half.times( approx.plus( x.div(approx) ) );
} while ( approx.c.slice(0, i).join('') !==
r.c.slice(0, i).join('') );
rnd(r, Big.DP -= 4, Big.RM);
return r;
};
/*
* Return a new Big whose value is the value of this Big times the value of
* Big y.
*/
P.mul = P.times = function (y) {
var c,
x = this,
Big = x.constructor,
xc = x.c,
yc = (y = new Big(y)).c,
a = xc.length,
b = yc.length,
i = x.e,
j = y.e;
// Determine sign of result.
y.s = x.s == y.s ? 1 : -1;
// Return signed 0 if either 0.
if (!xc[0] || !yc[0]) {
return new Big(y.s * 0);
}
// Initialise exponent of result as x.e + y.e.
y.e = i + j;
// If array xc has fewer digits than yc, swap xc and yc, and lengths.
if (a < b) {
c = xc;
xc = yc;
yc = c;
j = a;
a = b;
b = j;
}
// Initialise coefficient array of result with zeros.
for (c = new Array(j = a + b); j--; c[j] = 0) {
}
// Multiply.
// i is initially xc.length.
for (i = b; i--;) {
b = 0;
// a is yc.length.
for (j = a + i; j > i;) {
// Current sum of products at this digit position, plus carry.
b = c[j] + yc[i] * xc[j - i - 1] + b;
c[j--] = b % 10;
// carry
b = b / 10 | 0;
}
c[j] = (c[j] + b) % 10;
}
// Increment result exponent if there is a final carry.
if (b) {
++y.e;
}
// Remove any leading zero.
if (!c[0]) {
c.shift();
}
// Remove trailing zeros.
for (i = c.length; !c[--i]; c.pop()) {
}
y.c = c;
return y;
};
/*
* Return a string representing the value of this Big.
* Return exponential notation if this Big has a positive exponent equal to
* or greater than TO_EXP_POS, or a negative exponent equal to or less than
* TO_EXP_NEG.
*/
P.toString = P.valueOf = P.toJSON = function () {
var x = this,
e = x.e,
str = x.c.join(''),
strL = str.length;
// Exponential notation?
if (e <= TO_EXP_NEG || e >= TO_EXP_POS) {
str = str.charAt(0) + (strL > 1 ? '.' + str.slice(1) : '') +
(e < 0 ? 'e' : 'e+') + e;
// Negative exponent?
} else if (e < 0) {
// Prepend zeros.
for (; ++e; str = '0' + str) {
}
str = '0.' + str;
// Positive exponent?
} else if (e > 0) {
i