Snippet Zone

Log All Class Method Calls

```
class ConfusingClass {
```
```
  constructor() {
```
```
    logMethodCalls(this)
```
```
    this.confuseMe = 1
```
```
    this.someFn(300)
```
```
  }
```
```
  someFn(startVal = 1) {
```
```
    this.confuseMe = startVal
```

    this.testFn(() => this.otherFn(123))

```
  }
```
```
  testFn(fn) {
```
```
    this.confuseMe += 1
```
```
    fn(this.confuseMe)
```
```
  }
```
```
  otherFn(value = 111) {
```
```
    this.confuseMe += 2
```

    this.testFn(() => this.confuseMe += value)

```
 
```

    this.confuseMe = this.add(this.confuseMe, 999)

```
    console.log(this.confuseMe)
```
```
  }
```
```
  add(a, b) {
```
```
    return a + b
```
```
  }
```
```
}
```
```
const confusing = new ConfusingClass()
```
```
 
```
```
function logMethodCalls(target) { 
```

  const keys = Object.getOwnPropertyNames(target.constructor.prototype)

  for (let i = 0; i < keys.length; i++) {

```
    const key = keys[i]
```
```
    const propOrMethod = target[key]
```

    if (typeof propOrMethod === 'function') {

```
      target[key] = function(...args) {
```

        console.log(key, '(', args.join(', '), ') - was run')

        return propOrMethod.apply(target, args);

```
      }
```
```
    }
```
```
  }
```
```
}
```

This one is good for dealing with confusing classes with lots of method calls. It logs any time a method is called, what its name is and what arguments were passed to it. Sometimes this really beats stepping through breakpoints, at least in my experience…

July 19, 2023

// javascript // oop // tricks

Little Trading Program

```
let id = 0;
```
```
function person(startValue = 100) {
```
```
  const props = {
```
```
    id: id++, 
```
```
    el: document.body.appendChild(
```
```
      Object.assign(
```
```
        document.createElement`b`, { 
```
```
          innerText: startValue,
```
```
          style: 'padding: 1em'
```
```
      })
```
```
    ),
```
```
    value: startValue,
```
```
    trade(other) {
```
```
      if (props.value <= 0) return;
```
```
      other.value += 1;
```
```
      props.value -= 1;
```
```
      other.el.innerText = other.value
```
```
      props.el.innerText = props.value
```
```
    }
```
```
  }
```
```
  return props
```
```
}
```
```
 
```
```
 
```
```
const NUM = 4
```

const people = Array.from({ length: NUM }, person)

```
 
```
```
setInterval(() => {
```

  const a = people[~~(Math.random() * people.length)]

  const b = people[~~(Math.random() * people.length)]

```
 
```
```
  if (a.id != b.id) a.trade(b)
```
```
}, 1)
```

4 “people” randomly trade…

I asked Chat GPT to describe this… funny response…

The trading program you provided is essentially an example of a random walk or “drunkard’s walk” problem. In such problems, each individual (in this case, the ‘people’) make random moves (in this case, trades), and we observe the resulting dynamics of the system as a whole. In this particular case, each trade involves one individual giving one unit of value to another individual. Since each trade is random, there’s a possibility that over time, all the value might get concentrated in one individual. This isn’t guaranteed, but given enough time, it’s likely. You could compare it to the idea that given enough time, a group of monkeys randomly typing on a keyboard would eventually type out the complete works of Shakespeare. It’s also worth noting that this concentration of value becomes more likely because the individuals with no value left cannot trade anymore, so they are essentially removed from the trading pool. This progressively reduces the number of individuals that can gain value and increases the probability of the remaining individuals gaining more value. This is a simple model of economic transactions and it illustrates how wealth can concentrate over time even if all the transactions are fair and random. Of course, it’s a very simplified model, and real-world economics are much more complex.

July 18, 2023

// arrays // humor // javascript // math // speed-coded // speedcoding

Simple Way to Validate CSS Colors

```
function isColor(col) {
```
```
  const cache = isColor[col]
```
```
  if (cache != null) {
```
```
    console.log('- reading cache')
```
```
    return cache
```
```
  }
```
```
  isColor.el.style = ''
```
```
  isColor.el.style.color = col
```

  return isColor[col] = !!isColor.el.style.color

```
}
```

isColor.el = document.createElement('div')

```
 
```
```
 
```

console.log('is "red" a color?', isColor('red'))

console.log('from the cache: ', isColor('red'))

```
 
```

console.log('is "rgbx(1, 2, 3)" a color?', isColor('rgbx(1, 2, 3)'))

```
 
```

console.log('is "#0f0" a color?', isColor('#0f0'))

```
 
```

console.log('is "hsl(192, 50%, 50%)" a color?', isColor('hsl(192, 50%, 50%)'))

console.log('from the cache: ', isColor('hsl(192, 50%, 50%)'))

```
 
```

console.log('is "lab(2000.1337% -8.6911 -159.131231 / .987189732)" ?',

  isColor('lab(2000.1337% -8.6911 -159.131231 / .987189732)'))

```
 
```

console.log('is "snippetZone" ?', isColor('snippetZone'))

I find this technique is usually good enough to validate colors…

July 17, 2023

// color // css // dom // graphics // hacks // hex // html // javascript // tricks

Other Gates from NAND

```
const nand = ([a, b]) => +!(a & b)
```
```
 
```
```
const not = ([a]) => nand([a, a])
```
```
 
```

const and = ([a, b]) => nand([nand([a, b]), nand([a, b])])

```
 
```

const or = ([a, b]) => nand([nand([a, a]), nand([b, b])])

```
 
```
```
const nor = ([a, b]) => 
```
```
  nand([ 
```

    nand([nand([a, a]), nand([b, b])]),

```
    nand([nand([a, a]), nand([b, b])])
```
```
  ])
```
```
 
```
```
const xor = ([a, b]) =>
```
```
  nand([
```
```
    nand([a, nand([a, b])]),
```
```
    nand([b, nand([a, b])])
```
```
  ])
```
```
 
```
```
const xnor = ([a, b]) => 
```
```
  nand([ 
```
```
    nand([nand([a, a]), nand([b, b])]),
```
```
    nand([a, b])
```
```
  ])
```
```
 
```
```
 
```
```
const inputs = [
```
```
  [0, 0],
```
```
  [0, 1],
```
```
  [1, 0],
```
```
  [1, 1]
```
```
]
```
```
 
```

const testGate = ({ gate, truth, result }) => console.log(

```
  gate + ' matches truth? ', 
```
```
  truth+'' === result+'' ? 
```

    'yes :D' : `nope :( ${truth} ${result}`

```
)
```
```
 
```
```
testGate({
```
```
  gate: 'NAND',
```
```
  truth: [1, 1, 1, 0],
```
```
  result: inputs.map(nand)
```
```
})
```
```
 
```
```
testGate({
```
```
  gate: 'NOT',
```
```
  truth: [0, 1],
```
```
  result: [[1], [0]].map(not)
```
```
})
```
```
 
```
```
testGate({
```
```
  gate: 'AND',
```
```
  truth: [0, 0, 0, 1],
```
```
  result: inputs.map(and)
```
```
})
```
```
 
```
```
testGate({
```
```
  gate: 'OR',
```
```
  truth: [0, 1, 1, 1],
```
```
  result: inputs.map(or)
```
```
})
```
```
 
```
```
testGate({
```
```
  gate: 'NOR',
```
```
  truth: [1, 0, 0, 0],
```
```
  result: inputs.map(nor)
```
```
})
```
```
 
```
```
testGate({
```
```
  gate: 'XOR',
```
```
  truth: [0, 1, 1, 0],
```
```
  result: inputs.map(xor)
```
```
})
```
```
 
```
```
testGate({
```
```
  gate: 'XNOR',
```
```
  truth: [1, 0, 0, 1],
```
```
  result: inputs.map(xnor)
```
```
})
```

Use NAND to create a bunch of other gates 😀 – I used this wikipedia article for reference

July 16, 2023

// arrays // golfed // humor // javascript // math

Multiplicative Persistence

```
const multp = (val, count = 1, res) => 
```
```
  (res = (val + '').split``
```

    .reduce((a, b) => a * b, 1) + '').length > 1 ?

```
      multp(res, count + 1) : count
```
```
 
```
```
 
```
```
console.log('test:', multp(2678789))
```

Started watching this youtube video from numberphile and instantly made this half-golfed thing

Found this:

f=n=>[n,...n>9?f(eval([...n+''].join`*`)):[]]

By Arnauld over at codegolf.stackexchange

will definitely remember: [...n+'']

June 10, 2023

// golfed // hacks // humor // javascript // math

Older Posts

Newer Posts

Log All Class Method Calls

Little Trading Program

Simple Way to Validate CSS Colors

Other Gates from NAND

Multiplicative Persistence

Recent

Archive