Thomas Parslow almost

## suggest.py
# Given a dictionary of words and scores and prefix return the top 10
# words in the dictionary that start with that prefix ordered by score
# (highest first)

# Builds a trie (a suffix tree) from the dictionary. The score
# ordering thing is my idea of how that could work, I haven't look at
# how others do it yet so it might be crazy :)

import random

## rotate_left.py
# Another from Programming Pearls (again, my attempt before reading
# the rest of the chapter). Rotate a vector left in place by some
# amount without using extra memory proportional to the length of the
# input vector and while running in in O(n)

def rotate_left(vec, n):
    i = 0
    start = 0
    letter = vec[i]
    seen = 0

## anagrams.py
# Another from Programming Pearls (again, my attempt before reading
# the rest of the chapter). Given a dictionary and a word, find all
# anagrams of the word in the dictionary.

words = (x.strip().lower() for x in open("/usr/share/dict/words"))
lookup = {}
for word in words:
    letters = "".join(sorted(list(word)))
    lookup.setdefault(letters, []).append(word)

## word-parse.py
# Solving the same problem as
# http://blogs.perl.org/users/ingy_dot_net/2015/11/perl-regular-expression-awesomeness.html
# but using a Trie instead of regexps, without backtracking and in
# Python
from itertools import groupby

phrase = "yougotmailmanners"

def makeTrie(words, prefix=""):
    node = {}

## index.html
<!DOCTYPE html>
<html lang="en">
    <head>
        <link
href="//netdna.bootstrapcdn.com/twitter-bootstrap/2.3.1/css/bootstrap-combined.min.css"
              rel="stylesheet">
    </head>
    <body>
        <div class="container">
            <div class="masthead">

## tweets.html
{% if tweets %}
<table class="table">
    <thead>
        <tr>
            <th>User</th>
            <th>Tweet</th>
            <th>When?</th>
            <th>View on Twitter</th>
        </tr>
    </thead>

## concurrentSQSDelete.js
var AWS = require('aws-sdk');
var SQSReadableStream = require('sqs-readable-stream');
var through2Concurrent = require('through2-concurrent');
var sqs = new AWS.SQS({
  apiVersion: '2012-11-05',
  region: 'us-east-1',
  accessKeyId: 'YOUR AMAZON ACCESS KEY'
});

var sqsStream = new SQSReadableStream({

## gist:7787374
(defun tom-show-agenda (prefix)
  (interactive "P")
  (org-agenda-list)
  (delete-other-windows)
  (unless prefix
    (calendar)
    (other-window 1)
    (split-window-vertically)
    (other-window 1)
    (find-daypage)))

## no-semis.js
export function pagebounds2screen({x, y, width, height}) {
  let ratio = window.devicePixelRatio
  [x,y] = page2screen(x, y)
  width = width * ratio
  height = height * ratio
  return {x, y, width, height}
}

## gist:8756247
$ ghc recross.hs  && ./recross
[2 of 2] Compiling Main             ( recross.hs, recross.o )
Linking recross ...

Iteration 0
      . . . . . . .
     . . . . . . . .
    . . . . . . . . .
   . . . . . . . . . .
  . . . . . . . . . . .
	# Given a dictionary of words and scores and prefix return the top 10
	# words in the dictionary that start with that prefix ordered by score
	# (highest first)

	# Builds a trie (a suffix tree) from the dictionary. The score
	# ordering thing is my idea of how that could work, I haven't look at
	# how others do it yet so it might be crazy :)

	import random
	# Another from Programming Pearls (again, my attempt before reading
	# the rest of the chapter). Rotate a vector left in place by some
	# amount without using extra memory proportional to the length of the
	# input vector and while running in in O(n)

	def rotate_left(vec, n):
	i = 0
	start = 0
	letter = vec[i]
	seen = 0
	# Another from Programming Pearls (again, my attempt before reading
	# the rest of the chapter). Given a dictionary and a word, find all
	# anagrams of the word in the dictionary.

	words = (x.strip().lower() for x in open("/usr/share/dict/words"))
	lookup = {}
	for word in words:
	letters = "".join(sorted(list(word)))
	lookup.setdefault(letters, []).append(word)
	# Solving the same problem as
	# http://blogs.perl.org/users/ingy_dot_net/2015/11/perl-regular-expression-awesomeness.html
	# but using a Trie instead of regexps, without backtracking and in
	# Python
	from itertools import groupby

	phrase = "yougotmailmanners"

	def makeTrie(words, prefix=""):
	node = {}
	<!DOCTYPE html>
	<html lang="en">
	<head>
	<link
	href="//netdna.bootstrapcdn.com/twitter-bootstrap/2.3.1/css/bootstrap-combined.min.css"
	rel="stylesheet">
	</head>
	<body>
	<div class="container">
	<div class="masthead">
	{% if tweets %}
	<table class="table">
	<thead>
	<tr>
	<th>User</th>
	<th>Tweet</th>
	<th>When?</th>
	<th>View on Twitter</th>
	</tr>
	</thead>
	var AWS = require('aws-sdk');
	var SQSReadableStream = require('sqs-readable-stream');
	var through2Concurrent = require('through2-concurrent');
	var sqs = new AWS.SQS({
	apiVersion: '2012-11-05',
	region: 'us-east-1',
	accessKeyId: 'YOUR AMAZON ACCESS KEY'
	});

	var sqsStream = new SQSReadableStream({
	(defun tom-show-agenda (prefix)
	(interactive "P")
	(org-agenda-list)
	(delete-other-windows)
	(unless prefix
	(calendar)
	(other-window 1)
	(split-window-vertically)
	(other-window 1)
	(find-daypage)))
	export function pagebounds2screen({x, y, width, height}) {
	let ratio = window.devicePixelRatio
	[x,y] = page2screen(x, y)
	width = width * ratio
	height = height * ratio
	return {x, y, width, height}
	}
	$ ghc recross.hs && ./recross
	[2 of 2] Compiling Main ( recross.hs, recross.o )
	Linking recross ...

	Iteration 0
	. . . . . . .
	. . . . . . . .
	. . . . . . . . .
	. . . . . . . . . .
	. . . . . . . . . . .