113 lines
No EOL
3.1 KiB
JavaScript
113 lines
No EOL
3.1 KiB
JavaScript
import _cloneRegExp from "./_cloneRegExp.js";
|
|
import type from "../type.js";
|
|
|
|
/**
|
|
* Copies an object.
|
|
*
|
|
* @private
|
|
* @param {*} value The value to be copied
|
|
* @param {Boolean} deep Whether or not to perform deep cloning.
|
|
* @return {*} The copied value.
|
|
*/
|
|
export default function _clone(value, deep, map) {
|
|
map || (map = new _ObjectMap());
|
|
|
|
// this avoids the slower switch with a quick if decision removing some milliseconds in each run.
|
|
if (_isPrimitive(value)) {
|
|
return value;
|
|
}
|
|
var copy = function copy(copiedValue) {
|
|
// Check for circular and same references on the object graph and return its corresponding clone.
|
|
var cachedCopy = map.get(value);
|
|
if (cachedCopy) {
|
|
return cachedCopy;
|
|
}
|
|
map.set(value, copiedValue);
|
|
for (var key in value) {
|
|
if (Object.prototype.hasOwnProperty.call(value, key)) {
|
|
copiedValue[key] = deep ? _clone(value[key], true, map) : value[key];
|
|
}
|
|
}
|
|
return copiedValue;
|
|
};
|
|
switch (type(value)) {
|
|
case 'Object':
|
|
return copy(Object.create(Object.getPrototypeOf(value)));
|
|
case 'Array':
|
|
return copy(Array(value.length));
|
|
case 'Date':
|
|
return new Date(value.valueOf());
|
|
case 'RegExp':
|
|
return _cloneRegExp(value);
|
|
case 'Int8Array':
|
|
case 'Uint8Array':
|
|
case 'Uint8ClampedArray':
|
|
case 'Int16Array':
|
|
case 'Uint16Array':
|
|
case 'Int32Array':
|
|
case 'Uint32Array':
|
|
case 'Float32Array':
|
|
case 'Float64Array':
|
|
case 'BigInt64Array':
|
|
case 'BigUint64Array':
|
|
return value.slice();
|
|
default:
|
|
return value;
|
|
}
|
|
}
|
|
function _isPrimitive(param) {
|
|
var type = typeof param;
|
|
return param == null || type != 'object' && type != 'function';
|
|
}
|
|
var _ObjectMap = /*#__PURE__*/function () {
|
|
function _ObjectMap() {
|
|
this.map = {};
|
|
this.length = 0;
|
|
}
|
|
_ObjectMap.prototype.set = function (key, value) {
|
|
var hashedKey = this.hash(key);
|
|
var bucket = this.map[hashedKey];
|
|
if (!bucket) {
|
|
this.map[hashedKey] = bucket = [];
|
|
}
|
|
bucket.push([key, value]);
|
|
this.length += 1;
|
|
};
|
|
_ObjectMap.prototype.hash = function (key) {
|
|
var hashedKey = [];
|
|
for (var value in key) {
|
|
hashedKey.push(Object.prototype.toString.call(key[value]));
|
|
}
|
|
return hashedKey.join();
|
|
};
|
|
_ObjectMap.prototype.get = function (key) {
|
|
/**
|
|
* depending on the number of objects to be cloned is faster to just iterate over the items in the map just because the hash function is so costly,
|
|
* on my tests this number is 180, anything above that using the hash function is faster.
|
|
*/
|
|
if (this.length <= 180) {
|
|
for (var p in this.map) {
|
|
var bucket = this.map[p];
|
|
for (var i = 0; i < bucket.length; i += 1) {
|
|
var element = bucket[i];
|
|
if (element[0] === key) {
|
|
return element[1];
|
|
}
|
|
}
|
|
}
|
|
return;
|
|
}
|
|
var hashedKey = this.hash(key);
|
|
var bucket = this.map[hashedKey];
|
|
if (!bucket) {
|
|
return;
|
|
}
|
|
for (var i = 0; i < bucket.length; i += 1) {
|
|
var element = bucket[i];
|
|
if (element[0] === key) {
|
|
return element[1];
|
|
}
|
|
}
|
|
};
|
|
return _ObjectMap;
|
|
}(); |