fmela

/*
 * Copyright (c) 2009-2017, Farooq Mela
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright

fmela

double
agm_log(double x)
{
	double a, b, e, e0 = DBL_MAX;

	assert(x > 0.0);

	for (a = (x + 1.0) * 0.5, b = sqrt(x); (e = fabs(a - b)) < e0; e0 = e) {
		a = 0.5 * (a + b);
		b = sqrt(a * b);

fmela

SOURCES = $(wildcard *.c)
HEADERS = $(wildcard *.h)
 
OBJECTS = $(SOURCES:%.c=%.o)
PROGRAM = $(shell basename `pwd`)
 
CC := $(shell which clang || which gcc)
CFLAGS = -Wall -W -O
LIBS =
LDFLAGS = $(LIBS:%=-l%)

fmela

SOURCES = $(wildcard *.cxx)
HEADERS = $(wildcard *.hxx)

OBJECTS = $(SOURCES:%.cxx=%.o)
PROGRAM = $(shell basename `pwd`)

CC := $(shell which clang || which gcc)
CFLAGS = -Wall -W -O -fno-exceptions -fno-rtti
LIBS = stdc++ m
LDFLAGS = $(LIBS:%=-l%)

fmela

int f(int x, int negate) {
    return (x ^ -negate) + negate;
}

fmela

#include <vector>
#include <cassert>

// Call |f| with every length-K combination of { 1, 2, ..., N }, in ascending
// lexicographic order.
template<typename F>
void enumerate_combinations(size_t N, size_t K, const F& f) {
	assert(K <= N);
	std::vector<size_t> position;
	// Initialize with initial position.

fmela

Keybase proof

I hereby claim:

• I am fmela on github.
• I am fmela (https://keybase.io/fmela) on keybase.
• I have a public key whose fingerprint is 1ED2 D204 B006 BCB0 4494 6F55 0D03 EC4E 67C0 0BCC

To claim this, I am signing this object:

fmela

#include <assert.h>
#include <stdbool.h>
#include <stdio.h>

bool next_permutation(unsigned a[], unsigned n)
{
    if (n <= 1)
        return false;
    unsigned i = n-2;
    while (!(a[i] < a[i+1]))