DavidBrower

 public abstract class ValueObject<T> : IEquatable<T> where T : ValueObject<T>
    {
        private List<PropertyInfo> Properties { get; }

        protected ValueObject()
        {
            Properties = new List<PropertyInfo>();
        }

        public override Boolean Equals(object obj)

DavidBrower

public abstract class Entity<TId> : IEquatable<Entity<TId>>
    {
        private readonly TId _id;

        protected Entity(TId id)
        {
            if (object.Equals(id, default(TId)))
            {
                throw new ArgumentException("The ID cannot be the default value.", nameof(id));
            }

DavidBrower

[user]
	name = david.brower
	email = *********
[core]
	autocrlf = true
	excludesfile = #file path
	preloadindex = true
	fscache = true
[push]
	default = simple

DavidBrower

public interface ICircuitBreaker
{
    TResult Execute(Func action);
    void Execute(Action action);
}

DavidBrower

//Find the sum of all the multiples of 3 or 5 below 1000.
[1..999]
    |> List.filter (fun x -> x % 3 = 0 || x % 5 = 0)
    |> List.sum
    
//Almost identical to http://theburningmonk.com/2010/09/project-euler-problem-1-solution/

DavidBrower

//Find the sum of all the even-valued terms in the Fibonacci sequence which do not exceed four million.

let fibonacciSequence = Seq.unfold(fun (a, b) -> Some(a + b, (b, a + b))) (0L, 1L)

fibonacciSequence
    |> Seq.takeWhile (fun x -> x < 4000000L)
    |> Seq.filter (fun x -> x % 2L = 0L)
    |> Seq.sum

DavidBrower

open System

let isPrime (n : int64) =
    let upperBound = n |> float |> sqrt |> int64
    seq {2L .. upperBound}
        |> Seq.forall (fun x -> n % x <> 0L)

let getAllFactors (n : int64) =
    let upperBound = n / 2L
    seq {2L .. upperBound}

DavidBrower

//Based on Jake Harry's article on generating palindromes http://www.p196.org/papers10.html
open System

let getDistanceFromNextHundred n =
    100 - (n % 100)

let getTensForAddition n =
    Math.Ceiling(float n/ 10.) * 10.
    |> int

DavidBrower

// A palindromic number reads the same both ways.
//The largest palindrome made from the product of two
//2-digit numbers is 9009 = 91 × 99.

//Find the largest palindrome made from the product of
//two 3-digit numbers.
open System

let noOfDigits = 3

DavidBrower

using System;
using System.Collections.Generic;
using System.Disposables;
using System.IO;
using System.Linq;
using System.Net;
using System.Reflection;
using Funq;
using ServiceStack.Common.Web;
using ServiceStack.Service;