This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function range (from, to) { | |
if (!to) { | |
to = from; | |
from = 0; | |
} | |
if (from > to) { | |
throw RangeError('`from` is higher than `to`'); | |
} | |
return Array.from({ length: to - from }, (_, i) => i + from); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
export function readable (init, start) { | |
function subscribe (listener) { | |
let running = true; | |
let prev = init; | |
let stop; | |
function set (curr) { | |
if (running && curr !== prev) { | |
prev = curr; | |
if (stop) listener(curr); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function noop () {} | |
export function writable (init, start) { | |
let subscribers = []; | |
let prev = init; | |
let running = false; | |
let stop; | |
function notify () { | |
let subs = subscribers.concat(); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function count (str: string, search: string) { | |
let n = -1; | |
let i = 0; | |
while (i !== -1) { | |
i = str.indexOf(search, i + 1); | |
n++; | |
} | |
return n; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
let epoch = 1420070400000; | |
let increment = 0; | |
function timestamp_to_snowflake (timestamp = Date.now()) { | |
let snowflake = ''; | |
// timestamp | |
snowflake += (timestamp - epoch).toString(2).padStart(42, '0'); | |
// worker id | |
snowflake += '00001'; |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// 249 bytes | |
var o={helloWorld:"hello-world-123",fooBar:"foo-bar-245",barBaz:"bar-baz-934"};let l=Object.assign(document.createElement("div"),{textContent:"Hello world!",className:[o.helloWorld,o.helloWorld,o.fooBar,o.barBaz].join(" ")});document.body.append(l); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function __async (generator) { | |
return function (...args) { | |
let it = generator.apply(this, args); | |
return new Promise((resolve, reject) => { | |
step(it.next()); | |
function step (result) { | |
if (result.done) resolve(result.value); | |
else Promise.resolve(result.value).then(fulfilled, rejected); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
function __append (el, children) { | |
for (let child of children) { | |
if (!child) continue; | |
if (Array.isArray(child)) __append(el, child); | |
else if (child instanceof HTMLElement || child instanceof DocumentFragment) el.append(child); | |
else el.append(document.createTextNode(child)); | |
} | |
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import { render } from 'preact'; | |
import { useRef, useState } from 'preact/hooks'; | |
function useReactive (initialState) { | |
let [, forceUpdate] = useState({}); | |
let reactive = useRef(null); | |
if (!reactive.current) { | |
reactive.current = new Proxy(initialState, { |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
// A teacher told us to submit the same form multiple times as sort of memory strengthening. | |
// I don't like that though, so here's a script that creates a Forms URL that contains the answers I've already filled. | |
location.origin + location.pathname + '?' + | |
Array.from(document.querySelectorAll('input[name^="entry."]')) | |
.filter((el) => el.value) | |
.map((el) => `${el.name}=${encodeURIComponent(el.value)}`) | |
.join('&'); |