Function changeset

docs/app/js/sanddance-app.js:107275–107386

()

    return v && v.constructor === changeset;
}
function changeset() {
    const add1 = [], // insert tuples
    rem = [], // remove tuples
    mod = [], // modify tuples
    remp = [], // remove by predicate
    modp = []; // modify by predicate
    let clean = null, reflow = false;
    return {
        constructor: changeset,
        insert (t) {
            const d = (0, _vegaUtil.array)(t), n = d.length;
            for(let i = 0; i < n; ++i)add1.push(d[i]);
            return this;
        },
        remove (t) {
            const a = (0, _vegaUtil.isFunction)(t) ? remp : rem, d = (0, _vegaUtil.array)(t), n = d.length;
            for(let i = 0; i < n; ++i)a.push(d[i]);
            return this;
        },
        modify (t, field, value) {
            const m = {
                field: field,
                value: (0, _vegaUtil.constant)(value)
            };
            if ((0, _vegaUtil.isFunction)(t)) {
                m.filter = t;
                modp.push(m);
            } else {
                m.tuple = t;
                mod.push(m);
            }
            return this;
        },
        encode (t, set) {
            if ((0, _vegaUtil.isFunction)(t)) modp.push({
                filter: t,
                field: set
            });
            else mod.push({
                tuple: t,
                field: set
            });
            return this;
        },
        clean (value) {
            clean = value;
            return this;
        },
        reflow () {
            reflow = true;
            return this;
        },
        pulse (pulse1, tuples) {
            const cur = {}, out = {};
            let i, n, m, f1, t1, id; // build lookup table of current tuples
            for(i = 0, n = tuples.length; i < n; ++i)cur[tupleid(tuples[i])] = 1;
             // process individual tuples to remove
            for(i = 0, n = rem.length; i < n; ++i){