converted underscore.mixin.deepExtend to proper AMD module.

pull/3113/head
Keivan Beigi 11 years ago
parent 28a919e74a
commit e0aceb98d2

@ -3,102 +3,113 @@
* *
* Based on https://gist.github.com/echong/3861963 * Based on https://gist.github.com/echong/3861963
*/ */
(function() { define(
var arrays, basicObjects, deepClone, deepExtend, deepExtendCouple, isBasicObject, [
__slice = [].slice; 'underscore'
], function (_) {
deepClone = function(obj) { var arrays, basicObjects, deepClone, deepExtend, deepExtendCouple, isBasicObject, __slice =
var func, isArr; [
if (!_.isObject(obj) || _.isFunction(obj)) { ].slice;
return obj;
} deepClone = function (obj) {
if (obj instanceof Backbone.Collection || obj instanceof Backbone.Model) { var func, isArr;
return obj; if (!_.isObject(obj) || _.isFunction(obj)) {
} return obj;
if (_.isDate(obj)) { }
return new Date(obj.getTime()); if (obj instanceof Backbone.Collection || obj instanceof Backbone.Model) {
} return obj;
if (_.isRegExp(obj)) { }
return new RegExp(obj.source, obj.toString().replace(/.*\//, '')); if (_.isDate(obj)) {
} return new Date(obj.getTime());
isArr = _.isArray(obj || _.isArguments(obj));
func = function(memo, value, key) {
if (isArr) {
memo.push(deepClone(value));
} else {
memo[key] = deepClone(value);
} }
return memo; if (_.isRegExp(obj)) {
return new RegExp(obj.source, obj.toString().replace(/.*\//, ''));
}
isArr = _.isArray(obj || _.isArguments(obj));
func = function (memo, value, key) {
if (isArr) {
memo.push(deepClone(value));
}
else {
memo[key] = deepClone(value);
}
return memo;
};
return _.reduce(obj, func, isArr ?
[
] :{});
}; };
return _.reduce(obj, func, isArr ? [] : {});
};
isBasicObject = function(object) { isBasicObject = function (object) {
if (object == null) return false; if (object == null) {
return (object.prototype === {}.prototype || object.prototype === Object.prototype) && _.isObject(object) && !_.isArray(object) && !_.isFunction(object) && !_.isDate(object) && !_.isRegExp(object) && !_.isArguments(object); return false;
}; }
return (object.prototype === {}.prototype || object.prototype === Object.prototype) && _.isObject(object) && !_.isArray(object) && !_.isFunction(object) && !_.isDate(object) && !_.isRegExp(object) && !_.isArguments(object);
};
basicObjects = function(object) { basicObjects = function (object) {
return _.filter(_.keys(object), function(key) { return _.filter(_.keys(object), function (key) {
return isBasicObject(object[key]); return isBasicObject(object[key]);
}); });
}; };
arrays = function(object) { arrays = function (object) {
return _.filter(_.keys(object), function(key) { return _.filter(_.keys(object), function (key) {
return _.isArray(object[key]); return _.isArray(object[key]);
}); });
}; };
deepExtendCouple = function(destination, source, maxDepth) { deepExtendCouple = function (destination, source, maxDepth) {
var combine, recurse, sharedArrayKey, sharedArrayKeys, sharedObjectKey, sharedObjectKeys, _i, _j, _len, _len1; var combine, recurse, sharedArrayKey, sharedArrayKeys, sharedObjectKey, sharedObjectKeys, _i, _j, _len, _len1;
if (maxDepth == null) { if (maxDepth == null) {
maxDepth = 20; maxDepth = 20;
} }
if (maxDepth <= 0) { if (maxDepth <= 0) {
console.warn('_.deepExtend(): Maximum depth of recursion hit.'); console.warn('_.deepExtend(): Maximum depth of recursion hit.');
return _.extend(destination, source);
}
sharedObjectKeys = _.intersection(basicObjects(destination), basicObjects(source));
recurse = function (key) {
return source[key] = deepExtendCouple(destination[key], source[key], maxDepth - 1);
};
for (_i = 0, _len = sharedObjectKeys.length; _i < _len; _i++) {
sharedObjectKey = sharedObjectKeys[_i];
recurse(sharedObjectKey);
}
sharedArrayKeys = _.intersection(arrays(destination), arrays(source));
combine = function (key) {
return source[key] = _.union(destination[key], source[key]);
};
for (_j = 0, _len1 = sharedArrayKeys.length; _j < _len1; _j++) {
sharedArrayKey = sharedArrayKeys[_j];
combine(sharedArrayKey);
}
return _.extend(destination, source); return _.extend(destination, source);
}
sharedObjectKeys = _.intersection(basicObjects(destination), basicObjects(source));
recurse = function(key) {
return source[key] = deepExtendCouple(destination[key], source[key], maxDepth - 1);
};
for (_i = 0, _len = sharedObjectKeys.length; _i < _len; _i++) {
sharedObjectKey = sharedObjectKeys[_i];
recurse(sharedObjectKey);
}
sharedArrayKeys = _.intersection(arrays(destination), arrays(source));
combine = function(key) {
return source[key] = _.union(destination[key], source[key]);
}; };
for (_j = 0, _len1 = sharedArrayKeys.length; _j < _len1; _j++) {
sharedArrayKey = sharedArrayKeys[_j];
combine(sharedArrayKey);
}
return _.extend(destination, source);
};
deepExtend = function() { deepExtend = function () {
var finalObj, maxDepth, objects, _i; var finalObj, maxDepth, objects, _i;
objects = 2 <= arguments.length ? __slice.call(arguments, 0, _i = arguments.length - 1) : (_i = 0, []), maxDepth = arguments[_i++]; objects = 2 <= arguments.length ? __slice.call(arguments, 0, _i = arguments.length - 1) :(_i = 0,
if (!_.isNumber(maxDepth)) { [
objects.push(maxDepth); ]), maxDepth = arguments[_i++];
maxDepth = 20; if (!_.isNumber(maxDepth)) {
} objects.push(maxDepth);
if (objects.length <= 1) { maxDepth = 20;
return objects[0]; }
} if (objects.length <= 1) {
if (maxDepth <= 0) { return objects[0];
return _.extend.apply(this, objects); }
} if (maxDepth <= 0) {
finalObj = objects.shift(); return _.extend.apply(this, objects);
while (objects.length > 0) { }
finalObj = deepExtendCouple(finalObj, deepClone(objects.shift()), maxDepth); finalObj = objects.shift();
} while (objects.length > 0) {
return finalObj; finalObj = deepExtendCouple(finalObj, deepClone(objects.shift()), maxDepth);
}; }
return finalObj;
};
require(['underscore'], function (_) {
_.mixin({ _.mixin({
deepClone : deepClone, deepClone : deepClone,
@ -109,4 +120,3 @@
}); });
}); });
}).call(this);

Loading…
Cancel
Save