heuristicfencepost

from twitter.api import Twitter
import pycassa

from itertools import ifilterfalse

# Query to use when finding tweets.
searchquery = "#cassandra"

# Borrowed from the itertools docs
def unique_everseen(iterable, key=None):

heuristicfencepost

module Main where

-- Definition of our candidate set
tens = map (*10) [1..]
urcandidate(x:xs) = map (+x) [1,3,7,9] ++ urcandidate(xs)
candidates = urcandidate(tens)

-- Define the logic to be used by our predicate and utilize currying to support partial application
urpred(candidate,prime) = prime > (truncate (sqrt (fromIntegral candidate))) || candidate `mod` prime == 0
pred = curry urpred

heuristicfencepost

class Euler10
  include Enumerable

  def initialize()
    @primearr = [2]
    @nat = 3
  end

  def each
    yield 2

heuristicfencepost

package org.fencepost.forkjoin

import scala.collection.mutable.LinkedList

import jsr166y._

import org.scalatest.Suite

class ForkJoinTest extends Suite {

heuristicfencepost

package org.fencepost

import scala.collection.mutable._

import org.scalatest.Suite

import java.util.concurrent._

class SAMTest extends Suite {