jrudolph

/*
 * This is the Towers of Hanoi example from the prolog tutorial [1]
 * converted into Scala, using implicits to unfold the algorithm at
 * compile-time. 
 * 
 * [1] http://www.csupomona.edu/~jrfisher/www/prolog_tutorial/2_3.html
 */

object TowersOfHanoi {
  import scala.reflect.Manifest

atla

package iwsexample

import scala.actors._
import scala.actors.Actor._
import scala.actors.Futures._
import scala.collection.mutable._

case class RegisterWorker (worker:Worker)
case class UnregisterWorker (worker:Worker)
case class SortList (data:List[Int])

gnip

{
  "coordinates": null,
  "created_at": "Thu Oct 21 16:02:46 +0000 2010",
  "favorited": false,
  "truncated": false,
  "id_str": "28039652140",
  "entities": {
    "urls": [
      {
        "expanded_url": null,

mrflip

We couldn’t find that file to show.

josiahcarlson

'''
redis_simple_chat.py

Written June 24, 2011 by Josiah Carlson
Released under the GNU GPL v2
available: http://www.gnu.org/licenses/gpl-2.0.html

Other licenses may be available upon request.

kedarbellare

def thresholdLevenshtein(_s: String, _t: String, threshold: Int): Int = {
  val (s, t) = if (_s.length > _t.length) (_s, _t) else (_t, _s)
  val slen = s.length
  val tlen = t.length

  var prev = Array.fill[Int](tlen+1)(Int.MaxValue)
  var curr = Array.fill[Int](tlen+1)(Int.MaxValue)
  for (n <- 0 until math.min(tlen+1, threshold+1)) prev(n) = n

  for (row <- 1 until (slen+1)) {

dcj

Note:  When I started, JAVA_HOME=/System/Library/Frameworks/JavaVM.framework/Versions/1.6/Home


$ git clone https://github.com/nathanmarz/jzmq.git
Cloning into jzmq...
remote: Counting objects: 611, done.
remote: Compressing objects: 100% (204/204), done.
remote: Total 611 (delta 317), reused 570 (delta 292)
Receiving objects: 100% (611/611), 304.06 KiB | 298 KiB/s, done.
Resolving deltas: 100% (317/317), done.

tixxit

package net.tixxit.levenshtein

import scala.math.min

object EditDistance {
  def editDist[A](a: Iterable[A], b: Iterable[A]) =
    ((0 to b.size).toList /: a)((prev, x) =>
      (prev zip prev.tail zip b).scanLeft(prev.head + 1) {
          case (h, ((d, v), y)) => min(min(h + 1, v + 1), d + (if (x == y) 0 else 1))
        }) last

quinn

sudo apt-get install openjdk-6-jre-headless
curl -O http://dist.neo4j.org/neo4j-community-1.5.M02-unix.tar.gz
tar -xf neo4j-community-1.5.M02-unix.tar.gz
rm neo4j-community-1.5.M02-unix.tar.gz
neo4j-community-1.5.M02/bin/neo4j start

timcowlishaw

package uk.ac.ucl.cs.GI15.timNancyKawal {
  class Trie[V](key: Option[Char]) {

    def this() {
      this(None);
    }

    import scala.collection.Seq
    import scala.collection.immutable.TreeMap
    import scala.collection.immutable.WrappedString