saevarb

  build-depends:       MonadRandom
                     , array
                     , base
                     , megaparsec
                     , mtl
                     , random
                     , shelly
                     , text >= 1.2.2.1
                     , hsc

saevarb

takeTree :: Int -> Tree m v -> Tree m v
takeTree 0 (Tree v _) = Tree v []
takeTree _ (Tree v []) = Tree v []
takeTree n (Tree v ch) =
    Tree v (map (foo (n - 1)) ch)
  where
    foo n (m, t) = (m, takeTree n t)

saevarb

(defun sbrg:haskell-run-main (a)
  (interactive "P")
  (save-excursion
    (haskell-interactive-mode-run-expr "main")
    )
  )

saevarb

module Day1 where
import Control.Arrow
import Data.List
import Data.Char
import Data.Function
import Data.Ord

import Util

readInput = readFile "inputs/input1"

saevarb

(setq-local sbrg:pairs
            '(("(" . ")")
              ("[" . "]")
              ("{" . "}")
              ("\"")
              ("\'")
              ))

(dolist (pair sbrg:pairs)
  (let* ((lhs (car pair)) (rhs (cdr pair)) fn)

saevarb

foo(X, Y, S) :-
    between(0, S, X),
    between(0, S, Y),
    S is X + Y,
    C is Y * 2,
    C == X.

saevarb

foo(X, Y, S) :-
    between(0, S, X),
    between(0, S, Y),
    S is X + Y,
    C is Y * 2,
    C == X.

saevarb

\begin{align*}
  p(b = 0 | y' = m) = \\
  p(b = 0 | y' \neq m) = \\
  p(b = 1 | y' = m) = \\
  p(b = 1 | y' \neq m) = \\
\end{align*}

saevarb

#!/usr/bin/env bash

set -euo pipefail

for file in ExamplePrograms/*; do
    printf "Testing %s.." "$file";
    ./compiler < "$file" > foo.s;
    gcc -m32 foo.s;
    ./a.out;
    echo "==";

saevarb

;; Liek this
<this_is_a_long_nick> foo
<short_nick>          bar

;; Instead of this
<this_is_a_long_nick> foo
<short_nick> bar