louisswarren

primesmodule.o
primes.*.so

louisswarren

IPV4_OCTET_TYPES = {
    4: (24, 16, 8, 0,),
    3: (24, 16,    0,),
    2: (24,        0,),
    1: (           0,),
}

def num(ip):
    octets = tuple(map(int, ip.split('.')))
    bases = IPV4_OCTET_TYPES[len(octets)]

louisswarren

.PHONY: default
default: dict
	./dict

dict: dict.c set.o

test: test.c set.o

set.o: set.c set.h

louisswarren

#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

struct a {
	char x;
	char buf[];
};

louisswarren

int
check(const char *s, int p)
{
	static int passes = 0;
	static int failures = 0;
	const char *fail = "\x1B[31mFAIL\x1B[0m";
	const char *pass = "\x1B[34mPASS\x1B[0m";

	if (s) {
		fprintf(stderr, "[%s] %s\n", p ? pass : fail, s);

louisswarren

#!/bin/bash
#
if git rev-parse --verify HEAD >/dev/null 2>&1
then
	against=HEAD
else
	# Initial commit: diff against an empty tree object
	against=$(git hash-object -t tree /dev/null)
fi

louisswarren

library(Rcpp)
library(profvis)

cppFunction('
	double
	call_rnorm(int ignored)
	{
		Function f("rnorm");

		NumericVector x = f(1);

louisswarren

#include <stdio.h>
#include <stdlib.h>
#include <stdint.h>

struct node {
	struct node *next;
	long v;
};

struct list {

louisswarren

#include <stdio.h>
#include <stdint.h>

#define BASE_SIZE 8

struct cell {
	uint64_t value :  1;
	uint64_t reps  : 17;
	uint64_t prev  : 23;
	uint64_t next  : 23;

louisswarren

#include <stdio.h>
#include <stdint.h>
#include <string.h>

#define PRIME ((1ul << 31) - 1)
#define GEN ((1ul << 11) - 1)

unsigned
fastlog(uint64_t x)
{