bradyt

import 'dart:math';

void main() {
  var thing = [['a', 2.25], ['b', 1.99], ['c', 2.1]];
  print(thing);
}

bradyt

void main() {
  var world = 'world';
  var a = 'hello ${
    world
  }';
  print(a);
}

bradyt

import re

with open('./input') as f:
    content = f.readlines()

data = []
for line in content:
    m = re.match('#(\d+) @ (\d+),(\d+): (\d+)x(\d+)', line)
    next = [int(m.group(i)) for i in range(1, 6)]

bradyt

(require 'windmove)
(require 'evil nil t)

(global-set-key (kbd "<down>")  'windmove-down)
(global-set-key (kbd "<up>")    'windmove-up)
(global-set-key (kbd "<right>") 'windmove-right)
(global-set-key (kbd "<left>")  'windmove-left)

(when (require 'evil nil t)

bradyt

FROM silex/emacs

ADD .emacs.d /root/.emacs.d
RUN emacs -batch -l ~/.emacs.d/init.el

WORKDIR /root/
CMD "bash"

bradyt

import requests
import simplejson as json

# instructions on token start at https://developer.github.com/v3/?#authentication
# and end at https://github.com/settings/tokens
headers = {"Authorization": "token <token>"}

base_url = 'https://api.github.com/repos/<username>/<repo>'

def run_query(url):

bradyt

Keybase proof

I hereby claim:

• I am bradyt on github.
• I am bradyt (https://keybase.io/bradyt) on keybase.
• I have a public key ASB8sJVdAZEAAgj38WXurIvqMTZ9iwuC0QovM7TCTbBLdAo

To claim this, I am signing this object:

bradyt

; An example of YNAB-ish envelope budgetting with hledger/ledger
; cf https://github.com/simonmichael/hledger/issues/315

; Using accounts like the following:
;
; assets
;   business
;     bank
;       wf
;         bchecking

bradyt

Experiments in envelope budgetting.

See also:

• http://article.gmane.org/gmane.comp.finance.ledger.general/2162 (Roel V)
• https://groups.google.com/forum/#!topic/ledger-cli/vcD8sErX-eY (Martin B)
• http://orgmode.org/worg/org-tutorials/weaving-a-budget.html (somebody)
• http://sachachua.com/blog/2009/04/my-financial-network-map-and-virtual-envelope-system (Sacha Chua)
• http://paste2.org/s2E1bm8v , https://gist.github.com/sploot/9b5bd8443bea8b15ee81 (Kyle)

bradyt

sieve :: ([Int], [Int]) -> ([Int], [Int])

sieve p = if (null $ snd p)
          then p
          else sieve ( fst p ++ [ head $ snd p ]
                     , filter (\n -> (/=0) $ mod n $ head $ snd p ) $ tail $ snd p )

sieven :: Int -> [Int]
sieven n = fst $ sieve ([2], [3,5..n])