Merging from the official book repository

Author: abedra

.gitignore

@@ -1,4 +1,3 @@
-
 /Programming-Clojure.iml
 /build.clj
 /hello.out

classes/examples/tasklist.class

@@ -0,0 +1 @@
+web: lein run

classes/examples/tasklist__init.class

@@ -0,0 +1,17 @@
+# clojurebreaker
+
+A website written in noir. 
+
+## Usage
+
+```bash
+lein deps
+lein run
+```
+
+## License
+
+Copyright (C) 2011 FIXME
+
+Distributed under the Eclipse Public License, the same as Clojure.
+

clojurebreaker/Procfile

@@ -0,0 +1,9 @@
+; START: clojurebreaker-project
+(defproject clojurebreaker "0.1.0-SNAPSHOT"
+            :description "Clojurebreaker game for Programming Clojure 2nd Edition"
+            :dependencies [[org.clojure/clojure "1.3.0"]
+                           [org.clojure/math.combinatorics "0.0.1"]
+                           [org.clojure/test.generative "0.1.3"]
+                           [noir "1.2.0"]]
+            :main clojurebreaker.server)
+; END: clojurebreaker-project

clojurebreaker/README.md

@@ -0,0 +1,57 @@
+html {
+	margin:0;
+	padding:0;
+	border:0;
+}
+
+body, div, span, object, iframe,
+h1, h2, h3, h4, h5, h6, p, blockquote, pre,
+a, abbr, acronym, address, code,
+del, dfn, em, img, q, dl, dt, dd, ol, ul, li,
+fieldset, form, label, legend,
+table, caption, tbody, tfoot, thead, tr, th, td,
+article, aside, dialog, figure, footer, header,
+hgroup, nav, section {
+	margin: 0;
+	padding: 0;
+	border: 0;
+	font-weight: inherit;
+	font-style: inherit;
+	font-size: 100%;
+	font-family: inherit;
+	vertical-align: baseline;
+}
+
+article, aside, dialog, figure, footer, header,
+hgroup, nav, section {
+	display:block;
+}
+
+body {
+	line-height: 1.5;
+	background: white;
+}
+
+table {
+	border-collapse: separate;
+	border-spacing: 0;
+}
+
+caption, th, td {
+	text-align: left;
+	font-weight: normal;
+	float:none !important;
+}
+table, th, td {
+	vertical-align: middle;
+}
+
+blockquote:before, blockquote:after, q:before, q:after { content: ''; }
+blockquote, q { quotes: "" ""; }
+
+a img { border: none; }
+
+/*:focus { outline: 0; }*/
+
+
+

clojurebreaker/project.clj

@@ -0,0 +1,25 @@
+;; this file contains the intermediate steps in building the
+;; Clojurebreaker game. See the clojurebreaker/src directory for the
+;; completed code.
+
+; START:exact-matches-shell
+(defn exact-matches
+  "Given two collections, return the number of positions where
+   the collections contain equal items."
+  [c1 c2])
+; END:exact-matches-shell
+
+; START:integers-closed
+(defspec closed-under-addition
+  +'
+  [^long a ^long b]
+  (assert (integer? %)))
+; END:integers-closed
+
+; START:incorrect-spec
+(defspec incorrect-spec
+  +'
+  [^long a ^long b]
+  (assert (< a %))
+  (assert (< b %)))
+; END:incorrect-spec

clojurebreaker/resources/public/css/reset.css

@@ -0,0 +1,70 @@
+(ns clojurebreaker.game
+  (:use clojure.pprint)
+  (:require [clojure.data :as data]
+            [clojure.math.combinatorics :as comb]
+            [clojure.java.io :as io]))
+
+;; START:exact-matches
+(defn exact-matches
+  "Given two collections, return the number of positions where
+   the collections contain equal items."
+  [c1 c2]
+  (let [[_ _ matches] (data/diff c1 c2)]
+    (count (remove nil? matches))))
+;; END:exact-matches
+
+;; START:unordered-matches
+(defn unordered-matches
+  "Given two collections, return a map where each key is an item
+   in both collections, and each value is the number of times the
+   value occurs in the collection with fewest occurrences."
+  [c1 c2]
+  (let [f1 (select-keys (frequencies c1) c2)
+        f2 (select-keys (frequencies c2) c1)]
+    (merge-with min f1 f2)))
+;; END:unordered-matches
+
+;; START:score
+(defn score
+  [c1 c2]
+  (let [exact (exact-matches c1 c2)
+        unordered (apply + (vals (unordered-matches c1 c2)))]
+    {:exact exact :unordered (- unordered exact)}))
+;; END: score
+
+;; START: generate-turn-inputs
+(defn generate-turn-inputs
+  "Generate all possible turn inputs for a clojurebreaker game
+   with colors and n columns"
+  [colors n]
+  (-> (comb/selections colors n)
+      (comb/selections 2)))
+;; END: generate-turn-inputs
+
+;; START: score-inputs
+(defn score-inputs
+  "Given a sequence of turn inputs, return a lazy sequence of
+   maps with :secret, :guess, and :score."
+  [inputs]
+  (map
+   (fn [[secret guess]]
+     {:secret (seq secret)
+      :guess (seq guess)
+      :score (score secret guess)})
+   inputs))
+;; END: score-inputs
+
+(->> (generate-turn-inputs [:r :g :b] 2)
+ (score-inputs))
+
+;; step 17 score-table
+#_(score-all-games [:R :G :B] 3)
+
+;; step 18 could check either the clj or the tabular form of score-all-games
+;; into source control and use it as a regression test
+;; (add clojure.java.io)
+(use 'clojure.pprint)
+(with-open [w (io/writer "scoring-table")]
+    (binding [*out* w]
+      (print-table (->> (generate-turn-inputs [:r :g :b :y] 4)
+                        (score-inputs)))))