51 lines
1.5 KiB
JavaScript
51 lines
1.5 KiB
JavaScript
import { compare, has, isEqual, isNumber, isObject, resolve } from "../../util";
|
|
import {
|
|
applyUpdate,
|
|
clone,
|
|
UPDATE_OPTIONS,
|
|
walkExpression
|
|
} from "./_internal";
|
|
const OPERATOR_MODIFIERS = Object.freeze([
|
|
"$each",
|
|
"$slice",
|
|
"$sort",
|
|
"$position"
|
|
]);
|
|
const $push = (obj, expr, arrayFilters = [], options = UPDATE_OPTIONS) => {
|
|
return walkExpression(expr, arrayFilters, options, (val, node, queries) => {
|
|
const args = {
|
|
$each: [val]
|
|
};
|
|
if (isObject(val) && OPERATOR_MODIFIERS.some((m) => has(val, m))) {
|
|
Object.assign(args, val);
|
|
}
|
|
return applyUpdate(
|
|
obj,
|
|
node,
|
|
queries,
|
|
(o, k) => {
|
|
const arr = o[k] ||= [];
|
|
const prev = arr.slice(0, args.$slice || arr.length);
|
|
const oldsize = arr.length;
|
|
const pos = isNumber(args.$position) ? args.$position : arr.length;
|
|
arr.splice(pos, 0, ...clone(options.cloneMode, args.$each));
|
|
if (args.$sort) {
|
|
const sortKey = isObject(args.$sort) ? Object.keys(args.$sort || {}).pop() : "";
|
|
const order = !sortKey ? args.$sort : args.$sort[sortKey];
|
|
const f = !sortKey ? (a) => a : (a) => resolve(a, sortKey);
|
|
arr.sort((a, b) => order * compare(f(a), f(b)));
|
|
}
|
|
if (isNumber(args.$slice)) {
|
|
if (args.$slice < 0) arr.splice(0, arr.length + args.$slice);
|
|
else arr.splice(args.$slice);
|
|
}
|
|
return oldsize != arr.length || !isEqual(prev, arr);
|
|
},
|
|
{ descendArray: true, buildGraph: true }
|
|
);
|
|
});
|
|
};
|
|
export {
|
|
$push
|
|
};
|