Skip to content

Instantly share code, notes, and snippets.

View coyotebush's full-sized avatar

Corey Ford coyotebush

View GitHub Profile
coyotebush / redmpi_async_functions.c
Created August 29, 2016 01:48
Asynchronous verification algorithms for RedMPI
#ifdef MRMPI_SDC_AsyncHash
* Verifies the integrity of messages between replicas using a delayed hash.
* May be called repeatedly on the same request.
* @param req The request type struct to veryify (IN).
* @return MPI_SUCCESS for success (including inconclusive situations
* where the procedure should be called again), or MPI_ERR_OTHER
* for error.
int MRMPI_Reqs_verifyintegrity_AsyncHash(MRMPI_ReqTypePtr req) {
coyotebush /
Last active February 5, 2016 18:24
SSH to lab workstations, even off campus
# adapted from:
if /sbin/ifconfig -a | grep -q 'inet 129\.65\.'; then
exec nc $1 $2
exec ssh -xaqW $1:$2 csc
coyotebush / C027_mdm_or_eth.cpp
Created May 27, 2015 04:48
switch between cellular modem and ethernet on u-blox C027
// Include in your project:
// plus, ONLY when compiling without CELLULAR_NETWORK:
#include "mbed.h"
// ...
{-# LANGUAGE ExistentialQuantification, ImpredicativeTypes, MultiParamTypeClasses, FlexibleInstances #-}
module Topics (topics) where
import XMonad
import XMonad.StackSet
import XMonad.Layout.Grid
import XMonad.Layout.PerWorkspace
import XMonad.Layout.Tabbed
data LayoutBox a = forall l. LayoutClass l a => LB (l a)
(define-syntax (sdo stx)
(syntax-case stx (in-list)
[(sdo ([name <- comp] ...) final)
(foldr (lambda (n c next) #`(bind #,c (lambda (#,n) #,next)))
(syntax->list #'(name ...))
(syntax->list #'(comp ...)))]))

Keybase proof

I hereby claim:

  • I am coyotebush on github.
  • I am 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 / foss.tex
Created October 31, 2014 06:31
A five-minute introduction to the free software movement
#!/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 / 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;
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