Public
Edited
May 26, 2023
list = [3, 4];
list2 = [3, [1, 2]];
function findSum (tree) { return treeReduce(x => x, (x, y) => x + findSum(y), tree, 0); }
function treeMap (f, tree) {
if(!(tree instanceof Array)) return f(tree);
else return tree.map(x => treeMap(f, x));
}
function treeReduce (f, join, tree, acc) {
if(!(tree instanceof Array)) return f(tree);
else return tree.reduce((i, n) => join(i, n), acc);
}
function kfTreeMap(f, kfTree) {
let [tag, ...contents] = kfTree;
if(tag === "kf") return f(kfTree);
else if(kfTree instanceof Array) return kfTree.map(kf => kfTreeMap(f, kf));;
}
function kfTreeReduce(f, join, kfTree, acc) {
let [tag, ...contents] = kfTree;
if(tag === "kf") return f(kfTree);
else if(kfTree instanceof Array) return kfTree.reduce((i, n) => join(i, n), acc);
}
offsetMap = (list, offset) => treeMap(x => x + offset, list);
offsetMap([1, [1, 2]], 1);
function offsetList(tree, offset) {
function offsetListHelper(tree, initOffset) {
let result = treeReduce(val => val + initOffset, ([acc, offset], next) => {
let result = offsetListHelper(next, offset);
let computedOffset = 0;
if(result instanceof Array) { let [acc, sum] = result;
result = acc;
computedOffset = sum;
}
let netOffset = findSum(result);
acc.push(result);
return [acc, netOffset];
}, tree, [[], initOffset]);
if(!(result instanceof Array)) return result;
else return result;
}
let result = offsetListHelper(tree, offset);
return (result instanceof Array) ? result[0] : result;
}
offsetList([1, [2, [1]], 1, 1], 0);
function offsetSeqDelays(tree, offset) {
let offsetKeyframe = ([tag, id, attribs, duration], offset = 0) => {
let delayWithOffset = (duration.delay || 0) + offset;
duration.delay = delayWithOffset;
return [[tag, id, attribs, duration], delayWithOffset + duration.duration];
}
let durationSum = (kfTree) => kfTreeReduce(kf => kf[3].delay + kf[3].duration, (acc, next) => acc + next, kfTree, 0);
function offsetListHelper(tree, initOffset) {
let result = kfTreeReduce((kf) => offsetKeyframe(kf, initOffset), ([acc, offset], next) => {
let result = offsetListHelper(next, offset);
let computedOffset = 0;
if(result[0] !== "kf") {
let [acc, sum] = result;
result = acc;
computedOffset = sum;
if(sum == null) console.warn("Couldn’t compute offset");
}
let netOffset = durationSum(result);
acc.push(result);
return [acc, netOffset];
}, tree, [[], initOffset]);
if(!(result instanceof Array)) return result;
else return result;
}
let result = offsetListHelper(tree, offset);
return (result instanceof Array) ? result[0] : result;
}
offsetSeqDelays([["kf", "#id", {}, {delay: 0, duration: 300}], ["kf", "#id", {}, {delay: 10, duration: 10}]], 0);
function normalize(anims, offset = 0) {
let offsetKeyframe = ([tag, id, attribs, duration], offset = 0) => {
let delayWithOffset = (duration.delay || 0) + offset;
duration.delay = delayWithOffset;
return [[tag, id, attribs, duration], delayWithOffset + duration.duration];
}
function offsetSeq(tree, initOffset) {
let [result, sum] = tree.reduce(([acc, offset], next) => {
let [result, sum] = offsetDelays(next, offset);
let netOffset = sum;
acc.push(result);
return [acc, netOffset];
}, [[], initOffset]);
return [["seq", ...result], sum];
};
const offsetGroup = (contents, offset) => {
let grpResults = contents.map(val => offsetDelays(val, offset));
let newAnims = grpResults.map(x => x[0]);
let newOffset = grpResults.map(x => x[1]).reduce((x, y) => Math.max(x, y));
return [["grp", ...newAnims], newOffset];
};
let offsetDelays = (anims, offset) => {
let [tag, ...contents] = anims;
if(tag == "kf") return offsetKeyframe(anims, offset);
else if(tag == "grp") return offsetGroup(contents, offset);
else if(tag == "seq") { return offsetSeq(contents, offset); }
else throw Error("Unknown element passed");
};
let result = offsetDelays(anims, offset);
return result[0];
}
quickReview(normalize(["grp", ["seq",
["kf", "#id", {}, {duration: 20}],
["kf", "#id2", {}, {duration: 20}],
["grp", ["kf", "#id3", {}, {duration: 10}],
["kf", "#id5", {}, {duration: 10}]],
["kf", "#id4", {}, {duration: 10}]],
["kf", "#id8", {}, {duration: 10}]], 10));
function quickReview (kfTree) {
let [tag, ...contents] = kfTree;
if(tag === "kf") return contents[0] + " | Dur: " + contents[2].duration + " | Off: " + contents[2].delay;
else if(tag === "grp") return "{" + contents.map(x => quickReview(x)).join("\n") + "}";
else if(tag === "seq") return "[" + contents.map(x => quickReview(x)).join("\n") + "]";
}
Purpose-built for displays of data
Observable is your go-to platform for exploring data and creating expressive data visualizations. Use reactive JavaScript notebooks for prototyping and a collaborative canvas for visual data exploration and dashboard creation.
