| import Control.Monad | |
| import Control.Monad.ST | |
| import Data.Array.MArray | |
| import Data.Array.ST | |
| import Data.STRef | |
| import Prelude hiding (id) | |
| data UnionFind s = UnionFind { | |
| ids:: STUArray s Int Int |
Press minus + shift + s and return to chop/fold long lines!
| Require Import Coq.Lists.List. | |
| Open Scope bool_scope. | |
| (* This is a direct definition of CGTs, using just one inductive type | |
| instead of a pair of mutually-inductive types *) | |
| Inductive game := Game { | |
| left_moves : list game; | |
| right_moves : list game |
| {- | |
| Andrew Miller | |
| Authenticated Data Structures, Generically: | |
| Merkle-ized Lambda Calculator | |
| -} | |
| {-# LANGUAGE GADTs, | |
| FlexibleInstances, FlexibleContexts, UndecidableInstances, | |
| StandaloneDeriving, TypeOperators, Rank2Types, |
| % MIPS Assembly language definition for the LaTeX `listings' package | |
| % | |
| % The list of instructions and directives are those understood by the | |
| % MARS MIPS Simulator [http://courses.missouristate.edu/KenVollmar/MARS/] | |
| % | |
| % Author: Eric Walkingshaw <[email protected]> | |
| % | |
| % This code is in the public domain. | |
| % | |
| % Here is an example style. I like it for slides, but you might want |
I will maybe someday get around to dusting off my C and making these changes myself unless someone else does it first.
Imagine a long-running development branch periodically merges from master. The
git log --graph --all --topo-order is not as simple as it could be, as of git version 1.7.10.4.
It doesn't seem like a big deal in this example, but when you're trying to follow the history trails in ASCII and you've got several different branches displayed at once, it gets difficult quickly.
There are two types (actually more, but for the problem at hand only these two are important):
flat strings are immutable arrays of characters
cons strings are pairs of strings, result of concatenation.
If you concat a and b you get a cons-string (a, b) that represents result of concatenation. If you later concat d to that you get another cons-string ((a, b), d).
Indexing into such a "tree-like" string is not O(1) so to make it faster V8 flattens the string when you index: copies all characters into a flat string.
| #!/bin/bash | |
| # Script for installing tmux on systems where you don't have root access. | |
| # tmux will be installed in $HOME/local/bin. | |
| # It's assumed that wget and a C/C++ compiler are installed. | |
| # exit on error | |
| set -e | |
| TMUX_VERSION=1.8 |
