kputnam kputnam

Follow these steps to install graphite on OS X Mavericks.

Prerequisites

Here's where I understand the state of the art to be:

In this INRIA tech report, Shapiro, Preguiça, Baquero and Zawirski (SPBZ) prove, amongst other things, that a sufficient condition for CRDTs to achieve eventual consistency on networks which may reorder and duplicate packets (which I'll call flaky networks, henceforth) is that
1. the underlying datatype forms a semilattice,
2. messages are full states,
3. incoming messages are combined with the node's current state using the least-upper-bound operation in the semilattice.
It's possible to relax condition 2 and still achieve eventual consistency over flaky networks by fragmenting the state into independent parts and transmitting updates to each part separately. For instance, in the G-Set CRDT (an add-only bitset) one can transmit only the index of the element to be added.
In [these slides from a talk at Dagstuhl](http://www.dagstuhl.de/mat/Files/13/13081/13081.BaqueroCarlos.Sl

Thomas Wang, Jan 1997

last update Mar 2007

Couldn't find the text of this for a while...

	import com.yammer.metrics.Metrics;
	import com.yammer.metrics.core.*;
	import com.yammer.metrics.reporting.GraphiteReporter;
	import com.yammer.metrics.reporting.SocketProvider;
	import com.yammer.metrics.stats.Snapshot;

	import java.io.IOException;
	import java.util.concurrent.TimeUnit;

	/**

	{-# Language GADTs #-}

	module Homomorphisms where

	import Control.Monad
	import Control.Applicative

	import Data.Monoid hiding (Endo)
	import qualified Control.Category as C

	scala> import scala.language.experimental.macros
	import scala.language.experimental.macros

	scala> import scala.reflect.macros.{ Context, TypecheckException }
	import scala.reflect.macros.{Context, TypecheckException}

	scala> object NoncompilationTests {
	\| def compiles(code: _): Boolean = macro compiles_impl
	\| def compiles_impl(c: Context)(code: c.Tree) = c.literal(
	\| try {