Skip to content

Instantly share code, notes, and snippets.

Avatar

Pierre Irrmann pirrmann

View GitHub Profile
@pirrmann
pirrmann / TestCasesBuilder.fs
Created Nov 21, 2014
Using a computation expression to produce test cases
View TestCasesBuilder.fs
module TestCasesBuilder
open Microsoft.FSharp.Reflection
type TestCasesBuilder() =
member x.Zero() = Seq.empty
member x.Yield<'T>(t:'T) =
let value =
if FSharpType.IsTuple(typeof<'T>)
then t |> FSharpValue.GetTupleFields
@pirrmann
pirrmann / RulesBuilder.fs
Last active Aug 29, 2015
Scoped rules builder
View RulesBuilder.fs
type ScopeAndRules = | ScopeAndRules of string * int list
type RulesBuilder() =
member x.Yield(v) = []
[<CustomOperation("scope", MaintainsVariableSpace=true)>]
member x.Scope(source, scope) = ScopeAndRules(scope, []) :: source
[<CustomOperation("rule", MaintainsVariableSpace=true)>]
member x.Rule(source, rule) =
match source with
| ScopeAndRules(scope, rules) :: tail -> ScopeAndRules(scope, rule :: rules) :: tail
@pirrmann
pirrmann / Constraints
Created Apr 9, 2015
Statically resolved member constraints
View Constraints
type SyntaxToken = string
type X =
{
SomeProperty: string
} with
member this.AddModifiers(tokens:SyntaxToken array) =
{ this with
SomeProperty = sprintf "%s + %s" (this.SomeProperty) (System.String.Join(",", tokens)) }
@pirrmann
pirrmann / Nat.fs
Last active Dec 25, 2015 — forked from akimboyko/Nat.fs
An implementation of basic non-negative integers, based on https://gist.github.com/akimboyko/7019648, but rewritten in a more F# idiomatic way
View Nat.fs
//An implementation of basic non-negative integers, based on https://gist.github.com/akimboyko/7019648,
//but rewritten in a more F# idiomatic way
module Naturals
open System
type Natural =
| Zero
| Succ of Natural
member x.IsZero' = x = Zero
@pirrmann
pirrmann / RPN.fs
Last active Jan 15, 2016
Reverse Polish Notation
View RPN.fs
let (|Operator|_|) s =
match s with
| "+" -> Some (+)
| "-" -> Some (-)
| "*" -> Some (*)
| "/" -> Some (/)
| _ -> None
let eval state input =
match input, state with
View keybase.md

Keybase proof

I hereby claim:

  • I am pirrmann on github.
  • I am pirrmann (https://keybase.io/pirrmann) on keybase.
  • I have a public key whose fingerprint is C754 AB85 AFA5 4BC4 12CA BDF5 7CE5 02AF 2D5C C545

To claim this, I am signing this object:

View ChaosBuilder.fsx
#r "packages/Unquote/lib/net45/Unquote.dll"
open FSharp.Quotations
open Swensen.Unquote
type IMutationSitePicker =
abstract member PickNextSite: bool
abstract member NotifyIgnoredSite: unit -> unit
abstract member NotifyMutation: unit -> unit
@pirrmann
pirrmann / Dynamic.fsx
Created Sep 19, 2016
F# Dynamic property get with null values
View Dynamic.fsx
open FSharp.Interop.Dynamic
open Dynamitey
let dynamicPropertyGet<'TResult> (name:string) (target:obj) : 'TResult option =
let resultType = typeof<'TResult>
let (|NoConversion| Conversion|) t = if t = typeof<obj> then NoConversion else Conversion
let convert r = match resultType with | NoConversion -> r | _ -> dynImplicit(r)
match target with
@pirrmann
pirrmann / Parsing.fsx
Last active Oct 12, 2016
Titanic CSV loading
View Parsing.fsx
let file = System.IO.File.ReadAllText(__SOURCE_DIRECTORY__ + "/training.csv")
let parseLine line =
let makeWord = Seq.rev >> Seq.toArray >> System.String
let rec parseFields chars =
match chars with
| '\"' :: chars' -> parseEscaped [] chars'
| chars' -> parseUnescaped [] chars'
and parseEscaped acc chars = seq {
View BindMany.fsx
type Result<'T> =
| Success of 'T
| Failure of string
let bind f = function | Success a -> f a | Failure b -> Failure b
let map f = function | Success a -> Success (f a) | Failure b -> Failure b
let private combine2 fn2 fn1 arg =
match (fn1 arg, fn2 arg) with
| Success a, Success b -> Success (a, b)