Public
Edited
Jan 9, 2024
n = 64
nseq = aq
.table({ index: [0]})
.derive({index: op.sequence(1,16,1),
rank: op.sequence(1,8,1),
pos: op.sequence(1,4,1)})
.unroll('index')
.unroll('rank')
.unroll('pos')
.objects()
mutable element = []
function iterate(obj, out = []) {
// recurse over keys
Object.keys(obj).forEach((key) => {
out.push(key);
if (check(obj[key], {}, []) && obj[key] !== null) {
iterate(obj[key], out) }});
return out }
check = (prop, ...types) =>
types.some((type) =>
Object.prototype.toString.call(prop) ===
Object.prototype.toString.call(type));
targetTree =
reduceTree( (pool, value, path) =>
[ ...pool, { p:path.join('.'), value } ], [] , sourceTree )
// https://stackoverflow.com/questions/52807498/
// nested-reduce-functions-recursion-functional-programming-tree-traversal/52822287#52822287
function* traverse (tree = {}, path = []) {
for (const [ key, value ] of Object.entries (tree))
if (check(value, {},[])) {
yield* traverse (value, append (path, key))}
else
yield [ append (path, key), value ]
}
reduceTree = (proc, state, tree) =>
reduce
( (acc, [ path, value ]) =>
proc (acc, value, path)
, state
, Array.from (traverse (tree))
)
reduce = (proc, state, arr) =>
arr .reduce (proc, state)
append = (xs, x) =>
xs .concat ([ x ])
pathGen(sourceTree)
function pathGen(obj) {
let acc = {};
for (let [path, value] of pathGen(obj)) {
//acc[value] = acc[value] || [];
acc[path] = value; //path.split('.').reverse()[0] ;
}
function* pathGen(obj) {
for (let k in obj) {
if (check(obj[k], {}, [])) {
for (let [childPath, value] of pathGen(obj[k])) {
yield [`${k}.${childPath}`, value];
}
} else {
yield [k];
}
}
}
return acc;
}
// https://stackoverflow.com/questions/60352470
// get-all-paths-to-a-specific-key-in-a-deeply-nested-object
function getAllPaths(obj, prev = '') {
let result = []
for (let k in obj) {
let path = prev + (prev ? '.' : '') + k;
result.push([path,k])
if (check(obj[k],{},[])) {
result.push(getAllPaths(obj[k], path))
}
} return result
}
integerTee = {
let tree = {};
index(1,tree)
index(21,tree)
index(301,tree)
index(401,tree)
index(2401,tree)
return tree
}
function index(uint, tree) {
let size = fastLen(uint);
let last;
for (let i = 0; i < size; ++i) {
let digit = ((uint * 10 ** -i) | 0) % 10;
if (last) {
last = last[digit] ? last[digit] : last[digit] = {};
} else if (tree[digit]) {
last = tree[digit];
} else {
last = tree[digit] = {};
}
}
last.freq ? last.freq++ : (last.freq = 1);
}
fastLen = (input) =>
(input < 10) ? 1 :
(input < 100) ? 2 :
(input < 1000) ? 3 :
(input < 10000) ? 4 :
(input < 100000) ? 5 :
(input < 1000000) ? 6 :
(input < 10000000) ? 7 :
(input < 100000000) ? 8 :
(input < 1000000000) ? 9 :
(input < 10000000000) ? 10 :
(input < 100000000000) ? 11 :
(input < 1000000000000) ? 12 :
(input < 10000000000000) ? 13 :
(input < 100000000000000) ? 14 :
(input < 1000000000000000) ? 15 : 16
a = html`<input type = range>`
b = html`<input type = range>`
resolve()
async function* resolve(obj) {
let a_ = Generators.input(a)
let b_ = Generators.input(b)
let sub = {sub:{a_,b_}}
let out = {}
for await (let [key,val] of Object.entries(sub) ) {
if(key == 'sub'){
out[key] = {}; resolve(val)
} else { out[key] = 0; }
yield out
}
}
Promise.allDeep = function (entity) {
let keys = Object.keys(entity)
return Promise.all(keys.map(key=>{
let value = entity[key]
if(check(value,{})&&!value.then){
return Promise.allDeep(value)
} return value
}))
.then(data => {
return keys.reduce((pool, key, i) => { pool[key] = data[i]
return pool },
Array.isArray(entity) ? [] : {})}
)
}
// https://stackoverflow.com/a/16152333
{
let out = [];
let tw = document.createTreeWalker(frag, NodeFilter.SHOW_COMMENT, null, null),
comment;
while ((comment = tw.nextNode())) {
out.push(comment);
}
return out;
}
frag = html`<div>Hello<!-- world --></div>`
// { for(var i in window) { return window[i] } }
import {aq, op} from "@uwdata/arquero"
import {share} from '@tomlarkworthy/shareview@308'
viewof options = {
const n = Inputs.range([1, 30], {value: 19, step: 1, label: "size"});
const a = Inputs.range([0, 45], {value: 27.5, step: 0.1, label: "angle"});
const x = Inputs.range([-100, 100], {value: 0, step: 1, label: "x offset"});
const y = Inputs.range([-100, 100], {value: 0, step: 1, label: "y offset"});
return Object.defineProperty(html`${[n, a, x, y]}`, "value", {
get() {
return {
n: n.value,
a: a.value,
p: [x.value, y.value]
};
},
set({n: _n, a: _a, p: _p}) {
if (_n !== undefined) n.value = _n;
if (_a !== undefined) a.value = _a;
if (_p !== undefined) [x.value, y.value] = _p;
}
});
}
// viewof options.value = ({x: 9})
share('nested', viewof options)
One platform to build and deploy the best data apps
Experiment and prototype by building visualizations in live JavaScript notebooks. Collaborate with your team and decide which concepts to build out.
Use Observable Framework to build data apps locally. Use data loaders to build in any language or library, including Python, SQL, and R.
Seamlessly deploy to Observable. Test before you ship, use automatic deploy-on-commit, and ensure your projects are always up-to-date.