mbostock

license: gpl-3.0
redirect: https://observablehq.com/@d3/margin-convention

maccman

(function($){
  var insertAtCaret = function(value) {
    if (document.selection) { // IE
      this.focus();
      sel = document.selection.createRange();
      sel.text = value;
      this.focus();
    }
    else if (this.selectionStart || this.selectionStart == '0') {
      var startPos  = this.selectionStart;

hellerbarde

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

jboner

Latency Comparison Numbers (~2012)
----------------------------------
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

leegao

-- A priority queue that sorts based on euclidean distance

pq = pqueue(function(point1, point2)
    return (point1[1]-point2[1])^2 + (point1[2]-point2[2])^2
end)

for i=1, 20 do
    pq:push{math.random(100), math.random(100)}
end