draftcode

all_fullscreen: all_fullscreen.cc
	${CXX} -std=c++11 -lX11 -lXinerama -lXrandr -o $@ $^

draftcode

int printf();

int main() {
  int (*fp)() = printf;
  fp = ******fp;
  (*********fp)("asdf\n");
}

draftcode

class TwoBucketShortestPathCalculator
  def initialize(cap_a, cap_b)
    @cap_a = cap_a
    @cap_b = cap_b
  end

  def answer
    @answer ||= calculate
  end

draftcode

#!/bin/bash

## Settings
# locations (use to be used Location name here)
ATHOME="home"
ATWORK="titech"

# detect HOME
ATHOME_SSID="home_router_ssid"
ATWORK_SSID="titech-pubnet"

draftcode

(define (gcd n m)
  (cond ((= n 0) m)
        ((= m 0) n)
        ((> n m) (print (remainder n m)) (gcd (remainder n m) m))
        ((< n m) (print (remainder m n)) (gcd (remainder m n) n))))

; {{{

(define (poly-remove0 l)
  (if (null? (cdr l)) l

draftcode

find /opt/local/share/texmf-* $HOME/.texmf-var -name ls-R -depth 1 -exec cat {} \; | grep .sty | sort

draftcode

#!/opt/local/bin/gosh
; 切符の足して10になるアレを解く
(use srfi-1)
(define Op '(Add Sub Mul Div))

(define (make-expr l r)
  (map (lambda (x) (list x l r)) Op))

(define (evaluate expr)
  (cond ((number? expr) expr)

draftcode

#!/usr/bin/env gosh
(use srfi-1)
(use srfi-13)

;; {{{ utility functions
(define (unique-list eq l)
  (if (null? l) l (lset-adjoin eq (unique-list eq (cdr l)) (car l) )))

(define (make-pair l)
  (if (= (length l) 2) (list l)

draftcode

#include <stdlib.h>
#include <stdio.h>

struct list {
    int val;
    struct list *next;
};

struct list *newlist()
{

draftcode

fun {Flatten Xs}
    case Xs
    of nil then nil
    [] X|Xr andthen {IsList X} then
        {Append {Flatten X} {Flatten Xr}}
    [] X|Xr then
        X|{Flatten Xr}
    end
end