Skip to content

Instantly share code, notes, and snippets.

# luxbockluxbock

• Sort options
Created Oct 3, 2014
crypto-notes
View crypto-coursera.org

Course name: Cryptography 1 URL: https://class.coursera.org/crypto-007/class

# Lectures

## Week 1

### Course Overview (11 min)

• HTTPS is actually not a protocol of its own. It’s simply regular HTTP on top of SSL/TLS.
Created Dec 29, 2014
Clojure Zipper Breadth First Search
View bfs.clj
 (defn breadth-first-search [z] (letfn [(zip-children [loc] (when-let [first-child (zip/down loc)] (take-while (comp not nil?) (iterate zip/right first-child))))]) (loop [ret [] queue (conj clojure.lang.PersistentQueue/EMPTY z)] (if (seq queue) (let [[node children] ((juxt zip/node zip-children) (peek queue))] (recur (conj ret node) (into (pop queue) children)))
Created Sep 11, 2018
View prime_eval.lean
 namespace hidden open classical open decidable local attribute [instance] prop_decidable def divides (m n : ℕ) : Prop := ∃ k, m * k = n instance : has_dvd ℕ := ⟨divides⟩
Created Sep 10, 2018
View halp.lean
 open classical variables (α : Type) (p q : α → Prop) variable r : Prop variable a : α example : (∃ x, p x → r) ↔ (∀ x, p x) → r := iff.intro (assume ⟨a, pair⟩, assume h : ∀ x, p x,
Created Sep 4, 2018
View inference_fail.lean
 example : p ∧ (q ∨ r) ↔ (p ∧ q) ∨ (p ∧ r) := iff.intro (assume h : p ∧ (q ∨ r), have hp : p, from h.left, or.elim h.right (assume hq, or.inl ⟨hp, hq⟩) (assume hr, or.inr ⟨hp, hr⟩)) (assume h : (p ∧ q) ∨ (p ∧ r), or.elim h (assume hpq,
Created Aug 27, 2018
View lean_hmm.lean
 example : ((p ∨ q) → r) ↔ (p → r) ∧ (q → r) := iff.intro (assume h, _) /- propositions_as_types.lean:432:13: error don't know how to synthesize placeholder context: p q r : Prop, h : p ∨ q → r ⊢ (p → r) ∧ (q → r)
Created Mar 5, 2018
View aoc-day3.rs
 /// Santa is delivering presents to an infinite two-dimensional grid of houses. /// /// He begins by delivering a present to the house at his starting location, and then an elf at the North Pole calls him via radio and tells him where to move next. Moves are always exactly one house to the north (^), south (v), east (>), or west (<). After each move, he delivers another present to the house at his new location. /// /// However, the elf back at the north pole has had a little too much eggnog, and so his directions are a little off, and Santa ends up visiting some houses more than once. How many houses receive at least one present? /// /// For example: /// /// > delivers presents to 2 houses: one at the starting location, and one to the east. /// ^>v< delivers presents to 4 houses in a square, including twice to the house at his starting/ending location.
Created Mar 21, 2017
View every-nth.clj
 (defnav every-nth [n] (select* [this structure next-fn] (next-fn (take-nth n structure))) (transform* [this structure next-fn] (let [xform (comp (map-indexed (fn [i x] (if (zero? (mod i n)) (next-fn x) x)))
Created Mar 21, 2017
View navs.clj
 (defnav drop-nav [n] (select* [this structure next-fn] (next-fn (if (vector? structure) (subvec structure (min n (count structure))) (drop n structure)))) (transform* [this structure next-fn] (if (vector? structure) (let [mi (min n (count structure))] (into (subvec structure 0 mi)
Created Mar 21, 2017
View take-nth.clj
 (defnav take-nth [n] (select* [this structure next-fn] (next-fn (take-nth n structure))) (transform* [this structure next-fn] (if (vector? structure) (let [c (count structure) is (into [] (take-while #(< % c)) (iterate #(+ % n) 0))]
You can’t perform that action at this time.