dehora

Datagrid datagrid = Builder.newDatagrid();
Table table = datagrid.useTable("Table");
Key<String> key = Builder.newKeyMaker().createKey("key");

ColumnFamily cf = Builder.newColumnFamily("ColumnFamily");
Column<String, String> c2 = Builder.newColumn("c-1", "value");
Column<String, String> c3 = Builder.newColumn("c-2", "value");
Column<String, String> c4 = Builder.newColumn("c-3", "value");

Mutation mutation = table.newMutation().prepareInsert(key, cf, c2, c3, c4);

jonifreeman

Miles Sabin implemented a nice selection sort example in Scala's type system. See:

http://www.chuusai.com/2012/01/27/type-level-sorting-in-shapeless/

To get a better understanding how that works I ported the algorithm to Prolog.

selectleast([H|T], TM, [H|TRem]):-
    selectleast(T, TM, TRem), TM < H.

selectleast([H|T], H, T).

surjikal

Follow these steps to install graphite on OS X Lion.

Prerequisites

• Python 2.7
• Brew
• Git

Install dependencies

Install Cairo

marktheunissen

This playbook has been removed as it is now very outdated.

clintongormley

Yesterday I upgraded our running elasticsearch cluster on a site which serves a few million search requests a day, with zero downtime. I've been asked to describe the process, hence this blogpost.

To make it more complicated, the cluster was running elasticsearch version 0.17.8 (released 6 Oct 2011) and I upgraded it to the latest 0.19.10. There have been 21 releases between those two versions, with a lot of functional changes, so I needed to be ready to roll back if necessary.

Our setup:

• elasticsearch

We run elasticsearch on two biggish boxes: 16 cores plus 32GB of RAM. All indices have 1 replica, so all data is stored on both boxes (about 45GB of data). The primary data for our main indices is also stored in our database. We have a few other indices whose data is stored only in elasticsearch, but are updated once daily only. Finally, we store our sessions in elasticsearch, but active sessions are cached in memcached.

dehora

object ಠ_ಠ {

  class ಠ_ಠ(m: String) extends Exception(m) 

  def main(a: Array[String]) = {
    throw new ಠ_ಠ("ಠ_ಠ")
  }
}

coffeemug

After spending the better part of the month implementing date support
in RethinkDB, Mike Lucy sent the team the following e-mail. It would
have been funny, if it didn't cause thousands of programmers so much
pain. Read it, laugh, and weep!

-----

So, it turns out that we're only going to support dates between the
year 1400 and the year 10000 (inclusive), because that's what boost
supports.

kafecho

package org.kafecho.learning.midi
import javax.sound.midi.MidiSystem
import javax.sound.midi.ShortMessage
import scala.util.Random

object MidiTest extends App {
  val rcvr = MidiSystem.getReceiver
  while (true) {
    val myMsg = new ShortMessage
    myMsg.setMessage(ShortMessage.NOTE_ON, 8, Random.nextInt.abs % 127, 93)

relaxdiego

Follow these steps to install graphite on OS X Mavericks.

Prerequisites

• Homebrew
• Python 2.7
• Git

Install dependencies

Install Cairo and friends

debasishg

General Background and Overview

1. Probabilistic Data Structures for Web Analytics and Data Mining : A great overview of the space of probabilistic data structures and how they are used in approximation algorithm implementation.
2. Models and Issues in Data Stream Systems
3. Philippe Flajolet’s contribution to streaming algorithms : A presentation by Jérémie Lumbroso that visits some of the hostorical perspectives and how it all began with Flajolet
4. Approximate Frequency Counts over Data Streams by Gurmeet Singh Manku & Rajeev Motwani : One of the early papers on the subject.
5. [Methods for Finding Frequent Items in Data Streams](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.187.9800&rep=rep1&t