Skip to content

Instantly share code, notes, and snippets.

View st's full-sized avatar

Stephane Tavera st

  • Geneva, Switzerland
View GitHub Profile
@st
st / gist:5a030558b41cdce3e3c6
Created December 19, 2014 08:47
git update (CVE-2014-9390)
# on mac os X
# in case, your git is the "apple" version
sudo mv /usr/bin/git /usr/bin/git-apple
brew install git
brew update && brew upgrade git
sudo ln -s /usr/local/bin/git /usr/bin/git
# in case, it's already managed by brew
brew update && brew upgrade git
; Original problem here : http://www.4clojure.com/problem/144
; This first solution works but is incomplete as fs needs to be repeated.
(defn osci-incomplete [v & fs]
(reduce (fn [accu elt] (conj accu (elt (last accu))))
[v] fs))
; Problem is that cycling fs leads to timeout.
@st
st / gist:2850385
Created June 1, 2012 08:37
leiningen problem
$ java -version
java version "1.6.0_31"
Java(TM) SE Runtime Environment (build 1.6.0_31-b04-415-11M3635)
Java HotSpot(TM) 64-Bit Server VM (build 20.6-b01-415, mixed mode)
$ lein2 -v
Leiningen 2.0.0-preview4 on Java 1.6.0_31 Java HotSpot(TM) 64-Bit Server VM
$ lein2 new project
Generating a project called project based on the 'default' template.
@st
st / monty_hall.rb
Created February 16, 2012 13:25
Monty Hall Problem
@wins_sticky = 0
@wins_change = 0
@nb_parties = 1000
@possibles = [0, 1, 2]
def play
winner = rand(3)
first_choose = rand(3)
others = @possibles - [first_choose]
discarded = others.include?(winner) ? (others - [winner]).first : others[rand(2)]
(def rules {7 "Qix" 5 "Bar" 3 "Foo"})
(defn div [[n s]]
(fn [[x accu]]
[x (str accu (when (= 0 (rem x n)) s))]))
(defn to-ints [x]
(map #(- (int %) 48) (seq (str x))))
(defn has [[x accu]]