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

fffej

// I was just browsing the code, and there's a lot of this repetition.

if (!options.AreAllEnabled(Options.IgnoreKeys))
{
  foreach (var val in ForeignKeys.CompareWith(target.ForeignKeys, options))
  {
    yield return val.AddContext(this);
  }
}

fffej

var foos = new List<int>{1,2,3,4};

var bars = new List<int>();
foreach(var foo in foos) {
  Console.WriteLine("hello");
  bars.Add(x*2);
}

// versus.

fffej

warpingPath :: Array (Int,Int) Int -> [(Int,Int)]
warpingPath arr = go (w,h) []
  where
    (_,(w,h)) = bounds arr
    go p@(x,y) xs
      | x == 0 && y == 0 = p : xs
      | otherwise = go minVal (minVal : xs)
      where
        minVal = minimumBy (comparing (arr !)) [down,downLeft,left]
        down = (max 0 (x-1),max 0 y)