#include <stdlib.h>
#include <stdio.h>

/// binary tree node type

def LCS(a, b):
    # table, a down the vertical, b on the horizontal
    table = [["" for _ in range(len(b) + 1)] for __ in range(len(a) + 1)]

import math

print "F", math.floor(3.0 / 2.0) == math.ceil(3.0 / 2.0)
print "I", math.floor(3 / 2) == math.ceil(3 / 2)
print "Fmod", math.fmod(3.0, 2.0) == 0

#include <cstdio>

class Foo {
public:
Foo(void) throw() { }

#include <cstdio>

class Foo {
public:
Foo(void) throw() { }

def back_substitution(M, X, n):
    """Compute MR = X for some n*n upper-triangular matrix M and
       some n*m matrix X."""

dyn129-100-198-166:FLTL petergoodman$ ./bin/grail --tool=cfg-parse ./test/commandtalk.cfg 
reading...
computing null set...
parsing...
looking at token 'xray'...

def ignore(obj):
    return None

def identity(obj):
    return obj

/*
 * main.cpp
 *
 *  Created on: Dec 8, 2010
 *      Author: Peter Goodman

/*
 * main.cpp
 *
 *  Created on: Dec 8, 2010
 *      Author: Peter Goodman

/*
 * main.cpp
 *
 *  Created on: Dec 8, 2010
 *      Author: Peter Goodman

M = { }

def term(t):
    def match(l,s,ret):

from itertools import product
from copy import deepcopy

class Contradiction(Exception):

<?php

/**
 * Make an object that isn't an array into an array containing that object, or
 * return the element if it is an array.

NO_PLAYER = 0
PLAYER_1 = 1
PLAYER_2 = 2

def search(seq):

NO_PLAYER = 0
PLAYER_1 = 1
PLAYER_2 = 2

def search(seq):

# (c) 2009 Peter Goodman, all rights reserved
# Solutions for UWO CS3346a Assignment 1 Question 4

LEFT, RIGHT = 0, 1
INITIAL_STATE, GOAL_STATE = (3, 3, 0, 0, LEFT), (0, 0, 3, 3, RIGHT)

LEFT, RIGHT = 0, 1

def states():
    """Generate all possible states for the missionaries and cannibals 

/*
 * regexp-parser.c
 *
 *  Created on: Jun 22, 2009
 *      Author: petergoodman

/*
 * regexp-parser.c
 *
 *  Created on: Jun 22, 2009
 *      Author: petergoodman

/*
 * regexp-parser.c
 *
 *  Created on: Jun 22, 2009
 *      Author: petergoodman

def sum1to(n):
    """
    choose2(int) -> int
    

Requirements
    Overview of types:
        Seller

<?php

/**
 * $header
 * @copyright Copyright 2007, Peter Goodman

<?php

class Query {
    public function execute() {
        

<?php

/* $Id: help.php 172 2008-07-23 15:48:01Z peter.goodman $ */

/**

<?php

/**
 * An iterator that acts as a window to its inner-iterator. It does this by
 * providing deque-like functionality (allowing shifting off the front and

<?php

$arr = array(
    'a', 'b', 'c', 'c', 'd','e', 'e',
    'e', 'e', 'e', 'f', 'e', 'f', 'e',

<?php

/**
 * CodeIgniter library to interface with the Akismet API.
 * @author Peter Goodman

<?php

error_reporting(E_ALL | E_STRICT);

define('DIR_WORKING', dirname(__FILE__));

<?php

error_reporting(E_ALL | E_STRICT);

define('DIR_WORKING', dirname(__FILE__));

<?php

error_reporting(E_ALL | E_STRICT);

/**

<?php

error_reporting(E_ALL | E_STRICT);

/**

<?php

// yikes!
!defined('WP_MAIN_DIR') && 
    define('WP_MAIN_DIR', dirname(dirname(dirname(dirname(__FILE__)))));

<?php

require_once dirname(__FILE__). '/__include__.php';
require_once dirname(__FILE__). '/linear-state-machine.php';

<?php

require_once dirname(__FILE__). '/__include__.php';

/**

<?php

if(!function_exists('array_copy')) {
    /**
     * Make a deep copy of an array of a tuple

<?php

error_reporting(E_ALL | E_STRICT);

!defined("APPPATH") && define("APPPATH", dirname(__FILE__));

<?php

/**
 * Exception class for the XMLDocument class.
 */

Download TARs of:

php
apache httpd
newest MySQL

def matrix_chain_product(*S):
    """Given a sequence, S, of matrices, calculate the minimum number of scalar
       operations needed to multiply all of them together."""
    

def edit_distance(A, B):
    """Calculate the edit distance (levenshtein) between strings A and B.
       Also, generate the longest common subsequence from the resulting matrix
       after edit distance has been calculated."""

def morris_pratt(P, T):
    """Search for a pattern, P, in some text, T, using the Morris-Pratt
       algorithm."""
    

def quick_sort_inplace(L):
    """Perform an in-place quicksort of the list L."""
    
    # used for finding random numbers

def merge_sort(A):
    """Merge sort a list using the divide-and-conquer method."""
    
    # we will need these two functions to divide a list

def radix_sort(A, highest=None):
    """Stable sort an array A of positive integers in logarithmic time by sorting
       the numbers one digit at a time, starting with the most significant
       digit. The sorting by digits is done using a simplified bucket sort."""

def longest_common_subsequence(A, B):
    """Determine how long the longest common subsequence of A and B are, then
       reconstruct it."""
    

def boyer_moore(P, T):
    """Search for P in T using the Boyer Moore algorithm assuming a ascii
       character set."""
    

def quick_sort(A, compare=None):
    """Perform a quicksort on a list of items, A, by recursively dividing 
       and conquering through partitioning."""