John Haugeland StoneCypher

## gist:8775541

-module(dumb_math).

-export([
    square/1
]).


## gist:8775605

-module(dumb_math_tests).
-compile(export_all).

-include_lib("eunit/include/eunit.hrl").

square_test_() ->

    { "Square tests", [

## gist:8775662

-module(dumb_math).

-export([
    square/1
]).


## gist:8775865

-module(dumb_math_tests).
-compile(export_all).

-include_lib("proper/include/proper.hrl").
-include_lib("eunit/include/eunit.hrl").


prop_square_never_negative() ->

## gist:9015456
<html><body>
<?php

  // normally i'd write this more densely, but you said you wanted some exposure
  // so i'm writing it in single concepts per line and annotating it for reference :)


  // config

## Eng10Trie.js
var Eng10Trie = '0:4JH
1:4JM
2:4JO
3:4H5
4:498
5:4IP
6:4J1
7:4J6
8:4HN
9:4HU

## levenshtein.js
function levenshtein (s, t) {

    if (!s.length) { return t.length; }
    if (!t.length) { return s.length; }

    return Math.min(
        levenshtein(s.substr(1), t) + 1,
        levenshtein(t.substr(1), s) + 1,
        levenshtein(s.substr(1), t.substr(1)) + (s[0] !== t[0] ? 1 : 0)
    );

## reporters.thanks

// spaces/tabs separate unless preceded with a comma, which makes list members, or surrounded by '', which makes js string notation
// first is operator; after that are expected-length varargs like irc

// 2nd argument to thanks is list of front of string matches for things raised by keyword report


## gist:9867401

upstring( [], Accumulator ) ->

    lists:reverse(Accumulator);


upstring( [Letter | StringRemainder], Accumulator) ->

## gist:11097913
receive

    case ->
        handler;

    case ->
        handler;

    case ->
        handler

	-module(dumb_math_tests).
	-compile(export_all).

	-include_lib("eunit/include/eunit.hrl").

	square_test_() ->

	{ "Square tests", [

	-module(dumb_math_tests).
	-compile(export_all).

	-include_lib("proper/include/proper.hrl").
	-include_lib("eunit/include/eunit.hrl").



	prop_square_never_negative() ->
	<html><body>
	<?php

	// normally i'd write this more densely, but you said you wanted some exposure
	// so i'm writing it in single concepts per line and annotating it for reference :)



	// config
	var Eng10Trie = '0:4JH
	1:4JM
	2:4JO
	3:4H5
	4:498
	5:4IP
	6:4J1
	7:4J6
	8:4HN
	9:4HU
	function levenshtein (s, t) {

	if (!s.length) { return t.length; }
	if (!t.length) { return s.length; }

	return Math.min(
	levenshtein(s.substr(1), t) + 1,
	levenshtein(t.substr(1), s) + 1,
	levenshtein(s.substr(1), t.substr(1)) + (s[0] !== t[0] ? 1 : 0)
	);

	// spaces/tabs separate unless preceded with a comma, which makes list members, or surrounded by '', which makes js string notation
	// first is operator; after that are expected-length varargs like irc

	// 2nd argument to thanks is list of front of string matches for things raised by keyword report

	upstring( [], Accumulator ) ->

	lists:reverse(Accumulator);





	upstring( [Letter \| StringRemainder], Accumulator) ->