2b:null 2c:["$","title",null,{"children":"utilities | Bob Kerns | Observable"}] 31:Tb52,viewof liveData = def`function liveData(genFn, tag=\`\`, fn=String) Return a live data node, automatically updated as the \`genFn\` returns new values. * _genFn_: An function that returns an async generator. * _tag_: the element to make live. * _fn_: A function to convert from the live data from the generator to content (string or elements). If the element is removed from the document, the generator is terminated to free up resources. Use a proxy generator if this is not desirable. If the element is re-added to the document, \`genFn\` is called again for a new generator. `((genFn, tag = document.createElement('span'), fn = String) => { const t = d3.select(tag); const id = t.attr('id', idGen('-liveData')).attr('id'); let go; let ready = new Promise(a => (go = a)); let gen; let observer; const observe = node => { const ob = new MutationObserver(mutations => { // Ignore the mutation record. We just care if our element is in the tree or not, // we don't need to look at every damned node. If only there were a way to get an // event when a node was added or removed from the document. Oh, wait, there used to be. // If only MutationObserver would observe changes to the parenting and document ownership // of a node, we could do this a lot more efficiently. if (document.getElementById(id) === tag) { go((gen = genFn())); // Let's find a more narrow scope to observe henceforth! // We will assume we don't shuffle elements between cells. // So let's find this cell! let p = tag.parentElement; while (p && !p.classList.contains('observablehq')) { p = p.parentElement; } if (p) { observer.disconnect(); observer = observe(p); } } else { // So cancel that promise go(null); // and the generator, to free up any resources... gen && gen.return(null); gen = null; // Wait for possible reattachment. ready = new Promise(a => (go = a)); } }); ob.observe(node, { subtree: true, childList: true }); return (observer = ob); }; observer = observe(document.body); return d3 .select(tag) .call(n => n .classed('-liveData-ready', false) .classed('-liveData-waiting', false) .classed('-liveData-active', false) .classed('-liveData', true) .text('') .selectAll('*') .remove() ) .call(async n => { n.classed('-liveData-waiting', true); while (true) { const gen = await ready; n.classed('-liveData-waiting', false); if (gen) { n.classed('-liveData-ready', true); for await (const v of gen) { n.classed('-liveData-active', true).text(fn(v)); } } } }) .node(); })32:T617,viewof timeUnits = def`timeUnits = _names of time units_ Indexed by _language_._[long|short]_,_unit_[0=_singular_, 1=_plural_]`({ english: { long: { second: ['second', 'seconds'], minute: ['minute', 'minutes'], hour: ['hour', 'hours'], day: ['day', 'days'], week: ['week', 'weeks'], month: ['month', 'months'], year: ['year', 'years'] }, short: { second: ['sec', 'sec'], minute: ['min', 'min'], hour: ['hr', 'hr'], day: ['d', 'd'], week: ['wk', 'wk'], month: ['mth', 'mth'], year: ['yr', 'yr'] } }, 日本語: { long: { second: ['秒', '秒'], minute: ['分', '分'], hour: ['時間', '時間'], day: ['日', '日'], week: ['週間', '週間'], month: ['月', '月'], year: ['年', '年'] }, short: { second: ['秒', '秒'], minute: ['分', '分'], hour: ['時', '時'], day: ['日', '日'], week: ['週', '週'], month: ['月', '月'], year: ['年', '年'] } }, español: { long: { second: ['segundo', 'segundos'], minute: ['minuto', 'minutos'], hour: ['hora', 'horas'], day: ['día', 'días'], week: ['semana', 'semanas'], month: ['mes', 'meses'], year: ['año', 'años'] }, short: { second: ['sec', 'sec'], minute: ['min', 'mins'], hour: ['hr', 'hr'], day: ['d', 'd'], week: ['sem', 'sems'], month: ['mes', 'mes'], year: ['año', 'año'] } } })33:T43e,viewof agoTimes = def`function agoTimes(time = now, units=defaultTimeUnits): Generates an infinite series of values of the form _[t, i, u]_, where * _t_: an integer number of time units * _u_: The english name for that unit * _i_: Interval in ms until the next change in _t_ and/or _u_. See \`ago\` for one usage. `(async function* ago(time = Date.now(), units = defaultTimeUnits) { const SECOND = 1000; const MINUTE = SECOND * 60; const HOUR = MINUTE * 60; const DAY = HOUR * 24; const WEEK = DAY * 7; const YEAR = DAY * 365.25; const MONTH = YEAR / 12; const m = (t, p, n) => { const c = Math.floor(t / p); const u = units[n][c === 1 ? 0 : 1]; return c ? [c, p - (t % p), u] : undefined; }; while (true) { const n = Date.now(); const t = n - time; const v = m(t, YEAR, 'year') || m(t, MONTH, 'month') || m(t, WEEK, 'week') || m(t, DAY, 'day') || m(t, HOUR, 'hour') || m(t, MINUTE, 'minute') || m(t, SECOND, 'second') || [1, SECOND - t, 'just now']; yield v; await Promises.when(n + v[1]); } })34:T8c8,viewof eventToGenerator = def`async generator function eventToGenerator(queue) returns _[generator, controller]_ Create a generator that can be made to return values to be supplied by a callback. * _queue_: A function that returns the queue to use. * _generator_: The generator being controlled. * _controller_: An object with the following: * \`send(\`_value_\`)\`: send the next value to generate. * \`end()\`: Cause the generator to end * \`throw(\`_error_\`)\`: Cause the generator to throw an exception. * \`clear()\`: Remove any pending queue items. \`end\` and \`throw\` are synchronous with queue. That is, they cause the queue to end or throw when the consumer of the generator has read everything prior to the queue. _queue_ should return an object that implements \`.length\`, \`.push()\`, \`.shift()\`, and \`.clear()\`. The default implementation is [Denque](https://github.com/invertase/denque), which is fast for unbounded size. Other queue functions of interest: * \`queue1\`: returns a "queue" of maximum length 1. Older entries are discarded. * \`queueSticky\`: Returns a queue that returns the last value seen, forever (or until cleared). * \`queueOldest\`_(n)_: Call with _n_ to set the size; when full new values are discarded. * \`queueNewest\`_(n)_: Call with _n_ to set the size; when full old values are discarded. * \`queueUnique\`: Returns a queue that discards duplicate enqueued values. `((queue = () => new Denque()) => { let unblock = () => undefined; const endTag = Symbol.for("endTag"); let waiter = null; const q = queue(); const send = v => (q.push(v), unblock()); const end = value => send({ [endTag]: 'return', value }); const error = value => send({ [endTag]: 'throw', value }); const clear = () => q.clear(); async function* eventToGenerator_() { while (true) { while (!q.length) { waiter = new Promise(a => (unblock = a)); await waiter; waiter = null; unblock = () => undefined; } const v = q.shift(); if (v === endTag) return; if (v[endTag]) { throw v[endTag]; } yield v; } } return [ eventToGenerator_(), { send, end, throw: error, clear } ]; })35:T7da,viewof queueUnique = def`function queueUnique({newest, keyFn}): () => Return queue, which discards already-enqueued entries. Values can be re-enqueued once delivered. * _newest_: if \`false\` (the default), values are dequeued in the order they were first enqueued. Using _newest: true_ deprioritizes more active values so less-busy items can get through. But in a sustained-busy situation, there is no guarantee they will ever be delivered. This can be an advantage or disadvantage, depending on requirements. * _keyFn_: A function to identify what values count as "equal". The default regards +0 and -0 as the same, NaN's as all the same, and otherwise behaves as \`===\`. `(spec => { const fn = (newest, keyFn) => () => { const queue = new Map(); let iter = null; const obj = {}; Reflect.defineProperty(obj, 'length', { get: () => queue.size }); Reflect.defineProperty(obj, 'push', { value: v => { const k = keyFn(v); if (newest) { // As I read the spec, this should not be needed, but experimentally // in Chrome, it is. queue.delete(k); queue.set(k, v); } else if (!queue.has(k)) { queue.set(k, v); } return queue.size; } }); Reflect.defineProperty(obj, 'shift', { value: () => { if (!iter) { iter = queue.values(); } const r = iter.next(); if (r.done) { // If values had been added later, they would turn up // in the iterator, so we're done. iter = null; return undefined; } return r.value; } }); Reflect.defineProperty(obj, 'clear', { value: () => queue.clear() }); return obj; }; if (spec === undefined) { // Called without specifying a length, just return a size=1 queue. return fn(false, i => i)(); } // Return a function to construct queues of the specified size. return fn(!!spec.newest, spec.keyFn || (i => i)); })36:T488,viewof queueUpdateShallow = def`function queueUpdate(init={}): () => generator Accepts objects, and returns just the fields that have changed (are no longer \`===\`). This does not distinguish between deleted keys and keys assigned a value of \`undefined\` in the input. In the output, a deleted key is represented as present with a value of \`undefined\`. `(init => { const fn = init => () => { const state = { ...init }; let pending = {}; let hasPending = false; const obj = {}; const clear = () => { pending = {}; hasPending = false; } Reflect.defineProperty(obj, 'length', { get: () => (hasPending ? 1 : 0) }); Reflect.defineProperty(obj, 'push', { value: v => { Object.keys(v).forEach(k => {}); } }); Reflect.defineProperty(obj, 'shift', { value: () => { try { return pending; } finally { Object.assign(state, pending); clear(); } } }); Reflect.defineProperty(obj, 'clear', { value: clear }); return obj; }; if (init === undefined) { return fn({})(); } return fn(init); })37:T549,viewof base64Encode = def`function base64Encode(buf, fold) => String: * buf—An \`ArrayBffer\` or \`Uint8Array\` * fold—if truthy, fold lines on 76-char boundaries String to base64 encoding. `((buf, fold) => { const uint6ToB64 = nUint6 => nUint6 < 26 ? nUint6 + 65 : nUint6 < 52 ? nUint6 + 71 : nUint6 < 62 ? nUint6 - 4 : nUint6 === 62 ? 43 : nUint6 === 63 ? 47 : 65; const aBytes = buf instanceof ArrayBuffer ? new Uint8Array(buf) : buf; var eqLen = (3 - (aBytes.length % 3)) % 3, sB64Enc = ""; for ( var nMod3, nLen = aBytes.length, nUint24 = 0, nIdx = 0; nIdx < nLen; nIdx++ ) { nMod3 = nIdx % 3; /* Uncomment the following line in order to split the output in lines 76-character long: */ if (fold) { if (nIdx > 0 && ((nIdx * 4) / 3) % 76 === 0) { sB64Enc += "\r\n"; } } nUint24 |= aBytes[nIdx] << ((16 >>> nMod3) & 24); if (nMod3 === 2 || aBytes.length - nIdx === 1) { sB64Enc += String.fromCharCode( uint6ToB64((nUint24 >>> 18) & 63), uint6ToB64((nUint24 >>> 12) & 63), uint6ToB64((nUint24 >>> 6) & 63), uint6ToB64(nUint24 & 63) ); nUint24 = 0; } } const pad = l => (l === 0 ? '' : l === 1 ? '==' : '='); return sB64Enc + pad(aBytes.length % 3); })38:T43a,viewof base64Decode = def`function base64Decode(str) => ArrayBuffer: Decode a base64 string to an ArrayBuffer `(str => { const pad = str.endsWith('==') ? 2 : str.endsWith('=') ? 1 : 0; const b64ToUint6 = nChr => nChr > 64 && nChr < 91 ? nChr - 65 : nChr > 96 && nChr < 123 ? nChr - 71 : nChr > 47 && nChr < 58 ? nChr + 4 : nChr === 43 ? 62 : nChr === 47 ? 63 : 0; const sB64Enc = str.replace(/[^A-Za-z0-9\+\/]/g, ""); const nInLen = sB64Enc.length; const nOutLen = Math.floor((nInLen * 3) / 4) - pad; const aBytes = new Uint8Array(nOutLen); for ( var nMod3, nMod4, nUint24 = 0, nOutIdx = 0, nInIdx = 0; nInIdx < nInLen; nInIdx++ ) { nMod4 = nInIdx & 3; nUint24 |= b64ToUint6(sB64Enc.charCodeAt(nInIdx)) << (18 - 6 * nMod4); if (nMod4 === 3 || nInLen - nInIdx === 1) { for (nMod3 = 0; nMod3 < 3 && nOutIdx < nOutLen; nMod3++, nOutIdx++) { aBytes[nOutIdx] = (nUint24 >>> ((16 >>> nMod3) & 24)) & 255; } nUint24 = 0; } } return aBytes.buffer; })39:[] 2f:{"id":"10ca265cf0ddc43e","slug":"utilities","title":"utilities","thumbnail":"c6b3f1f8e12126132dedaed4ce29b7dd2a4aada4f26f3df72932fbebedef12b8","access_level":"public","create_time":"$D2019-12-02T20:08:26.558Z","update_time":"$D2020-08-29T15:39:26.741Z","view_time":null,"first_public_time":"$D2019-12-02T20:28:05.486Z","fork":false,"stars":2,"starred":false,"owner":{"type":"team","id":"a2a391e81ef70f60","login":"bobkerns","name":"Bob Kerns","avatar_url":"https://avatars-next.observableusercontent.com/d3d634f0561198d48f6c5a897f4009b95f14b0014fb7d85f3b6cc5415336b639","tier":"starter_2024"},"version":1080,"publish_version":1080,"role":null,"authored":false,"authors":[{"type":"individual","id":"c30fe465bb675dbe","login":"bobkerns","name":"Bob Kerns","avatar_url":"https://avatars-next.observableusercontent.com/d3d634f0561198d48f6c5a897f4009b95f14b0014fb7d85f3b6cc5415336b639","tier":null}],"members":[{"type":"individual","id":"c30fe465bb675dbe","login":"bobkerns","name":"Bob Kerns","avatar_url":"https://avatars-next.observableusercontent.com/d3d634f0561198d48f6c5a897f4009b95f14b0014fb7d85f3b6cc5415336b639","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"title":"utilities","cells":[{"id":0,"value":"md`# utilities`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":2,"value":"md`Various common utilities`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":6,"value":"viewof range = def`function range(_start = 0, end = %{\\infty%}, step = 1_):\n> Returns a generator producing numbers from _start_ to _end_, incremented by _step_.\n\n>With no arguments, producees the positive integers.\n* _start_: The starting value for the sequence. Default = 0.\n* _end_: The ending value for the sequence.The generator halts when this value is reached or exceeded, in the direction of _step_. Deaults to +%{\\infty%}.\n* _step_: How much the numbers increment. May be positive or negative; this controls the interpretation of _end_ as maximum or minimum limit. Zero is forbidden because it would probably not be what was intended.\n`(\n //\n function* range(start = 0, end = Number.MAX_SAFE_INTEGER, step = 1) {\n let x = start;\n if (step > 0) {\n while (x < end) {\n yield x;\n x += step;\n }\n } else if (step < 0) {\n while (x > end) {\n yield x;\n x += step;\n }\n } else {\n throw new Error(\"Step must not be zero.\");\n }\n }\n)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":626,"value":"viewof map = def`async generator function map(iter, transform):\nLike \\`Generators.map\\` except works with async generators.`(\n async function* map(iterator, transform) {\n var result,\n index = -1;\n while (!(result = await iterator.next()).done) {\n yield await transform(await result.value, ++index);\n }\n }\n)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":735,"value":"viewof raceAll = def`async generator function raceAll(promises):\nReturn an async generator that returns all the results of the promises in the order they resolve.\n`(async function* raceAll(promises) {\n console.log('raceAll');\n const candidates = [\n ...promises.map((p, i) => Promise.resolve(p).then(v => [v, i]))\n ];\n let count = candidates.length;\n let next = null;\n const pending = filter(nonNil);\n while (count > 0) {\n const [v, i] = await Promise.race(pending(candidates));\n candidates[i] = null;\n count--;\n yield v;\n }\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":635,"value":"viewof memoize = def`function memoize(fn, envFn):\nReturn a memoized function; one that avoids recomputing the same value by caching.\n* \\`fn\\`: The function to be memoized.\n* \\`envFn\\`: An optional function that returns a list of global values \\`fn\\` may depend on. It receives the arguments to \\`fn\\` as an argument, and should generally include them or subvalues of them in the result.\n`((fn, envFn = args => [...args]) => {\n const cache = new Map();\n const sym = Symbol.for('value');\n const find = (fn, args) =>\n args.reduce(\n (m, a) => (m.has(a) ? m.get(a) : (m.set(a, new Map()), m.get(a))),\n cache\n );\n return (...args) => {\n const end = find(fn, envFn(args));\n if (end.has(sym)) {\n return end.get(sym);\n } else {\n const value = fn(...args);\n end.set(sym, value);\n return value;\n }\n };\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":8,"value":"viewof idGen = def`function idGen(prefix = 'gen', sep='-'):\n>Generate a sequence of ID's, unique to each prefix.\n`(\n //\n function idGen(prefix = 'gen', sep = '-') {\n const seqs = idGen.seqs || (idGen.seqs = {});\n const seq =\n seqs[prefix] || (seqs[prefix] = range(0, Number.MAX_SAFE_INTEGER));\n return `${prefix}${sep}${seq.next().value}`;\n }\n)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":118,"value":"viewof makeValidId = def`function makeValidId(prefix):\nSanitize a user-supplied ID for use in the class attribute.\n* _prefix_: The user-supplied value which may not follow the rules\nfor class Ids`(prefix =>\n (/^[a-zA-Z-][a-zA-Z0-9_][a-zA-Z0-9_-]*$/.test(prefix)\n ? prefix\n : `T-${prefix}`\n )\n .replace(/[^a-zA-Z0-9-_]+/g, '-')\n .replace(/[-_][-_]+/g, '-')\n .replace(/-$/, '')\n)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":103,"value":"viewof clsIdGen = def`function clsIdGen(prefix='Test'):\nGenerate a sequence of ID's, unique to each prefix, sanitized for\nuse as class ID's in HTML.\n* _prefix_: The starting portion of the series' strings.\n`((prefix = 'Test') => idGen(makeValidId(prefix)))","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":140,"value":"viewof ago = {\n async function* ago(time = Date.now(), units = defaultTimeUnits, sep = ' ') {\n for await (const v of agoTimes(time)) {\n yield v[2] === 'just now' ? 'just now' : `${v[0]}${sep}${v[2]}`;\n await Promises.delay(v[2]);\n }\n }\n const d = def`function ago(time = Date.now):\nGenerate an infinite series of values of the form:\n* just now\n* n seconds\n* n minutes\n* n hours\n\n>> \\`ago()\\` ==> ${liveData(ago)}\n\n...\nThe results are available at appropriate intervals.\n`;\n return d(ago);\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":176,"value":"$31","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":331,"value":"$32","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":339,"value":"viewof defaultTimeUnits = def`defaultTimeUnits = \\`timeUnits.english.short\\`\nChanging these affects the default for time functions like 'ago'`(\n timeUnits.english.short\n)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":158,"value":"$33","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":356,"value":"$34","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":463,"value":"viewof queue1 = def`function queue1():\nReturn queue of maximum length 1, which discards older values.\n`(() => {\n let value,\n empty = true;\n const obj = {};\n Reflect.defineProperty(obj, 'length', { get: () => (empty ? 0 : 1) });\n Reflect.defineProperty(obj, 'push', {\n value: v => {\n empty = false;\n value = v;\n return 1;\n }\n });\n Reflect.defineProperty(obj, 'shift', {\n value: () => {\n empty = true;\n const tmp = value;\n value = undefined;\n return tmp;\n }\n });\n Reflect.defineProperty(obj, 'clear', {\n value: () => {\n empty = true;\n value = undefined;\n }\n });\n return obj;\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":468,"value":"viewof queueSticky = def`function queueSticky():\nReturn queue of maximum length 1, which discards older values, but returns\nthe last seen forever (until cleared).\n`(() => {\n let value,\n empty = true;\n const obj = {};\n Reflect.defineProperty(obj, 'length', { get: () => (empty ? 0 : 1) });\n Reflect.defineProperty(obj, 'push', {\n value: v => {\n empty = false;\n value = v;\n return 1;\n }\n });\n Reflect.defineProperty(obj, 'shift', {\n value: () => {\n return value;\n }\n });\n Reflect.defineProperty(obj, 'clear', {\n value: () => {\n empty = true;\n value = undefined;\n }\n });\n return obj;\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":472,"value":"viewof queueOldest = def`function queueOldest(n):\nReturn queue of maximum length _n_, which discards newer values.\n`(n => {\n const fn = n => () => {\n const queue = new Denque();\n const obj = {};\n Reflect.defineProperty(obj, 'length', { get: () => queue.length });\n Reflect.defineProperty(obj, 'push', {\n value: v => {\n if (queue.length < n) {\n return queue.push(v);\n }\n // Otherwise, we let it drop.\n return queue.length;\n }\n });\n Reflect.defineProperty(obj, 'shift', {\n value: () => queue.shift()\n });\n Reflect.defineProperty(obj, 'clear', {\n value: () => queue.clear()\n });\n return obj;\n };\n if (n === undefined) {\n // Called without specifying a length, just return a size=1 queue.\n return fn(1)();\n }\n // Return a function to construct queues of the specified size.\n return fn(n);\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":484,"value":"viewof queueNewest = def`function queueNewest(n):\nReturn queue of maximum length _n_, which discards older values.\n`(n => {\n const fn = n => () => {\n const queue = new Denque();\n const obj = {};\n Reflect.defineProperty(obj, 'length', { get: () => queue.length });\n Reflect.defineProperty(obj, 'push', {\n value: v => {\n while (queue.length >= n) {\n queue.shift();\n }\n return queue.push(v);\n }\n });\n Reflect.defineProperty(obj, 'shift', {\n value: () => queue.shift()\n });\n Reflect.defineProperty(obj, 'clear', {\n value: () => queue.clear()\n });\n return obj;\n };\n if (n === undefined) {\n // Called without specifying a length, just return a size=1 queue.\n return fn(1)();\n }\n // Return a function to construct queues of the specified size.\n return fn(n);\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":556,"value":"TESTS.add({\n id: 'queueNewest-1',\n test() {\n const q = queueNewest(2)();\n [8, 7, 48, 3, 7].map(n => q.push(n));\n const s1 = [q.shift(), q.shift(), q.shift()];\n [44, 23, 5, 8].map(n => q.push(n));\n const s2 = [q.shift(), q.shift(), q.shift()];\n console.log('expect', [...s1, ...s2]);\n return [...s1, ...s2];\n },\n expect(expect) {\n expect.toEqual([3, 7, undefined, 5, 8, undefined]);\n }\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":501,"value":"$35","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":542,"value":"TESTS.add([\n {\n id: 'unique-newest',\n test() {\n const q = queueUnique({ newest: true })();\n q.push(3), q.push(7), q.push(3), q.push(3);\n return [q.shift(), q.shift(), q.shift()];\n },\n expect(expect) {\n expect.toEqual([7, 3, undefined]);\n }\n },\n {\n id: 'unique-oldest',\n test() {\n const q = queueUnique({ newest: false })();\n q.push(3), q.push(7), q.push(3), q.push(3);\n return [q.shift(), q.shift(), q.shift()];\n },\n expect(expect) {\n expect.toEqual([3, 7, undefined]);\n }\n }\n])","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":566,"value":"$36","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":579,"value":"objectDiff3 = (base, mods, nval) => {\n Object.keys(nval).forEach(k => {\n const valk = nval[k];\n if (Reflect.has(mods, k)) {\n mods[k] = valk;\n } else if (base[k] !== valk) {\n mods[k] = valk;\n }\n });\n Object.keys(base).forEach(k => {\n const oldk = base[k];\n if (oldk !== undefined) {\n const valk = nval[k];\n if (valk === undefined) {\n mods[k] = undefined;\n }\n }\n });\n return mods;\n}","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":584,"value":"TESTS.add([\n {\n id: 'objectDiff3-trivial',\n test() {\n return objectDiff3({}, {}, {});\n },\n expect(v) {\n v.toEqual({});\n }\n },\n {\n id: 'objectDiff3-add',\n test() {\n return objectDiff3({}, {}, { a: 5 });\n },\n expect(v) {\n v.toEqual({ a: 5 });\n }\n },\n {\n id: 'objectDiff3-remove',\n test() {\n return objectDiff3({ a: 7 }, {}, {});\n },\n expect(v) {\n v.toEqual({ a: undefined });\n v.toHaveProperty('a');\n }\n }\n])","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":698,"value":"viewof isFunction = def`function isFunction(f):\nReturn \\`true\\` if the argument is a function.\n`(f => typeof f === 'function')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":779,"value":"viewof scrollIntoView = def`function scrollIntoView(hash):\n* _hash_: Scroll the element ID _hash_ into view. If _hash_ begins with \\`'#'\\`, it is\n removed first.\n`(hash => {\n const nhash = hash.startsWith('#') ? hash.substr(1) : hash;\n const elt = nhash && document.getElementById(nhash);\n if (elt) {\n console.log('scrollIntoView', elt);\n elt.scrollIntoView();\n } else {\n console.log('scrollIntoView', `not found: id=${nhash}`);\n }\n})","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":772,"value":"viewof trackHash = def`generator function trackHash(autoscroll):\nTrack the value of the window's URL hash.\n* _autoscroll_: If \\`true\\`, and the hash names the id of an element, scroll it into view automatically\n on page load. If \\`always\\`, do it whenever it is changed.\n* _delay_=\\`200\\`: Delay for this many ms before scrolling to the element. This allows the DOM\n to settle, if it is being modified. Slow-loading pages may wish to increase this.\n`((autoscroll, delay = 200) =>\n Generators.observe(change => {\n const scroll = flag => async () => {\n if (flag) {\n // On load, it might not be added to the DOM yet depending on the dependency graph, etc.\n await Promises.delay(delay);\n scrollIntoView(window.location.hash);\n }\n };\n change(window.location.hash);\n const wscroll = scroll(autoscroll === 'always');\n window.onhashchange = () => (change(window.location.hash), wscroll());\n return scroll(autoscroll);\n })\n)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":776,"value":"hash = trackHash('always')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":894,"value":"def`function callSite(stringOrArray):\nPrepare a string or array for passing to a backtick interpolator.\n`(callSite)","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1068,"value":"callSite = s => (a => (a.raw = a.raw || a))(s instanceof Array ? s : [s])","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":900,"value":"$37","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":929,"value":"$38","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":950,"value":"TESTS.add([\n {\n id: 'base64Encode/Decode 6char',\n data: Uint8Array.of(...[...'foobar'].map(c => c.charCodeAt(0))),\n test() {\n return new Uint8Array(base64Decode(base64Encode(this.data)));\n },\n expect(e) {\n e.toEqual(this.data);\n }\n },\n {\n id: 'base64Encode/Decode 7char',\n data: Uint8Array.of(...[...'fooXbar'].map(c => c.charCodeAt(0))),\n test() {\n return new Uint8Array(base64Decode(base64Encode(this.data)));\n },\n expect(e) {\n e.toEqual(this.data);\n }\n },\n {\n id: 'base64Encode/Decode 8char',\n data: Uint8Array.of(...[...'fooXXbar'].map(c => c.charCodeAt(0))),\n test() {\n return new Uint8Array(base64Decode(base64Encode(this.data)));\n },\n expect(e) {\n e.toEqual(this.data);\n }\n }\n])","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":560,"value":"md`## Test Summary`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":563,"value":"TESTS.summary()","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":9,"value":"md`## Appendix`","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":13,"value":"import { def, applyFormats } from '@bobkerns/def'","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":534,"value":"import { TESTS, test_styles, expect } from '@bobkerns/literate-tests'","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":737,"value":"import { filter } from '@bobkerns/ramda-0-25'","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":754,"value":"import { nonNil, log } from '@bobkerns/ramda-aux'","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":1062,"value":"base64Encode(Uint8Array.of(0, 0, 0))","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":547,"value":"md`${test_styles}`","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":189,"value":"d3 = require('d3@5')","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"},{"id":441,"value":"Denque = require('denque@1.4.1/index.js').catch(() => window[\"Denque\"])","pinned":false,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","output":"$undefined","database":"$undefined"}],"files":"$W39","stdlib":"1","titling":"auto"}} 30:"$2f:body"