ghadishayban

(ns weighted-rand
  (:import clojure.lang.PersistentQueue))

(defprotocol Rand
  (nextr [_ rng]))

;; Vose's alias method
;; http://www.keithschwarz.com/darts-dice-coins/

(deftype Vose [n ^ints alias ^doubles prob]

hiredman

(defn double-map [f]
  (let [^clojure.lang.IFn$DD f f]
    (fn [f1]
      (if (instance? clojure.lang.IFn$DDD f1)
        (let [^clojure.lang.IFn$DDD f1 f1]
          (fn
            ([] (f1))
            (^double [^double result] (.invokePrim ^clojure.lang.IFn$DD f1 result))
            (^double [^double result ^double input]
                     (.invokePrim f1 result (.invokePrim f input)))

reborg

# List of all the valid pdf URLs ever posted to the #Clojure IRC channel.
#
# Many of them are interesting CS papers others are not that useful. What I've done:
#
# 1. crawled an IRC history archive for the channel
# 2. extract pdf list in a file with: grep -riIohE 'https?://[^[:space:]]+pdf' * > pdf-links.txt
# 3. remove dupes: cat pdf-links.txt | sort | uniq > pdf-links-uniq.txt
# 4. filter only HTTP 200: cat pdf-links-uniq.txt | xargs curl -o /dev/null --connect-timeout 2 --silent --head --write-out '%{http_code} %{url_effective}\n' | grep "^200" > valid-pdf-links.txt
# 
# Now your choice to download them all or not. If you want, use: cat valid-pdf-links.txt | awk '{print $2}' | xargs wget

stathissideris

(defn tree-seq-depth
  "Returns a lazy sequence of vectors of the nodes in a tree and their
  depth as [node depth], via a depth-first walk.  branch? must be a fn
  of one arg that returns true if passed a node that can have
  children (but may not).  children must be a fn of one arg that
  returns a sequence of the children. Will only be called on nodes for
  which branch? returns true. Root is the root node of the tree."
  [branch? children root]
  (let [walk (fn walk [depth node]
               (lazy-seq

jduey

toccata

(def true)
(def false)
(def abort)
(def get-type)
(def type=)
(def subs)
(def number-str)

oakes

Contents

• Why care about Rust?
• The Toolchain
• Creating a New Project
• Modules
• Crates
• Types
• References
• Mutability

alandipert

;; Copyright (c) Alan Dipert. All rights reserved.
;; The use and distribution terms for this software are covered by the
;; Eclipse Public License 1.0 (http://opensource.org/licenses/eclipse-1.0.php)
;; By using this software in any fashion, you are agreeing to be bound by
;; the terms of this license.
;; You must not remove this notice, or any other, from this software.

(defn paths
  "Enumerate paths into a nested map."
  ([root]

gfredericks

#
# In your project.clj, make sure you're currently using test.check
# version 0.7.0, then add a plugins entry:
#
#   :plugins [[com.gfredericks/corncob-cigar "0.1.4"]]
#
# Then run:

echo "Testing 0.7.0..." > test.check.log
lein do clean, benchmark-task 10 test 2>/dev/null | grep "Ran task 10 times" >> test.check.log

rbobbins

PS: If you liked this talk or like this concept, let's chat about iOS development at Stitch Fix! #shamelessplug

Protocol-Oriented Programming in Swift

Speaker: David Abrahams. (Tech lead for Swift standard library)

• "Crusty" is an old-school programmer who doesn't trust IDE's, debuggers, programming fads. He's cynical, grumpy.

• OOP has been around since the 1970's. It's not actually new.

• Classes are Awesome

  • Encapsulation
  • Access control

andymatuschak

// One note before we start: if the inhabitants of Value are a closed set,
// then making Value an enum is going to be a clearer model than using a
// protocol like this. I'm assuming you need to be able to retroactively add
// new members of Value.

// Can't use Equatable directly because of its Self requirement.
protocol HeteroEquatable {
    func isEqualTo(value: HeteroEquatable) -> Bool
}