Skip to content

Instantly share code, notes, and snippets.

View coyotebush's full-sized avatar

Corey Ford coyotebush

View GitHub Profile
(define-syntax (sdo stx)
(syntax-case stx (in-list)
[(sdo ([name <- comp] ...) final)
(foldr (lambda (n c next) #`(bind #,c (lambda (#,n) #,next)))
#'final
(syntax->list #'(name ...))
(syntax->list #'(comp ...)))]))

Keybase proof

I hereby claim:

  • I am coyotebush on github.
  • I am coyotebush (https://keybase.io/coyotebush) on keybase.
  • I have a public key whose fingerprint is 8AE8 3D54 29C7 2B78 54C0 A274 F745 EA21 9F68 D026

To claim this, I am signing this object:

@coyotebush
coyotebush / foss.tex
Created October 31, 2014 06:31
A five-minute introduction to the free software movement
\documentclass[14pt]{beamer}
\usepackage{lmodern}
\usepackage{textcomp}
\usepackage{moresize}
\usetheme{Berkeley}
\beamertemplatenavigationsymbolsempty
\renewcommand{\arraystretch}{1.2}
#!/usr/bin/env python
import struct
import sys
import binascii
# def str2bytes(string):
# return "".join("\\x" + "{0:02x}".format(ord(x)) for x in string)
def compare(bs, ks, tag=None):
if bs != ks:
@coyotebush
coyotebush / falling.c
Created April 13, 2014 15:49
My submissions to KTH Challenge 2014
#include <stdio.h>
int main() {
int D, n1, n2;
scanf("%d", &D);
for (n1 = 0; n1 < D; n1++)
for (n2 = 0; n2 < n1; n2++)
if ((n1 + n2) * (n1 - n2) == D) {
printf("%d %d\n", n2, n1);
return 0;
#!/usr/bin/python
"""
Merge bank transaction fees into the main transaction in GnuCash.
This script searches a given account for "fee" transactions with a certain
description. It then tries to find the corresponding "real" transaction, adds
the fee amount to the real transaction, and deletes the fee transaction.
Assumptions: "fee" transactions come (not necessarily consecutively) after