ciju

const blur1 = (data) =>
  data.map((d, i) => {
    const previous = i === 0 ? i : i - 1;
    const next = i === data.length - 1 ? i : i + 1;
    const sum = (data[previous] || 0) + d + (data[next] || 0);
    d = sum / 3;
    return d;
  });

const twice = (fn) => (x) => fn(fn(x));

ciju

//assumes no tax overrides
//assumes no tax can replace another tax

sig Location {} //states, cities

sig Category {}

sig Item {
	, category: some Category
}

ciju

Snippet development Quickly finding snippets

There are some ways you can quickly find a snippet file:

• M-x yas/new-snippet

  Prompts you for a snippet name, then tries to guess a suitable directory to store it, prompting you for creation if it does not exist. Finally, places you in a new buffer set to snippet-mode so you can write your snippet.

ciju

Latency Comparison Numbers
--------------------------
L1 cache reference                           0.5 ns
Branch mispredict                            5   ns
L2 cache reference                           7   ns                      14x L1 cache
Mutex lock/unlock                           25   ns
Main memory reference                      100   ns                      20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy             3,000   ns        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD