hackape

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs

hackape

A collection of information about accessing raw MultiTouch events on MacOS.

Useful URLS

• http://www.makeitgo.ws/articles/fingermgmt/
• https://github.com/fajran/tongseng/blob/master/Makefile
• https://github.com/calftrail/TrackMagic/blob/master/MultitouchSupport.h
• https://encyclopediaofdaniel.com/blog/making-the-magic-trackpad-work/
• https://github.com/calftrail/Touch/blob/master/TouchSynthesis/MultitouchSupport.h

hackape

Ok, I geeked out, and this is probably more information than you need. But it completely answers the question. Sorry. ☺

Locally, I'm at this commit:

$ git show
commit d6cd1e2bd19e03a81132a23b2025920577f84e37
Author: jnthn <jnthn@jnthn.net>
Date:   Sun Apr 15 16:35:03 2012 +0200

When I added FIRST/NEXT/LAST, it was idiomatic but not quite so fast. This makes it faster. Another little bit of masak++'s program.

hackape

/** might not be a good idea
 * but it's fun
 * you can overload infix operator in JS by overriding `.valueOf()` method.
 
 The following binary operators coerce:
    + - * / % 
    & | ^ << >> >>>
    < <= > >=

 */

hackape

/**
 * Encrypts plaintext using AES-GCM with supplied password, for decryption with aesGcmDecrypt().
 *                                                                      (c) Chris Veness MIT Licence
 *
 * @param   {String} plaintext - Plaintext to be encrypted.
 * @param   {String} password - Password to use to encrypt plaintext.
 * @returns {String} Encrypted ciphertext.
 *
 * @example
 *   const ciphertext = await aesGcmEncrypt('my secret text', 'pw');

hackape

const websocketMachine = Machine({
  initial: '@closed',
  states: {
    '@closed': {},
    '@connecting': {},
    '@closing': {},
    '@reconnecting': {},
    '@connected': {},
    '@disconnected': {},
  },

hackape

  // Available variables:
  // - Machine
  // - interpret
  // - assign
  // - send
  // - sendParent
  // - spawn
  // - raise
  // - actions

hackape

Combinations

Find all combinations from given ordered choices.

Implementation

function getAllCombinations<T>(slotsChoices: T[][]) {
  const searchSpaceSizes = slotsChoices.map(choices => choices.length)
  const solutionSize = searchSpaceSizes.reduce((a, b) => a * b)
  const slots = new Array(solutionSize).fill(slotsChoices)

hackape

// https://github.com/microsoft/TypeScript/blob/ba5e86f1406f39e89d56d4b32fd6ff8de09a0bf3/src/compiler/checker.ts

// 1. add this line to ln:3

    export const _conditionalTypes: any = {}

// 2. then replace ln:12303 to ln:12360

        function trackConditionalType() {
            // one time stuff