bradlucas

git filter-branch --prune-empty --subdirectory-filter my_folder_name

bradlucas

Contents

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

bradlucas

Lecture 1: Introduction to Research — [📝Lecture Notebooks] [▶️Video]
Lecture 2: Introduction to Python — [📝Lecture Notebooks] [▶️Video]
Lecture 3: Introduction to NumPy — [📝Lecture Notebooks] [▶️Video]
Lecture 4: Introduction to pandas — [📝Lecture Notebooks] [▶️Video]
Lecture 5: Plotting Data — [📝Lecture Notebooks] [[▶️Vide

bradlucas

; Interested in a short introduction to hadoop mapreduce?
(declare mapreduce)


; Let's look at the "hello world job" ie word count.
(def input [
           [1 "hadoop map-reduce explained"]
           [2 "with clojure map, reduce and mapcat"]
           [3 "using the world count example"]])

bradlucas

Introductory resources

• High level overview https://yogthos.github.io/ClojureDistilled.html
• Interactive exercises http://clojurescriptkoans.com/
• Community-powered Clojure courses https://clojurecademy.com/
• Interactive book https://www.maria.cloud/
• Interactive workbook http://viewer.gorilla-repl.org/view.html?source=github&user=lspector&repo=clojinc&path=worksheet.clj
• Clojure workshop https://github.com/friemen/cugb/blob/master/kickstart.md
• Clojure style guide https://github.com/bbatsov/clojure-style-guide

bradlucas

(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

bradlucas

bradlucas

bradlucas

bradlucas