package.dist.module-debug.array.js Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of mikado Show documentation
Show all versions of mikado Show documentation
Web's fastest template library to build user interfaces.
The newest version!
import Mikado, { apply_proxy } from "./mikado.js";
const proto = Array.prototype,
proxy = window.Proxy;
/** @type {Proxy} */
/** @type {boolean} */
let skip = !1;
/**
* @param {Mikado=} mikado
*/
function debug(mikado) {
if (!mikado) {
throw new Error("The observable array was not assigned to a Mikado instance. You need to pass in the observable array when initiating a Mikado instance.");
}
}
/**
* @param {Array|Observer=} array
* @returns {Observer|Proxy}
* @constructor
*/
export default function Observer(array) {
if (array instanceof Observer) {
return array;
}
if (!(this instanceof Observer)) {
return new Observer(array);
}
this.mikado = null;
const length = array ? array.length : 0;
if (proxy) {
if (length) {
for (let i = 0; i < length; i++) {
this[i] = array[i];
}
}
/** @export */
this.length = length;
this.proto = {
splice: proto.splice.bind(this),
pop: proto.pop.bind(this),
shift: proto.shift.bind(this),
unshift: proto.unshift.bind(this),
push: proto.push.bind(this)
};
return new Proxy(this, handler);
} else {
this.proto = array || [];
for (let i = 0; i <= length; i++) {
this.define(i);
}
this.define("length");
}
}
/**
* @param {!Mikado} mikado
* @const
*/
Observer.prototype.mount = function (mikado) {
if (this.mikado !== mikado) {
this.mikado && mikado.mount(this.mikado.root);
this.mikado = mikado;
}
return this;
};
/**
* @param {string|number} key
* @private
* @const
*/
Observer.prototype.define = function (key) {
Object.defineProperty(this, /** @type {string} */key, {
get: /** @this {Observer} */function () {
return this.proto[key];
},
set: /** @this {Observer} */function (val) {
if ("number" == typeof key) {
if (key === this.length) {
// create pointer +1 of array length to trigger array growth
this.define(key + 1);
}
handler.set(this, key, val);
}
}
});
return this;
};
const handler = /** @type {!ProxyHandler} */{
// actually we do not need a trap for the getter
// get: function(target, prop){
// return target[prop];
// },
/**
* @param {Observer} target
* @param {string|number} prop
* @param {Object|number} value
* @return {boolean}
*/
set: function (target, prop, value) {
let index_by_number;
if ("number" == typeof prop) {
index_by_number = !0;
} else {
const index = parseInt(prop, 10);
if (prop === "" + index) {
index_by_number = !0;
}
}
const mikado = target.mikado;
if (!skip) {
skip = !0;
if (mikado) {
const target_length = target.length;
if (index_by_number) {
prop = /** @type {number} */prop;
debug(mikado);
const mikado_length = mikado.length;
if (target_length !== mikado_length) {
target.length = mikado_length;
}
let node;
if (prop >= mikado_length) {
mikado.add(value);
target.length++;
} else if (prop < mikado_length) {
node = mikado.dom[prop];
if (mikado.recycle || mikado.key && node._mkk === value[mikado.key]) {
mikado.update(node, value, null, prop);
} else {
mikado.replace(node, value, null, prop);
}
}
} else {
if ("length" === prop) {
value = /** @type {number} */value;
if (value < target_length) {
mikado.remove(value, target_length - value);
}
}
}
}
skip = !1;
}
if (mikado) {
// when recycle is disabled, the existing proxy needs to by updated
const recycle = mikado.recycle || mikado.key;
if (index_by_number && mikado.proxy && (!recycle || !value._mkx)) {
prop = /** @type {number} */prop;
value = /** @type {Object} */value;
value = apply_proxy(mikado, mikado.dom[prop], value);
}
}
(proxy ? target : target.proto)[prop] = value;
// accept changes:
return !0;
}
};
/**
* @param {Array} array
*/
Observer.prototype.set = function (array) {
const mikado = this.mikado;
if (mikado.recycle || mikado.key) {
skip = !0;
mikado.render(array);
skip = !1;
if (this.length > array.length) {
this.splice(array.length);
}
}
// else if(mikado.recycle){
//
// const length = array.length;
//
// for(let i = 0; i < length; i++){
//
// this[i] = array[i];
// }
//
// if(this.length > length){
//
// this.splice(length);
// }
// }
else {
this.splice();
this.concat(array);
}
return this;
};
/**
* @param {number=} start
* @param {number=} count
* @param {*=} insert
* @returns {Array<*>}
*/
Observer.prototype.splice = function (start, count, insert) {
debug(this.mikado);
skip = !0;
start || (start = 0);
if ("undefined" == typeof count) {
count = this.length - start;
if (0 > count) count = 0;
}
count && this.mikado.remove( /** @type {number} */start, count);
const tmp = insert ? this.proto.splice(start, count, insert) : this.proto.splice(start, count);
insert && this.mikado.add(insert, start /*, this.mikado.view*/);
//this.length += (insert ? 1 : 0) - count;
skip = !1;
return tmp;
};
/**
* @param {Object} data
*/
Observer.prototype.push = function (data) {
debug(this.mikado);
skip = !0;
this.mikado.add(data);
this[this.length] = data;
if (proxy) this.length++;
skip = !1;
};
/**
* @param {Object} data
*/
Observer.prototype.unshift = function (data) {
debug(this.mikado);
skip = !0;
this.mikado.add(data, 0);
this.proto.unshift(data);
skip = !1;
};
/**
* @return {Object}
*/
Observer.prototype.pop = function () {
debug(this.mikado);
skip = !0;
this.mikado.remove(this.length - 1);
const tmp = this.proto.pop();
skip = !1;
return tmp;
};
/**
* @return {Object}
*/
Observer.prototype.shift = function () {
debug(this.mikado);
skip = !0;
this.mikado.remove(0);
const tmp = this.proto.shift();
skip = !1;
return tmp;
};
/**
* @param {Array>} arr
*/
Observer.prototype.concat = function (arr) {
const length = arr.length;
for (let i = 0; i < length; i++) this.push(arr[i]);
return this;
};
Observer.prototype.sort = proto.sort;
// Observer.prototype.sort = function(fn){
//
// //skip = true;
// proto.sort.call(this, fn);
// //this.mikado.refresh(this.view);
// //skip = false;
// return this;
// };
Observer.prototype.reverse = proto.reverse;
// Observer.prototype.reverse = function(){
//
// //skip = true;
// proto.reverse.call(this);
// //this.mikado.refresh();
// //skip = false;
// return this;
// };
Observer.prototype.slice = proto.slice;
/**
* @param {Function} fn
* @param {boolean} self
*/
Observer.prototype.map = function (fn, self) {
if (self) {
fn = fn.bind(this);
}
for (let i = 0, length = this.length; i < length; i++) {
this[i] = fn(this[i]);
}
return this;
};
/**
* @param {Function} fn
* @param {boolean} self
*/
Observer.prototype.filter = function (fn, self) {
if (self) {
fn = fn.bind(this);
}
let start, count;
for (let i = 0, length = this.length; i < length; i++) {
if (!fn(this[i])) {
if (count) {
count++;
} else {
start = i;
count = 1;
}
} else if (count) {
this.splice(start, count);
length -= count;
i -= count;
count = 0;
}
}
if (count) {
this.splice(start, count);
}
return this;
};
/**
* @param {*} search
* @return number
*/
Observer.prototype.indexOf = function (search) {
for (let i = 0, len = this.length; i < len; i++) {
if (this[i] === search) {
return i;
}
}
return -1;
};
/**
* @param {*} search
* @return number
*/
Observer.prototype.lastIndexOf = function (search) {
for (let i = this.length - 1; 0 <= i; i--) {
if (this[i] === search) {
return i;
}
}
return -1;
};
Observer.prototype.includes = proto.includes;
/**
* @param {Function} fn
*/
Observer.prototype.forEach = function (fn) {
for (let i = 0, length = this.length; i < length; i++) {
fn(this[i]);
}
return this;
};
/**
* @param {number} a
* @param {number} b
*/
Observer.prototype.swap = function (a, b) {
//const self = proxy ? this : this.proto;
const tmp = this[b];
this[b] = this[a];
this[a] = tmp;
return this;
};
/**
* Transactions will apply reconciling
* @param {Function} fn
*/
Observer.prototype.transaction = function (fn) {
debug(this.mikado);
skip = !0;
fn();
skip = !1;
const mikado = this.mikado,
fullproxy = mikado.fullproxy;
// the fullproxy skip needs to be removed temporary,
// otherwise it won't commit collected properties
mikado.fullproxy = 0;
if (mikado.async) {
mikado.render(this).then(function () {
mikado.fullproxy = fullproxy;
});
} else {
mikado.render(this);
mikado.fullproxy = fullproxy;
}
}; © 2015 - 2025 Weber Informatics LLC | Privacy Policy