30:T7d6,renderInput = (s, { label = "input" } = {}) => { const { classNames } = useScope(); const lines = s.trim().split(/(?<=\n)/); const renderToken = (token, classNames = "") => htl.html.fragment`${token}`; const renderLine = (line) => { const tokens = line.split(/(\s+)/); const spans = tokens.map((token) => { if (!token.trim()) { if (token === "\n") { return renderToken(token.replace(/\s/g, "↵"), classNames.whitespace); } else { return renderToken(token.replace(/\s/g, "•"), classNames.whitespace); } } else { return renderToken(token); } }); return htl.html.fragment`${spans}`; }; const element = htl.html`

  ${label} (${s.length} characters, ${
    lines.length
  } lines)
  
    ${lines.map((line) => renderLine(line))}

`; element.value = s; return element; }31:T9a8,async function* resultTable({ parse, inputs, parts, expected, skip = [] }) { function render(data) { return htl.html` ${parts.map( (d, i) => htl.html`` )} ${Object.entries(data).map( ([k, v]) => htl.html` ${v.map((d) => { return htl.html``; })} ` )}

Case	Part ${i + 1}
${k}	${ d.duration !== undefined ? htl.html`(${d.duration.toFixed( 1 )}ms)` : "" } ${ !d.running && !d.error && d.expected !== undefined && d.actual !== undefined ? d.expected === d.actual ? "✅" : "❌" : "" } ${d.running ? "⏰" : d.error ?? d.actual} ${ d.skip ? htl.html`N/A` : "" }

`; } let results = Object.fromEntries( Object.keys(inputs).map((name) => [ name, parts.map((d, idx) => ({ expected: expected?.[name]?.[idx], actual: undefined, error: undefined, running: false })) ]) ); yield render(results); for (const [name, input] of Object.entries(inputs)) { for (const [part, idx] of Array.from(parts, (d, i) => [d, i])) { let target = results[name][idx]; if (skip.some((s) => s.input === name && s.part === idx + 1)) { target.skip = true; continue; } target.running = true; yield render(results); let start = performance.now(); let parsed = parse(input); try { target.actual = await part(parsed); } catch (err) { target.error = err; } let end = performance.now(); target.duration = end - start; target.running = false; yield render(results); } } }32:T440,bannerOld = (year = 2022, day = 1, lang = "en") => { const d = { en: "Day", ru: "День" }; const height = (width / 16) * 1; const banner = d3 .create("svg") .attr("width", width) .attr("height", height) .style("background-color", "black"); const style = banner.html(` `); const defs = banner.append("defs"); const text = `Advent of Code 20${year.toString().slice(-2)} – ${ d[lang] } ${day}`; blurrer(defs, 5); banner .append("text") .text(text) .attr("filter", "url(#blurme)") .attr("x", 20) .attr("y", height / 2) .style("fill", "white") .style("font-size", 44) .style("font-family", "Source Code Pro") .style("alignment-baseline", "central"); banner .append("text") .text(text) .attr("x", 20) .attr("y", height / 2) .style("fill", "lime") .style("font-size", 44) .style("font-family", "Source Code Pro") .style("alignment-baseline", "central"); return banner.node(); }33:T49e,filter = ({ defs, flood = "lime", id, radius = 4, blur = 6, opacity = 0.5 }) => { const filter = defs .append("filter") .attr("id", id) .attr("y", "-50%") .attr("height", "200%"); // thicken the original filter .append("feMorphology") .attr("operator", "dilate") .attr("radius", radius) .attr("in", "SourceAlpha") .attr("result", "thickened"); // blur the thickened filter .append("feGaussianBlur") .attr("stdDeviation", blur) .attr("in", "thickened") .attr("result", "blurred"); // flood the area with the glow color filter .append("feFlood") .attr("flood-color", flood) .attr("flood-opacity", opacity) .attr("result", "flooded"); // composite the thickened blurred, effectively masking the flood filter .append("feComposite") .attr("operator", "in") .attr("in", "flooded") .attr("in2", "blurred") .attr("result", "outline"); // layer the crisp text on top of the background glow (only needed when merging > 1 layers) // const merge = filter // .append("feMerge") // ; // merge // .append("feMergeNode") // .attr("in", "outline") // ; }34:[] 2e:{"title":"AOC Utilities","cells":[{"id":0,"value":"# AOC Utilities\n\n*A collection of utilities for common [Advent of Code](https://adventofcode.com) operations all protected in the AOC namespace. Tnanks [Jo Wood](https://observablehq.com/@jwolondon).*","pinned":false,"hidden":false,"mode":"md"},{"id":416,"value":"## Functional Utilities","pinned":false,"hidden":false,"mode":"md"},{"id":774,"value":"The identity function returns its argument. Useful for some functional operations such as filtering an array of booleans.","pinned":false,"hidden":false,"mode":"md"},{"id":417,"value":"Easy creation of partial functions and currying. Given a function with n parameters, create a new function with n-1 parameters when the first argument is provided. For example,\n\n const add = (a, b) => a + b;\n const addFive = partial(add, 5);\n addFive(10);\n\nTo supply more than one parameter, nest the partial applications.`","pinned":false,"hidden":false,"mode":"md"},{"id":420,"value":"function partial(fn, firstArg) {\n return (...lastArgs) => fn(firstArg, ...lastArgs);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":362,"value":"## Parsing","pinned":false,"hidden":false,"mode":"md"},{"id":369,"value":"Convert text into an array of numbers. Assumes input is numbers, one per line.","pinned":false,"hidden":false,"mode":"md"},{"id":1473,"value":"identity = (d) => d","pinned":false,"hidden":false,"mode":"ojs"},{"id":363,"value":"function linesToNumbers(str) {\n return str.split('\\n').map(Number);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1471,"value":"stringPrep = (s) => s.trim().replace(/\\r/g, \"\")","pinned":false,"hidden":false,"mode":"ojs"},{"id":1476,"value":"function lines(accessor = identity) {\n return (s) => stringPrep(s).split(\"\\n\").map(accessor);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1478,"value":"paragraphLines = (lineMapper) =>\n paragraphs((p) => p.split(\"\\n\").map(lineMapper))","pinned":false,"hidden":false,"mode":"ojs"},{"id":1481,"value":"function paragraphs(paragraphMapper = identity) {\n return (s) => stringPrep(s).split(\"\\n\\n\").map(paragraphMapper);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1497,"value":"Parse all integers from string into array of numbers.","pinned":false,"hidden":false,"mode":"md"},{"id":1495,"value":"integers = (sentence) => {\n const words = sentence.split(\" \");\n return words\n .filter(function (w) {\n return w.match(/\\d+/);\n })\n .map(Number);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1536,"value":"## Math","pinned":false,"hidden":false,"mode":"md"},{"id":1528,"value":"function mod(a, b) {\n while (a < 0) {\n a += b;\n }\n return a % b;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":379,"value":"## Array Functions","pinned":false,"hidden":false,"mode":"md"},{"id":385,"value":"Sum and product of an array of numbers:","pinned":false,"hidden":false,"mode":"md"},{"id":380,"value":"function sum(xs) {\n return xs.reduce((a, b) => a + b, 0);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":387,"value":"function product(xs) {\n return xs.reduce((a, b) => a * b, 1);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1523,"value":"function gcd(...xs) {\n function _gcd(a, b) {\n return !b ? a : gcd(b, a % b);\n }\n return xs.reduce((acc, n) => _gcd(acc, n));\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1526,"value":"function lcm(...xs) {\n return xs.reduce((acc, n) => (acc * n) / gcd(acc, n));\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":397,"value":"Numerical sorting (default JavaScript array sort is lexicographical). Sort order will be ascending unless the optional second parameter is true, in which case order will be descending:","pinned":false,"hidden":false,"mode":"md"},{"id":398,"value":"function sort(xs, desc = false) {\n return desc ? xs.sort((a, b) => b - a) : xs.sort((a, b) => a - b);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1396,"value":"Generate a range of integers between the given pair of values inclusive.","pinned":false,"hidden":false,"mode":"md"},{"id":1399,"value":"function range(a, b) {\n const [mn, mx] = [Math.min(a, b), Math.max(a, b)];\n const arr = [...Array(mx - mn + 1).keys()].map((x) => x + mn);\n return a < b ? arr : arr.reverse();\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":717,"value":"Split an array at the given (zero-indexed) position creating two new arrays. For example, `splitAt(3,[1,2,3,4,5])` would create `[[1,2,3],[4,5]]`. Negative positions will set the split point relative to the end of the array.","pinned":false,"hidden":false,"mode":"md"},{"id":1322,"value":"Median value of an array. If there are an even number of items, the left of the two central values is returned.","pinned":false,"hidden":false,"mode":"md"},{"id":1325,"value":"function median(xs) {\n const sorted = sort(xs.map(identity)); // Copy array so original is not sorted.\n\n return sorted[Math.floor((sorted.length - 1) / 2)];\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":721,"value":"function splitAt(i, xs) {\n return [xs.slice(0, i), xs.slice(i)];\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":733,"value":"Group consecutive elements in a list. For example, `[ 1, 2, 2, 3, 1, 1, 1, 2 ]` becomes `[[1], [2,2], [3], [1,1,1], [2]]`","pinned":false,"hidden":false,"mode":"md"},{"id":737,"value":"function group(xs) {\n const grp = (grps, x) => {\n const prev = grps[grps.length - 1];\n if (!prev || prev[prev.length - 1] != x) {\n grps.push([x]);\n } else {\n grps[grps.length - 1].push(x);\n }\n return grps;\n };\n return xs.reduce(grp, []);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":763,"value":"Count the number of occurrences of `y` in an array:","pinned":false,"hidden":false,"mode":"md"},{"id":762,"value":"function occurrences(y, xs) {\n return xs.reduce((total, c) => (c === y ? total + 1 : total), 0);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":778,"value":"Clone an array. This will deep copy multi-dimenisonal arrays but assumes that all array elements are themselves arrays or primitives:","pinned":false,"hidden":false,"mode":"md"},{"id":779,"value":"function cloneArray(arr) {\n const clone = [];\n arr.forEach(v => {\n if (Array.isArray(v)) {\n clone.push(cloneArray(v));\n } else {\n clone.push(v);\n }\n });\n return clone;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":827,"value":"Chunk an array into an array of arrays of a given size. This leaves the original array intact and creates a shallow copy in the chunked array:","pinned":false,"hidden":false,"mode":"md"},{"id":830,"value":"function chunk(arr, n) {\n return arr.reduce(\n (chunk, val) => {\n if (chunk[chunk.length - 1].length === n) {\n chunk.push([]);\n }\n chunk[chunk.length - 1].push(val);\n return chunk;\n },\n [[]]\n );\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":863,"value":"Tests whether two arrays are equal. Assumes arrays contain either primitives or are nested arrays of primitives:","pinned":false,"hidden":false,"mode":"md"},{"id":868,"value":"function equalArrays(a, b) {\n if (Array.isArray(a)) {\n return (\n Array.isArray(b) &&\n a.length === b.length &&\n a.every((val, index) => equalArrays(val, b[index]))\n );\n }\n return a === b;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":907,"value":"Create a new array by taking values from a given one while the given predicate is true. As soon as it becomes false, no more values will be copied.","pinned":false,"hidden":false,"mode":"md"},{"id":910,"value":"function takeWhile(fn, arr) {\n const recur = (a, acc) => {\n const [x, ...xs] = a;\n if (a.length > 0 && fn(x)) {\n return recur(xs, [...acc, x]);\n } else {\n return acc;\n }\n };\n return recur(arr, []);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":965,"value":"Map the values of two arrays with a given two-parameter function to produce a new array. If the input arrays are of different lengths, the resulting array will be the size of the smaller of two.","pinned":false,"hidden":false,"mode":"md"},{"id":968,"value":"function map2(xs, ys, fn) {\n const arr = [];\n for (let i = 0; i < Math.min(xs.length, ys.length); i++) {\n arr.push(fn(xs[i], ys[i]));\n }\n return arr;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1307,"value":"## Frequency Distributions\n\nAllow the accumulation of frequencies of any primitives in a [Map](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Map).","pinned":false,"hidden":false,"mode":"md"},{"id":1310,"value":"function addToFreqTable(freqTable, v, n = 1) {\n const freq = freqTable.get(v);\n return freqTable.set(v, freq ? freq + n : n);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":816,"value":"## Grid Functions\n\nConvenince functions that work on 2d arrays of primitives. Useful for raster processing.","pinned":false,"hidden":false,"mode":"md"},{"id":1314,"value":"Initialise a grid with the given number of rows and columns and the given value. Fills the grid with 0s if not specified.","pinned":false,"hidden":false,"mode":"md"},{"id":1317,"value":"function gInit(nRows, nCols, val = 0) {\n const grid = [];\n\n for (let row = 0; row < nRows; row++) {\n grid[row] = [];\n for (let col = 0; col < nCols; col++) {\n grid[row][col] = val;\n }\n }\n return grid;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":819,"value":"Map the values of a 2d grid with the given function returning a new grid with the mapped values:","pinned":false,"hidden":false,"mode":"md"},{"id":822,"value":"function gMap(fn, grid) {\n return chunk(grid.flat().map(fn), grid[0].length);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":850,"value":"Map the values of a 2d grid with the given function `f(row,col,val)` where _row_ and _col_ are the grid location and `val` is the grid value at that location:","pinned":false,"hidden":false,"mode":"md"},{"id":853,"value":"function gMapWithLocation(fn, grid) {\n const numRows = grid.length;\n const numCols = grid[0].length;\n const g2 = [];\n for (let row = 0; row < numRows; row++) {\n const r = [];\n for (let col = 0; col < numCols; col++) {\n r.push(fn(row, col, grid[row][col]));\n }\n g2.push(r);\n }\n return g2;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":509,"value":"## Set Functions\n\nWhile ES6 has a [Set](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Set) object, it lacks some basic bulk set operations. These are added here as convenience functions. Partially based on these [set functions](https://exploringjs.com/impatient-js/ch_sets.html).","pinned":false,"hidden":false,"mode":"md"},{"id":549,"value":"Union of sets `a` and `b`:","pinned":false,"hidden":false,"mode":"md"},{"id":512,"value":"function union(a, b) {\n return new Set([...a, ...b]);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":553,"value":"Union of an array of sets:","pinned":false,"hidden":false,"mode":"md"},{"id":522,"value":"function unions(ss) {\n return ss.reduce(union, new Set());\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":556,"value":"Intersection of sets `a` and `b`:","pinned":false,"hidden":false,"mode":"md"},{"id":516,"value":"function intersection(a, b) {\n return new Set([...a].filter(x => b.has(x)));\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":560,"value":"Intersection of an array of sets:","pinned":false,"hidden":false,"mode":"md"},{"id":530,"value":"function intersections(ss) {\n return ss.slice(1).reduce(intersection, ss[0]);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":564,"value":"Set of items in set `a` that are not in set `b`:","pinned":false,"hidden":false,"mode":"md"},{"id":519,"value":"function difference(a, b) {\n return new Set([...a].filter(x => !b.has(x)));\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":590,"value":"Map the contents of a set with a given function:","pinned":false,"hidden":false,"mode":"md"},{"id":594,"value":"function mapSet(a, fn) {\n return new Set([...a].map(fn));\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":603,"value":"Filter a set with the given predicate function:","pinned":false,"hidden":false,"mode":"md"},{"id":607,"value":"function filterSet(a, fn) {\n return new Set([...a].filter(fn));\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":617,"value":"## Combinatorics","pinned":false,"hidden":false,"mode":"md"},{"id":684,"value":"Choose all combinations of size `k` from a given array of items:","pinned":false,"hidden":false,"mode":"md"},{"id":686,"value":"function combinations(k, xs, prefix = []) {\n if (k == 0) {\n return [prefix];\n }\n return xs.flatMap((x, i) =>\n combinations(k - 1, xs.slice(i + 1), [...prefix, x])\n );\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1033,"value":"All permutations of a given array of items:","pinned":false,"hidden":false,"mode":"md"},{"id":1040,"value":"function permutations(xs) {\n const result = [xs.slice()];\n const len = xs.length;\n const c = new Array(len).fill(0);\n let i = 1;\n\n while (i < len) {\n if (c[i] < i) {\n const k = i % 2 && c[i];\n const p = xs[i];\n xs[i] = xs[k];\n xs[k] = p;\n c[i]++;\n i = 1;\n result.push(xs.slice());\n } else {\n c[i] = 0;\n i++;\n }\n }\n return result;\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1123,"value":"Cartesian product of any number of arrays:","pinned":false,"hidden":false,"mode":"md"},{"id":1127,"value":"function cartesianProduct(...arrays) {\n return arrays.reduce((xs, ys) =>\n xs.flatMap((x) => ys.map((y) => [x, y].flat()))\n );\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":919,"value":"## Number Conversion\n\nSafe conversion between different bases.","pinned":false,"hidden":false,"mode":"md"},{"id":939,"value":"Convert a decimal number to a binary string. Can optionally specify the minimum number of digits. e.g. `dec2binary(127,32)` will produce `00000000000000000000000001111111`. If the number contains any digits after a decimal point, they are ignored. Negative numbers will be represented with 2s complement, e.g. `dec2binary(-1)` will produce `11111111111111111111111111111111`.","pinned":false,"hidden":false,"mode":"md"},{"id":920,"value":"function decToBinary(dec, digits = 0) {\n const padDigit = dec < 0 ? '1' : '0';\n // Unsigned right-shift by 0 positions coerces the number into an unsigned integer.\n return (dec >>> 0).toString(2).padStart(digits, padDigit);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":311,"value":"## General Utilities","pinned":false,"hidden":false,"mode":"md"},{"id":1299,"value":"### Assertions\n\nCompare observed with expected results. Useful for refactoring when we want to confirm we haven't introduced any regressions. Thanks [@martien](https://observablehq.com/@martien) for the suggestion.","pinned":false,"hidden":false,"mode":"md"},{"id":1302,"value":"function assert(\n obs,\n exp = \"value not yet provided\",\n msg = \"❌ Assertion failed\"\n) {\n if (obs === exp) {\n return md`✅`;\n } else {\n throw msg + `: expected ${exp}, while observed value was ${obs}.`;\n }\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1459,"value":" ### Render Input\nThanks [@senritsu](https://observablehq.com/@senritsu)","pinned":false,"hidden":false,"mode":"md"},{"id":1457,"value":"$30","pinned":false,"hidden":false,"mode":"ojs"},{"id":1464,"value":"useScope = () => {\n const hash = crypto.randomUUID();\n const scoped = (classNames) =>\n typeof classNames === \"string\"\n ? classNames\n .split(/\\s+/)\n .map((name) => `${name}-${hash}`)\n .join(\" \")\n : R.map(scoped, classNames);\n\n const classNames = new Proxy(\n {},\n {\n get(target, prop, receiver) {\n return scoped(prop);\n }\n }\n );\n\n return { hash, scoped, classNames };\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1466,"value":"R = import(\"https://cdn.skypack.dev/rambda@7.4.0?min\")","pinned":false,"hidden":false,"mode":"ojs"},{"id":1411,"value":"### Test Runner\nThanks [@mythmon](https://observablehq.com/@mythmon)","pinned":false,"hidden":false,"mode":"md"},{"id":1407,"value":"$31","pinned":false,"hidden":false,"mode":"ojs"},{"id":1486,"value":"meta = (info) => {\n for (const key of [\"day\", \"parse\", \"inputs\", \"parts\", \"expected\"]) {\n if (!Object.hasOwn(info, key)) throw new Error(`missing meta key ${key}`);\n }\n return {\n year: 2022,\n ...info\n };\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1488,"value":"/**\n * Input: a list of {parse, input, solver, expected} which represents one cell in the table.\n * output: yield one row per input, with the result of evaluating the solver,\n * including any errors, if it matched the expectations, and timing data.\n * Returned in an arbitrary order.\n */\nasync function* genResults(specs) {\n let results = specs.map(({ idObj, expected }) => ({\n ...idObj,\n actual: null,\n error: null,\n duration: null,\n expected,\n state: \"waiting\"\n }));\n\n let indexes = d3.shuffle(Object.keys(specs));\n for (const idx of indexes) {\n const { parse, input, solver, expected, idObj } = specs[idx];\n let r = results[idx];\n r.state = \"running\";\n yield results;\n let start = performance.now();\n try {\n let parsed = parse(input);\n r.actual = solver(parsed);\n r.state = \"done\";\n } catch (err) {\n r.error = err;\n r.state = \"error\";\n }\n r.duration = performance.now() - start;\n yield results;\n }\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":351,"value":"### Timer\n\nFor reporting the time it takes to complete a function. Useful for algorithm efficiency estimation. First parameter is the function to run, the second, its input and the third optional parameter the number of times to call the function (default once). The result is a message reporting the result of the function and the average time for completion in milliseconds`","pinned":false,"hidden":false,"mode":"md"},{"id":2,"value":"function timer(fn, input, repeats = 1) {\n const t0 = performance.now();\n let result;\n for (let i = 0; i < repeats; i++) {\n result = fn(input);\n }\n const t1 = performance.now();\n const time = (t1 - t0) / repeats;\n const dps = time > 0.1 ? (time > 1 ? (time > 10 ? 0 : 1) : 2) : 3;\n return result + \". Completed in \" + time.toFixed(dps) + \" milliseconds.\";\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1283,"value":"### Banner\n\nNice looking banner with `year` and `day` as parameters.","pinned":false,"hidden":false,"mode":"md"},{"id":1424,"value":"banner = ({\n title = \"Advent of Code\",\n story = \"story\",\n year = 22,\n day = 0,\n fill = \"lime\",\n flood = \"red\",\n background = \"black\",\n radius = 6,\n blur = 6,\n opacity = 0.5\n}) => {\n const banner = d3\n .create(\"svg\")\n .attr(\"width\", width)\n .attr(\"height\", (width / 16) * 9)\n .attr(\"viewBox\", [0, 0, 16 * 72, 9 * 72])\n .style(\"background-color\", background);\n\n styleBanner(banner);\n const defs = banner.append(\"defs\");\n head({\n defs,\n title,\n story,\n year: year.toString().padStart(4, \"20\"),\n day: day.toString().padStart(2, \"0\"),\n id: \"advent-of-code\",\n fill\n });\n filter({ defs, id: \"glow\", flood, radius, blur, opacity });\n glow({ sketch: banner, id: \"advent-of-code\", filter: \"glow\" });\n\n return banner.node();\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1279,"value":"$32","pinned":false,"hidden":false,"mode":"ojs"},{"id":1428,"value":"head = ({ defs, title, story, year, day, id, fill }) => {\n const x = M(3);\n const g = defs\n .append(\"g\")\n .attr(\"id\", id)\n .attr(\"fill\", fill)\n .attr(\"transform\", `translate(${x},0)`);\n g.append(\"text\")\n .text(day)\n .attr(\"class\", \"day\")\n .attr(\"y\", M(9))\n .attr(\"dx\", -10);\n g.append(\"text\").text(story).attr(\"class\", \"story\").attr(\"y\", M(3));\n g.append(\"text\")\n .text(year)\n .attr(\"class\", \"anno\")\n .attr(\"y\", M(9))\n .attr(\"dy\", M(2))\n .attr(\"dx\", -2);\n g.append(\"text\")\n .text(title)\n .attr(\"class\", \"head\")\n .attr(\"y\", M(15))\n .attr(\"dy\", -2.0);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1426,"value":"glow = ({ sketch, id, filter }) => {\n sketch.append(\"use\").attr(\"href\", `#${id}`).attr(\"filter\", `url(#${filter})`);\n sketch.append(\"use\").attr(\"href\", `#${id}`);\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1432,"value":"$33","pinned":false,"hidden":false,"mode":"ojs"},{"id":1430,"value":"M = (n = 1) => n * 36","pinned":false,"hidden":false,"mode":"ojs"},{"id":1277,"value":"blurrer = (defs, blur = 3, id = \"blurme\") => \n defs\n .append(\"filter\")\n .attr(\"id\", id)\n .append(\"feGaussianBlur\")\n .attr(\"stdDeviation\", blur)\n ;","pinned":false,"hidden":false,"mode":"ojs"},{"id":1439,"value":"function styleBanner(sketch) {\n sketch.html(`\n`)\n}","pinned":false,"hidden":false,"mode":"ojs"},{"id":1362,"value":"### Title\n\nNice looking capitalized title and link with `year`, `day`, `title` and `lang` as parameters.","pinned":false,"hidden":false,"mode":"md"},{"id":1366,"value":"printTitle = (year = 2022, day = 1, title = \"Unknown Title\", lang) =>\n md`# Advent of Code 20${year.toString().slice(-2)} — ${\n lang === \"ru\" ? \"День\" : \"Day\"\n } ${day}${\n title\n ? \": [\" +\n title\n .split(\" \")\n .map((word) => {\n return word[0].toUpperCase() + word.substring(1);\n })\n .join(\" \") +\n \"](https://adventofcode.com/20\" +\n year.toString().slice(-2) +\n \"/day/\" +\n day +\n \")\"\n : \"\"\n }`","pinned":false,"hidden":false,"mode":"ojs"},{"id":1333,"value":"### Style\n\nMostly for task description.","pinned":false,"hidden":false,"mode":"md"},{"id":1337,"value":"style = () =>\n html`\n`","pinned":false,"hidden":false,"mode":"ojs"},{"id":299,"value":"md`---`\n ","pinned":false,"hidden":false,"mode":"ojs"},{"id":357,"value":"_Place all utility functions in a single AOC object for protected namespace:_","pinned":false,"hidden":false,"mode":"md"},{"id":318,"value":"AOC = ({\n identity: identity,\n lines: lines,\n paragraphs: paragraphs,\n partial: partial,\n linesToNumbers: linesToNumbers,\n integers: integers,\n mod: mod,\n gcd: gcd,\n lcm: lcm,\n sum: sum,\n product: product,\n sort: sort,\n range: range,\n median: median,\n splitAt: splitAt,\n group: group,\n occurrences: occurrences,\n cloneArray: cloneArray,\n chunk: chunk,\n equalArrays: equalArrays,\n takeWhile: takeWhile,\n map2: map2,\n addToFreqTable: addToFreqTable,\n gInit: gInit,\n gMap: gMap,\n gMapWithLocation: gMapWithLocation,\n union: union,\n unions: unions,\n intersection: intersection,\n intersections: intersections,\n difference: difference,\n mapSet: mapSet,\n filterSet: filterSet,\n combinations: combinations,\n permutations: permutations,\n cartesianProduct: cartesianProduct,\n decToBinary: decToBinary,\n resultTable: resultTable,\n genResults: genResults,\n meta: meta,\n renderInput: renderInput,\n assert: assert,\n timer: timer,\n banner: banner,\n title: printTitle,\n style: style\n})","pinned":true,"hidden":false,"mode":"ojs"},{"id":1261,"value":"---\n## Other libraries","pinned":false,"hidden":false,"mode":"md"},{"id":1271,"value":"### Double-ended queue\n\nFast implementation, can be used for standard queues and stacks too. See the [API documentation](https://docs.page/invertase/denque/api) for details.","pinned":false,"hidden":false,"mode":"md"},{"id":1259,"value":"Denque = require(\"denque@2/index.js\").catch(() => window[\"Denque\"])","pinned":false,"hidden":false,"mode":"ojs"}],"files":"$W34","stdlib":"1","titling":"auto"}

${label} (${s.length} characters, ${ lines.length } lines)