Skip to content

Instantly share code, notes, and snippets.

Compiling doubletake.java.spec.core
Exception in thread "main" java.lang.ClassNotFoundException: doubletake.java.spec.DependTree (core.clj:1)
at clojure.lang.Compiler$InvokeExpr.eval(Compiler.java:2911)
at clojure.lang.Compiler.compile1(Compiler.java:5933)
at clojure.lang.Compiler.compile1(Compiler.java:5923)
at clojure.lang.Compiler.compile(Compiler.java:5992)
at clojure.lang.RT.compile(RT.java:368)
at clojure.lang.RT.load(RT.java:407)
at clojure.lang.RT.load(RT.java:381)
at clojure.core$load$fn__4511.invoke(core.clj:4905)
(ns alice.core)
(defn candy-delta [ivec]
(map first
(reduce (fn [pr c]
(let [[ps pv] (last pr)]
(conj pr
(cond (empty? pr) [1 c]
(= pv c) [ps pv]
(< pv c) [(inc ps) c]
@arrdem
arrdem / 352h-arch.txt
Created September 18, 2012 22:05
CS 352H Final Processor Architecture
#CPU Architecture Specification for CS 352H - Fall 2012
- Special Registers
- Function Calls
- Interrupts
- Virtual Mem.
- Register Windows
- Memory Addressing Modes
- Immediate Values
##Conventions
@arrdem
arrdem / gist:4712024
Last active December 12, 2015 04:08
A simple qsort implementation in Clojure
(defn %remove-first [val seq]
(loop [h seq
t []]
(if (empty? h)
t
(if (= (first h) val)
(concat t (rest h))
(recur (rest h) (conj t (first h)))))))
(defn qsort [seq]
@arrdem
arrdem / gist:4712032
Last active December 12, 2015 04:08
A simple msort implementation in Clojure
(defmacro recurse [v]
(if (= v :left)
`(recur ~'l (rest ~'r) (conj ~'res (first ~'r)))
`(recur (rest ~'l) ~'r (conj ~'res (first ~'l)))))
(defn %merge [l r]
(loop [l l
r r
res []]
(if (every? empty? [l r])
#!/usr/bin/env python3
# Authored by Reid "arrdem" McKenzie, 10/22/2013
# Licenced under the terms of the EPL 1.0
import cortex.stats as stats
def attack_perm_generator(weapons, src_model, tgt_model,
focus=0, can_boost_hit=True):
"""Recursively compute attack options over two models, focus and weapons!
@arrdem
arrdem / typed_graph.clj
Created October 2, 2013 16:47
A toy directed graph imp'l with nonworking core.typed annotations.
(ns name.arrdem.bored.typed-graph
(:require [clojure.core.typed :as type])
(:refer-clojure :exclude [hash]))
;;------------------------------------------------------------------------------
;; Simple graph API
(def Node clojure.lang.Keyword)
(def Graph (type/Map Node (type/Seq Node)))
#verifymyonename +arrdem
(ns docs)
(defn var-name
[v]
(symbol
(-> v .ns ns-name str)
(-> v .sym str)))
(defn print-vars
[vars]

Keybase proof

I hereby claim:

  • I am arrdem on github.
  • I am arrdem (https://keybase.io/arrdem) on keybase.
  • I have a public key whose fingerprint is 2E9E B05E 6243 1469 ED24 78C2 F02B FCEE 0A85 EC53

To claim this, I am signing this object: