fffej

using System;
using System.IO;
using System.Collections.Generic;
using System.Linq;

namespace generating_text
{
    class Model 
    {
        // A map of Word => {Words}.

fffej

(defun fib (n)
  "Compute the nth number in the Fibonacci sequence."
  (if (<= n 1) 1
      (+ (fib (- n 1) (fib (- n 2))))))

fffej

(defun tree-search (states goal-p successors combiner)
  "Find a state that satisfies goal-p.  Start with states,
  and search according to successors and combiner."
  (dbg :search "~&;; Search: ~a" states)
  (cond ((null states) fail)
        ((funcall goal-p (first states)) (first states))
        (t (tree-search
             (funcall combiner
                      (funcall successors (first states))
                      (rest states))

fffej

RestoreDatabase(SQL7SERVER, "SQLDataCompare2", BACKUP_LOCATION+"\\SQL7\\SQLDataCompare2.bak", SQL7PASSWORD);
RestoreDatabase(SQL2000SERVER, "SQLDataCompare1", BACKUP_LOCATION+"\\SQL2000\\SQLDataCompare1.bak", SQL2000PASSWORD);
SynchronizeDatabase(SQL2000SERVER, SQL2000PASSWORD, "SQLDataCompare1", SQL7SERVER, SQL7PASSWORD, "SQLDataCompare2", 1);

fffej

[TestFixture]
public class UglyThingTest
{
  [Test]
  public void CreateUglyThing()
  {
    UglyThing ugly = new UglyThing();
  }
}

fffej

namespace TDDKata2
{
    public class Class1
    {
        [Test]
        public void Volume_Of_A_Cube()
        {
            Assert.That(new Cube(1).Volume, Is.EqualTo(1));
        }

fffej

namespace TDDKata2
{
    public class Class1
    {
        [Test]
        public void Volume_Of_A_Cube()
        {
            Assert.That(new Cube(1).Volume, Is.EqualTo(1));
        }

fffej

Keybase proof

I hereby claim:

• I am fffej on github.
• I am fffej (https://keybase.io/fffej) on keybase.
• I have a public key ASCtXvHaI1pD3pxRMPMztq_UbLFSSj5-SrqYGgvpJjxIogo

To claim this, I am signing this object:

fffej

# Game of life.  Based on a matrix representation with cells being in either
# alive (1) or dead (0) state.

nextStep <- function(grid) {
  w = ncol(grid)
  h = nrow(grid)
  out = matrix(0,nrow=h,ncol=w)

  for (i in 1:w) {
    for (j in 1:h) {

fffej

module Minesweeper where
import Data.List (delete, maximumBy)
import Data.Char (intToDigit, digitToInt)
import Data.Ord (comparing)
import Test.QuickCheck

-- Tests!
newtype InputFormat = InputFormat [String] deriving (Show)

instance Arbitrary InputFormat where