katef

#!/usr/bin/awk -f

# This program is a copy of guff, a plot device. https://github.com/silentbicycle/guff
# My copy here is written in awk instead of C, has no compelling benefit.
# Public domain. @thingskatedid

# Run as awk -v x=xyz ... or env variables for stuff?
# Assumptions: the data is evenly spaced along the x-axis

# TODO: moving average

pervognsen

#if _WIN32
struct Timer {
    LARGE_INTEGER win32_freq;
    LARGE_INTEGER win32_start;

    Timer() {
        QueryPerformanceFrequency(&win32_freq);
        win32_start.QuadPart = 0;
    }

pervognsen

Multi-dimensional array views for systems programmers

As C programmers, most of us think of pointer arithmetic for multi-dimensional arrays in a nested way:

The address for a 1-dimensional array is base + x. The address for a 2-dimensional array is base + x + y*x_size for row-major layout and base + y + x*y_size for column-major layout. The address for a 3-dimensional array is base + x + (y + z*y_size)*x_size for row-column-major layout. And so on.

djg

Papers I like Pt. 1 Papers I like Pt. 2

Let's start meta:

1. Lamport - State the Problem Before Describing the Solution (1978). … 1-page memo. Read it.
2. Herlihy - Wait-free synchronization (1991) … Truly seminal. Lucid + enough good ideas for 4 papers easily.
3. Cook - How complex systems fail (1998) … 4 pages that anyone working on/with complex systems should read.

romainl

My Vim-related gists

Long-form

• How to use Tim Pope's Pathogen
• Idiomatic vimrc (superseded by idiomatic-vimrc)
• Clipboard sharing on Mac OS X is easy
• Apprentice — The Making Of
• Vim: pushing built-in features beyond their limits
• The right way to override any highlighting if you don't want to edit the colorscheme file directly

mcnees

%%-----------------------------------------------------------------------
%% Make your own quadrille, graph, hex, etc paper!
%% Uses the pgf/TikZ package for LaTeX, which should be part of
%% any modern TeX installation.
%% Email: mcnees@gmail.com 
%% Twitter: @mcnees
%%-----------------------------------------------------------------------

\documentclass[11pt]{article}

pervognsen

enum { BMAX = 32, BCUT = BMAX / 2, BHEIGHT = 6 };

typedef uint8_t BIndex;

struct BNode {
    BIndex length;
    Key keys[BMAX];
    union {
        BNode *children[BMAX];
        Value values[BMAX];

pervognsen

enum { BMAX = 32, BMIN = BMAX / 2, BHEIGHT = 6 };

struct BNode {
    uint32_t length;
    Key keys[BMAX];
    union {
        BNode *children[BMAX];
        Value values[BMAX];
    };
};

ocornut

Memory Optimization (Christer Ericson, GDC 2003)
http://realtimecollisiondetection.net/pubs/GDC03_Ericson_Memory_Optimization.ppt

Cache coherency primer (Fabian Giesen)
https://fgiesen.wordpress.com/2014/07/07/cache-coherency/

Code Clinic 2015: How to Write Code the Compiler Can Actually Optimize (Mike Acton)
http://gdcvault.com/play/1021866/Code-Clinic-2015-How-to

pkhuong

// b-tree
// Before
template<unsigned B, typename T, typename I>
I btree_array<B, T,I>::search(const T &x) {
        I j = n;
        I i = 0;
        while (i < n) {
                I lo = i;
                I hi = std::min(i+B, n);
                while (lo < hi) {