Michael Sproul michaelsproul

Here's the result when Family First ARE included in the count:

	# Run from within src

	import subprocess

	for err_no in range(500):
	err_string = "E%04d" % err_no

	# Determine if the error needs a message.
	try:
	subprocess.check_output(["git", "grep", err_string + ",", "librustc/diagnostics.rs"])

	-- Even vanilla Haskell is quite nice for scripting. I prefer it to Bash!
	import System.Directory
	import System.Posix.Files hiding (rename)

	main = do
	currDir <- getCurrentDirectory
	photos <- getDirectoryContents currDir
	mapM rename photos

	rename :: String -> IO ()

	{
	"E0001": {
	"description": "\nThis error suggests that the expression arm corresponding to the noted pattern\nwill never be reached as for all possible values of the expression being\nmatched, one of the preceding patterns will match.\n\nThis means that perhaps some of the preceding patterns are too general, this one\nis too specific or the ordering is incorrect.\n",
	"use_site": {
	"filename": "/home/michael/Programming/rust/src/librustc/middle/check_match.rs",
	"line": 334
	}
	},
	"E0002": {
	"description": "\nThis error indicates that an empty match expression is illegal because the type\nit is matching on is non-empty (there exist values of this type). In safe code\nit is impossible to create an instance of an empty type, so empty match\nexpressions are almost never desired. This error is typically fixed by adding\none or more cases to the match expression.\n\nAn example of an empty type is `enum Empty { }`.\n",

	fn uber<K, V, Key, Value, Output,
	RootFn, NoChildFn, FullMatchFn, PartialMatchFn, FirstPrefixFn>
	(
	trie: &mut Trie<K, V>,
	key: Key,
	value: Value,
	mut key_fragments: NibbleVec,
	root_fn: RootFn,
	no_child_fn: NoChildFn,
	full_match_fn: FullMatchFn,

	import Data.List

	data Task = Task {
	p :: Integer,
	l :: Integer,
	d :: Integer
	} deriving (Show, Eq)

	-- Compute the optimal penalty for a list of tasks.
	solve :: [Task] -> Integer

	#!/usr/bin/env python3

	# You probably shouldn't use this, it is guaranteed awful... Although it did work for me...

	import re
	import os
	import sys

	MAIN_REGEX = re.compile(rb".int.main.\(.int.argc.\).*")
	BRACE_REGEX = re.compile(rb".{.")

	pub fn parse_preferences_file<T: Read>(reader: &mut csv::Reader<T>, groups: &[Group],
	candidates: &[CandidateId], constraints: &Constraints)
	-> impl Iterator<Item=IOBallot>> {
	reader.decode::<PrefRow>()
	.map(\|raw\| parse_single_ballot(raw, groups, candidates, constraints))
	)
	}