Patrick Cieplak cieplak

The Problem

Defining records in Haskell causes accessor functions for the record's fields to be defined. There is no seperate namespace for these accessor functions.

The Goal

Be able to

use records in Haskell, which share field names.
use lenses for accessing these fields

Orthodox C++

What is Orthodox C++?

Orthodox C++ (sometimes referred as C+) is minimal subset of C++ that improves C, but avoids all unnecessary things from so called Modern C++. It's exactly opposite of what Modern C++ suppose to be.

Why not Modern C++?

TL;DR

Create 5GB FreeBSD image.
Install FreeBSD on xhyve.
Mount host directory.

Requisites

Prerequisites

Homebrew
Python 2.7
Git

Graphite

Install Cairo

There's an issue with cairo 14.x that results in the axis fonts on the graphs being HUUUUUGE. Downgrading to 12.6 helps:

Update, September 2016

OK, you can pretty much ignore what I wrote below this update, because it doesn't really apply anymore.

I wrote this over a year ago, and at the time I had spent a couple of weeks trying to get Kafka 0.8 working with .NET and then Node.js with much frustration and very little success. I was rather angry. It keeps getting linked, though, and just popped up on Hacker News, so here's sort of an update, although I haven't used Kafka at all this year so I don't really have any new information.

In the end, we managed to get things working with a Node.js client, although we continued to have problems, both with our code and with managing a Kafka/Zookeeper cluster generally. What made it worse was that I did not then, and do not now, believe that Kafka was the correct solution for that particular problem at that particular company. What they were trying to achieve could have been done more simply with any number of other messaging systems, with a subscriber reading messages off and writing

	#include <stdio.h>

	#define SQ(x) (x)*(x)

	#define M0(x,y) SQ(x)+SQ(y)<4?0:0xe0
	#define M1(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M0(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0)):0xc0
	#define M2(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M1(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0xa0
	#define M3(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M2(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x80
	#define M4(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M3(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x60
	#define M5(x,y,x0,y0) (SQ(x)+SQ(y)<4)?M4(SQ(x)-SQ(y)+(x0),2(x)(y)+(y0),x0,y0):0x40

	#include <sys/socket.h>
	#include <sys/un.h>
	#include <sys/event.h>
	#include <netdb.h>
	#include <assert.h>
	#include <unistd.h>
	#include <fcntl.h>
	#include <stdio.h>
	#include <errno.h>

	// Faster solution for:
	// http://www.boyter.org/2017/03/golang-solution-faster-equivalent-java-solution/
	// With threading.
	// g++ -std=c++11 -Wall -Wextra -O3 -pthread

	// On my computer (i5-6600K 3.50 GHz 4 cores), takes about ~160 ms after the CPU
	// has warmed up, or ~80 ms if the CPU is cold (due to Turbo Boost).

	// How it works: Start by generating a list of losing states -- states where the
	// game can end in one turn. Generate a new list of states by running the game

	{-# LANGUAGE GADTs #-}
	{-# LANGUAGE PolyKinds #-}
	{-# LANGUAGE FunctionalDependencies #-}
	{-# LANGUAGE MultiParamTypeClasses #-}
	{-# LANGUAGE TypeOperators #-}
	{-# LANGUAGE DataKinds #-}
	{-# LANGUAGE KindSignatures #-}
	{-# LANGUAGE TemplateHaskell #-}
	{-# LANGUAGE FlexibleInstances #-}
	{-# LANGUAGE OverloadedLabels #-}

	# include <sys/types.h>
	# include <sys/socket.h>
	# include <ifaddrs.h>
	# include <arpa/inet.h>
	# include <netinet/in.h>

	// Bad dirty quick functions written by hot fingers:

	char* ipToStr(sockaddr* addr) {
	static char ip[32];