Kevin Cantú killerswan

## gist:913118
[~/Desktop]$ aptitude moo
There are no Easter Eggs in this program.
[~/Desktop]$ aptitude moo -vv
Didn't I already tell you that there are no Easter Eggs in this program?
[~/Desktop]$ aptitude moo -vvv
Stop it!
[~/Desktop]$ aptitude moo -vvvv
Okay, okay, if I give you an Easter Egg, will you go away?

## gist:941923
(* This uses the @ operator (aka List.append) which is not tail recursive *)
let suffixes list =
   let rec loop l acc =
      match l with
      | [] -> acc
      | x::xs -> loop xs (acc @ [xs]) in
   loop list [list]


(* This uses an operator @+ constructed from two tail recursive methods... :P *)

## gist:942108
(* Brian McNamara's approach isn't actually that bad, unless List had an efficient append.  But simplify it like so... *)

let suffixesTR3 list =
   let rec loop l acc =
      match l with
      | [] -> acc
      | _::xs -> loop xs (xs :: acc) in

   List.rev (loop list [list])

## gist:943878
let subs (s:string) =
   let lim = s.Length - 1

   [ for ii in [0..lim] do
      for jj in [0..lim] do  // can these two be combined?
         if ii < jj then
            yield s.[ii..jj] ]

let isPalindrome s =
   let s' = Array.ofSeq s

## centered_triangle.html
<!DOCTYPE html>
<html>
  <head>
    <style>
    body {
      margin: 40px;
    }

    a {
      display: inline-block;

## search.fsx
open System
open System.IO

// use an @ string
let list   = @"C:\list.txt"

// initialize a reader
let reader = new StreamReader(list)

// create a list of lines

## runfsi.fsx
#!/usr/bin/bash

FSI="/cygdrive/c/fsharp/FSharp-2.0.0.0/bin/fsi.exe"

FLAGS="--nologo"

if [[ $# -eq 0 ]]
then
   exec "$FSI" "$FLAGS"

## args2.fs
// Copyright © 2011, Kevin Cantu, me@kevincantu.org
//
// Usage: runfsi --nologo --exec args2.fs -- $@


module Simple

open System
open System.IO

## testingTreeView.cs
using System;
using System.IO;
using Gtk;

namespace DemoII
{
	public class FruitTreePiece
	{
		public string name;
		public string description;

## gist:1239784
fn f(s : option::t<str>) {
    let r = alt s {
        some(ss) { { x: 123, y: ss } }
        none.    { fail }
    };
}
	[~/Desktop]$ aptitude moo
	There are no Easter Eggs in this program.
	[~/Desktop]$ aptitude moo -vv
	Didn't I already tell you that there are no Easter Eggs in this program?
	[~/Desktop]$ aptitude moo -vvv
	Stop it!
	[~/Desktop]$ aptitude moo -vvvv
	Okay, okay, if I give you an Easter Egg, will you go away?
	(* This uses the @ operator (aka List.append) which is not tail recursive *)
	let suffixes list =
	let rec loop l acc =
	match l with
	\| [] -> acc
	\| x::xs -> loop xs (acc @ [xs]) in
	loop list [list]


	(* This uses an operator @+ constructed from two tail recursive methods... :P *)
	(* Brian McNamara's approach isn't actually that bad, unless List had an efficient append. But simplify it like so... *)

	let suffixesTR3 list =
	let rec loop l acc =
	match l with
	\| [] -> acc
	\| _::xs -> loop xs (xs :: acc) in

	List.rev (loop list [list])
	let subs (s:string) =
	let lim = s.Length - 1

	[ for ii in [0..lim] do
	for jj in [0..lim] do // can these two be combined?
	if ii < jj then
	yield s.[ii..jj] ]

	let isPalindrome s =
	let s' = Array.ofSeq s
	<!DOCTYPE html>
	<html>
	<head>
	<style>
	body {
	margin: 40px;
	}

	a {
	display: inline-block;
	open System
	open System.IO

	// use an @ string
	let list = @"C:\list.txt"

	// initialize a reader
	let reader = new StreamReader(list)

	// create a list of lines
	#!/usr/bin/bash

	FSI="/cygdrive/c/fsharp/FSharp-2.0.0.0/bin/fsi.exe"

	FLAGS="--nologo"

	if [[ $# -eq 0 ]]
	then
	exec "$FSI" "$FLAGS"
	// Copyright © 2011, Kevin Cantu, me@kevincantu.org
	//
	// Usage: runfsi --nologo --exec args2.fs -- $@


	module Simple

	open System
	open System.IO
	using System;
	using System.IO;
	using Gtk;

	namespace DemoII
	{
	public class FruitTreePiece
	{
	public string name;
	public string description;
	fn f(s : option::t<str>) {
	let r = alt s {
	some(ss) { { x: 123, y: ss } }
	none. { fail }
	};
	}