30:T790,mouseEventOffset = { // Obtained from: https://github.com/mattdesl/mouse-event-offset // // The MIT License (MIT) Copyright (c) 2014 Matt DesLauriers // // Permission is hereby granted, free of charge, to any person obtaining a // copy of this software and associated documentation files (the "Software"), // to deal in the Software without restriction, including without limitation // the rights to use, copy, modify, merge, publish, distribute, sublicense, // and/or sell copies of the Software, and to permit persons to whom the // Software is furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included // in all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS // OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS // IN THE SOFTWARE. var rootPosition = { left: 0, top: 0 }; function getBoundingClientOffset(element) { if ( element === window || element === document || element === document.body ) { return rootPosition; } else { return element.getBoundingClientRect(); } } function mouseEventOffset(ev, target, out) { target = target || ev.currentTarget || ev.srcElement; if (!Array.isArray(out)) { out = [0, 0]; } var cx = ev.clientX || 0; var cy = ev.clientY || 0; var rect = getBoundingClientOffset(target); out[0] = cx - rect.left; out[1] = cy - rect.top; return out; } return mouseEventOffset; }31:T6fc,almostEqual = { // This module is imported from: https://github.com/scijs/almost-equal // // The MIT License (MIT) // // Copyright (c) 2013 Mikola Lysenko // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to deal // in the Software without restriction, including without limitation the rights // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell // copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN // THE SOFTWARE. function almostEqual (a, b, absoluteError, relativeError) { var d = Math.abs(a - b) if (absoluteError == null) absoluteError = almostEqual.DBL_EPSILON if (relativeError == null) relativeError = absoluteError if(d <= absoluteError) { return true } if(d <= relativeError * Math.min(Math.abs(a), Math.abs(b))) { return true } return a === b } almostEqual.FLT_EPSILON = 1.19209290e-7 almostEqual.DBL_EPSILON = 2.2204460492503131e-16 return almostEqual }32:T8ca,dup = { // Retrieved from: https://github.com/scijs/dup/blob/master/dup.js // // The MIT License (MIT) // // Copyright (c) 2013 Mikola Lysenko // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to deal // in the Software without restriction, including without limitation the rights // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell // copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN // THE SOFTWARE. function dupe_array(count, value, i) { var c = count[i] | 0; if (c <= 0) { return []; } var result = new Array(c), j; if (i === count.length - 1) { for (j = 0; j < c; ++j) { result[j] = value; } } else { for (j = 0; j < c; ++j) { result[j] = dupe_array(count, value, i + 1); } } return result; } function dupe_number(count, value) { var result, i; result = new Array(count); for (i = 0; i < count; ++i) { result[i] = value; } return result; } function dupe(count, value) { if (typeof value === "undefined") { value = 0; } switch (typeof count) { case "number": if (count > 0) { return dupe_number(count | 0, value); } break; case "object": if (typeof count.length === "number") { return dupe_array(count, value, 0); } break; } return []; } return dupe; }33:T5ad,nextPow2 = { // Source from: https://github.com/mikolalysenko/next-pow-2/blob/master/LICENSE // // The MIT License (MIT) // // Copyright (c) 2015 Mikola Lysenko // // Permission is hereby granted, free of charge, to any person obtaining a copy // of this software and associated documentation files (the "Software"), to deal // in the Software without restriction, including without limitation the rights // to use, copy, modify, merge, publish, distribute, sublicense, and/or sell // copies of the Software, and to permit persons to whom the Software is // furnished to do so, subject to the following conditions: // // The above copyright notice and this permission notice shall be included in // all copies or substantial portions of the Software. // // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, // OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN // THE SOFTWARE. return function nextPowTwo (v) { v += v === 0 --v v |= v >>> 1 v |= v >>> 2 v |= v >>> 4 v |= v >>> 8 v |= v >>> 16 return v + 1 } }34:T43b,LICENSE = "mit" /* Copyright (c) 2019 by Ricky Reusser Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"), to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions: The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */35:[] 2e:{"title":"utils","cells":[{"id":0,"value":"md`# utils\n\n## Markup utils`","pinned":false,"hidden":false,"mode":"ojs"},{"id":4,"value":"$$ = tex","pinned":true,"hidden":false,"mode":"ojs"},{"id":5,"value":"$$$ = tex.block","pinned":true,"hidden":false,"mode":"ojs"},{"id":127,"value":"isThumbnailDaemon = !!navigator.userAgent.match('HeadlessChrome')","pinned":true,"hidden":false,"mode":"ojs"},{"id":117,"value":"md`I haven't used this, but I saw this formatting code in [@mootari's notebook](https://observablehq.com/@mootari/codepens-in-observable?collection=@mootari/tools) and knew instantly that I had to have it. So I'm stashing it here for subsequent use and modification.`","pinned":false,"hidden":false,"mode":"ojs"},{"id":196,"value":"sprintf = (await require('sprintf-js@1.1.2/dist/sprintf.min.js')).sprintf","pinned":true,"hidden":false,"mode":"ojs"},{"id":190,"value":"qs = require('qs@6.9.1/dist/qs.js')","pinned":true,"hidden":false,"mode":"ojs"},{"id":121,"value":"function sig(fn, desc = '') {\n const pattern = /\\)(?= *?\\{)/;\n const head = fn.toString().split(pattern, 1)[0] + ')';\n const code = md`\\`\\`\\`javascript\\n${head}\\n\\`\\`\\``;\n return html`

${code}

\n ${desc}\n `;\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":125,"value":"function decodeHash (hash) {\n try {\n var parts = hash.replace(/^#/,'').split('&').map(x => x.split('=').map(x => decodeURIComponent(x)))\n var output = {}\n for (var i = 0; i < parts.length; i++) {\n output[parts[i][0]] = parts[i][1]\n }\n } catch (e) {\n return {}\n }\n return output\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":183,"value":"h = ({ f: 'z', x: [1, 2] })","pinned":true,"hidden":false,"mode":"ojs"},{"id":187,"value":"encodeHash(h)","pinned":true,"hidden":false,"mode":"ojs"},{"id":182,"value":"function encodeHash(hash) {\n const q = new URLSearchParams();\n for (const [key, value] of Object.entries(hash)) {\n q.set(key, value);\n }\n return q.toString();\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":230,"value":"parseQueryString(\"f=z&x=1%2C2\")","pinned":true,"hidden":false,"mode":"ojs"},{"id":216,"value":"parseQueryString = {\n return function parseQueryString(str) {\n let asNumber;\n const q = new URLSearchParams(str);\n const obj = {};\n for (let [key, value] of q.entries()) {\n if (value.length === 0 || value === \"true\") {\n value = true;\n } else if (value === \"false\") {\n value = false;\n } else if (!isNaN((asNumber = parseFloat(value)))) {\n value = asNumber;\n } else {\n value = decodeURIComponent(value);\n }\n if (obj.hasOwnProperty(key)) {\n if (!Array.isArray(obj[key])) obj[key] = [obj[key]];\n obj[key].push(value);\n } else {\n obj[key] = value;\n }\n }\n return obj;\n };\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":129,"value":"function floatRgbToHex (rgb) {\n return '#' + rgb.map(x => Math.floor(Math.max(0, Math.min(255, x * 255))).toString(16).padStart(2, '0')).join('')\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":148,"value":"function hexRgbToFloat (hex) {\n let match\n if ((match = hex.match(/#([0-9a-fA-F]{2})([0-9a-fA-F]{2})([0-9a-fA-F]{2})/))) {\n return [parseInt(match[1], 16) / 255, parseInt(match[2], 16) / 255, parseInt(match[3], 16) / 255]\n } else if ((match = hex.match(/#([0-9a-fA-F])([0-9a-fA-F])([0-9a-fA-F])/))) {\n return [parseInt(match[1], 16) / 15, parseInt(match[2], 16) / 15, parseInt(match[3], 16) / 15]\n }\n return [0, 0, 0]\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":172,"value":"function hexToFloatRgba(hex, alpha) {\n let match;\n alpha = alpha === undefined ? 1 : +alpha;\n if (\n (match = hex.match(/#([0-9a-fA-F]{2})([0-9a-fA-F]{2})([0-9a-fA-F]{2})/))\n ) {\n return [\n parseInt(match[1], 16) / 255,\n parseInt(match[2], 16) / 255,\n parseInt(match[3], 16) / 255,\n alpha\n ];\n } else if ((match = hex.match(/#([0-9a-fA-F])([0-9a-fA-F])([0-9a-fA-F])/))) {\n return [\n parseInt(match[1], 16) / 15,\n parseInt(match[2], 16) / 15,\n parseInt(match[3], 16) / 15,\n alpha\n ];\n }\n return [0, 0, 0, alpha];\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":207,"value":"$30","pinned":true,"hidden":false,"mode":"ojs"},{"id":14,"value":"md`## Test utils`","pinned":false,"hidden":false,"mode":"ojs"},{"id":20,"value":"assert = {\n function assert (ok, message) {\n if (!ok) throw new Error('✗ '+(message ? message : 'not ok'));\n }\n \n assert.almostEqual = function assertAlmostEqual (a, b, msg, tol) {\n if (!almostEqual(a, b)) throw new Error('✗ '+(msg ? msg + ' ' : '')+'Expected '+a+' to equal '+b+' within tolerance '+tol)\n }\n \n assert.arrayAlmostEqual = function assertArrayAlmostEqual (a, b, tol) {\n tol = almostEqual.DBL_EPSILON\n if (a.length !== b.length) throw new Error('✗ Expected a.length (='+a.length+') to equal b.length (='+b.length+')')\n for (var i = 0; i < a.length; i++) {\n if (!almostEqual(a[i], b[i], tol, tol)) throw new Error('✗ Expected a['+i+'] (='+a[i]+') to equal b['+i+'] (='+b[i]+') within tolerance '+tol)\n }\n }\n return assert;\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":38,"value":"md`## Math utils`","pinned":false,"hidden":false,"mode":"ojs"},{"id":113,"value":"function binarySearch(x, value) {\n let lo = 0,\n hi = x.length - 1;\n if (value <= x[0]) return lo;\n if (value >= x[hi]) return hi;\n while (lo < hi - 1) {\n let m = ((lo + hi) / 2) | 0;\n let xm = x[m];\n if (xm > value) {\n hi = m;\n } else if (xm < value) {\n lo = m;\n } else {\n return m;\n }\n }\n return lo;\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":36,"value":"$31","pinned":false,"hidden":false,"mode":"ojs"},{"id":87,"value":"function arrayAlmostEqual (a, b, absoluteError, relativeError) {\n if (a.length !== b.length) return false\n for (var i = 0; i < a.length; i++) {\n if (!almostEqual(a[i], b[i], absoluteError, relativeError)) return false\n }\n return true\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":198,"value":"$32","pinned":false,"hidden":false,"mode":"ojs"},{"id":91,"value":"arrayAlmostEqual([0, 1], [1e-16, 1], 1e-4, 1e-4)","pinned":true,"hidden":false,"mode":"ojs"},{"id":108,"value":"$33","pinned":false,"hidden":false,"mode":"ojs"},{"id":135,"value":"md`## SVG Utils`","pinned":false,"hidden":false,"mode":"ojs"},{"id":140,"value":"function arrowhead (opts) {\n opts = opts || {}\n const w = opts.width === undefined ? 9 : opts.width\n const l = opts.length === undefined ? 11 : opts.length\n const c = opts.cut === undefined ? 1 : opts.cut\n return function (el) {\n return el.attr('refX', l / 2)\n .attr('refY', w / 2)\n .attr('markerWidth', l)\n .attr('markerHeight', w)\n .attr('viewbox', `0 0 ${l} ${w}`)\n .attr('orient', 'auto-start-reverse')\n .append('path')\n .attr('d', `M2,2L${l - 2},${w / 2}L2,${w - 2}L${2 + c},${w / 2}L2,2`)\n }\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":180,"value":"function downloadURI(uri, filename) {\n var link = document.createElement(\"a\");\n link.target = '_blank';\n link.download = filename;\n link.href = uri;\n document.body.appendChild(link);\n link.click();\n document.body.removeChild(link);\n}","pinned":true,"hidden":false,"mode":"ojs"},{"id":174,"value":"md`## License\n\nThe code in this notebook is MIT Licensed.`","pinned":false,"hidden":false,"mode":"ojs"},{"id":177,"value":"$34","pinned":false,"hidden":false,"mode":"ojs"}],"files":"$W35","stdlib":"1","titling":"auto"}