Skip to content

Instantly share code, notes, and snippets.

@ray1729
ray1729 / gist:4228815
Created December 6, 2012 21:50
My first parsatron
(ns parsatron-play.core
(:refer-clojure :exclude [char])
(:require [the.parsatron :refer :all]))
;; Goal is to parse something like:
;; ##INFO=<ID=foo,Type=Integer,Number=1,Description="Some description, which may contain commas">
(defparser not-char [& cs]
(token (complement (set cs))))
@ray1729
ray1729 / for_science.clj
Created September 10, 2012 21:46
Solution to 4clojure problem 117
(fn solve-maze
[maze]
(let [num-rows (count maze)
num-cols (count (first maze))
char-at-pos (fn [[row col]] (get (get maze row) col))
free? (fn [p] (when-let [c (char-at-pos p)] (not= c \#)))
neighbours (fn [[row col]] (filter free? (map (fn [[delta-row delta-col]]
[(+ row delta-row)
(+ col delta-col)])
[[0 0] [0 1] [0 -1] [1 0] [-1 0]])))
#!/usr/bin/env perl
use strict;
use warnings FATAL => 'all';
use List::Util qw(max min);
my @COLS = qw( label _ chr strand start end );
my @KEY_COLS = qw( label chr strand );
@ray1729
ray1729 / uniq.pl
Created June 14, 2012 09:49
Build array of unique data from a file
#!/usr/bin/env perl
use strict;
use warnings FATAL => 'all';
my %seen;
my @uniq;
while ( <> ) {
chomp;
@ray1729
ray1729 / gist:1349435
Created November 8, 2011 22:10
How many ways can we roll 10 dice and have all the digits 1-6 appear at least once?
(defn factorial [n] (reduce * (range 1 (inc n))))
(defn multinomial [n & ms]
(/ (factorial n) (reduce * (map factorial ms))))
(def N (reduce + (for [m1 (range 1 6)
m2 (range 1 (- 7 m1))
m3 (range 1 (- 8 m1 m2))
m4 (range 1 (- 9 m1 m2 m3))
m5 (range 1 (- 10 m1 m2 m3 m4))
@ray1729
ray1729 / gist:1217621
Created September 14, 2011 20:01
Minimal set containing at least one element from each of a list of sets
(ns clj-playground.enzyme-selection
(:require [clojure.data.csv :as csv]
[clojure.java.io :as io]))
(defn read-enzyme-data
"Read clone/analysis/enzyme data from CSV file filename. Group
enzymes for each clone/analysis pair into a set and return a list of
sets of enzymes"
[filename]
(with-open [in-file (io/reader filename)]
(defn parse-flags
"Parse a list of flags. Each flag name must be a keyword, and the
value must not be a keyword. If the value is omitted, true is
assumed. Returns a map.
e.g. (parse-flags [:i :j 1 :k \"two\"])
=> {:i true, :j 1, :k \"two\"}"
[flags]
(loop [flags (seq flags) accum {}]
(if flags
@ray1729
ray1729 / gist:896702
Created March 31, 2011 16:30
Possible Regexp::Common API for Clojure
;; Perl: $RE{num}{-base => 2}{real}{-group => 3}{-sep => ','}
(re-seq (re :real {:base 2 :group 3 :sep \,} ) "1.345")
@ray1729
ray1729 / gist:848069
Created February 28, 2011 21:24
Example keep-only implementation to keep at most n elements in each bucket of a sequence
(defn keep-only
[n bucket-fn s]
(letfn [(my-filter
[s seen]
(when (seq s)
(let [e (first s)
b (bucket-fn e)
c (inc (get seen b 0))]
(if (> c n)
(recur (rest s) seen)
@ray1729
ray1729 / secret_santa.clj
Created November 23, 2010 16:39
Pair up names for Secret Santa
(defn secret-santa
[names]
(let [s (shuffle names)]
(partition 2 1 (cons (last s) s))))