jonrandy

const mostFrequent = s=>s.match(/(.)\1+/g)?.sort((a,b)=>b.length-a.length)[0][0]||s[0]
const mostFrequentLetter = s=>([...s].sort().join('').match(/(\w)\1+/g)?.sort((a,b)=>b.length-a.length)[0]||s.match(/\w/))[0]

jonrandy

/* https://edent.gitlab.io/paper-prototype-css/ */

@font-face {
  font-family: 'Reenie Beanie';
  font-style: normal;
  font-weight: 400;
  font-display: swap;
  src: url(https://fonts.gstatic.com/s/reeniebeanie/v16/z7NSdR76eDkaJKZJFkkjuvWxXPq1qw.woff2) format('woff2');
  unicode-range: U+0000-00FF, U+0131, U+0152-0153, U+02BB-02BC, U+02C6, U+02DA, U+02DC, U+2000-206F, U+2074, U+20AC, U+2122, U+2191, U+2193, U+2212, U+2215, U+FEFF, U+FFFD;
}

jonrandy

function allocateInt(amount, ratios) {
  if (ratios.length == 1) {
    return [amount]
  } else {
      const rs = [...ratios]
      const divisor = rs.reduce((a,i)=>a+i)
      const thisAmount = Math.round(amount*rs.shift()/divisor)
      return [
        thisAmount,
        ...allocateInt(amount-thisAmount, rs)

jonrandy

const fizzBuzz = x=>[x,f='Fizz',b='Buzz',f+b][!(x%5)*2+!(x%3)]

const fizzBuzz = (x,f='Fizz',b='Buzz')=>[x,f,b,f+b][!(x%5)*2+!(x%3)]

const fizzBuzz = x=>({1:x,6:f="Fizz",10:b="Buzz",0:f+b}[x**4%15])

const fizzBuzz = (x,f="Fizz",b="Buzz")=>({1:x,6:f,10:b,0:f+b}[x**4%15])

jonrandy

const isPrime = x=>!'1'.repeat(x).match(/^1?$|^(11+?)\1+$/)

jonrandy

const isValidCSSColour = str => {
  const s = new Option().style
  s.color = str
  return s.color != ''
}

jonrandy

jonrandy

var n = 53.73;
var rounded = n|0; //53

x|0 //Round x down
func`arg` //Call function with one string argument
getContext`2d`; // ^
`rgb(${r}, ${g}, ${b})` //Template literals
C //together with <canvas id=C> instead of document.getElementById("C");
1e3 //Shorter than 1000
1e-3 //Shorter than 0.001

jonrandy

function add(target, f, outerSyntax=false){
  return f.length ?
    outerSyntax ?
      addProperty(target, f)
    :
      addWithParams(target, f)
  :
    addSimple(target, f)
}

jonrandy

const to = Symbol('number to')

// Number.prototype[to] = function to(end) {
//   let [start, tend, rev] = (this>end) ? [end, this, true] : [this, end, false], arr = []
//   for (let i=start; i<=tend; i++) arr.push(i)
//   return rev ? arr.sort(_=>1) : arr
// }

Number.prototype[to] = function to(end, {step}={step:this<=end?1:-1}) {
  let arr = [], i, d = end>this