Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

done except encore #530

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions .travis.yml
Original file line number Diff line number Diff line change
@@ -1,6 +1,6 @@
language: clojure
lein: lein2
script: lein2 midje :config .midje-grading-config.clj
lein: lein
script: lein midje :config .midje-grading-config.clj
jdk:
- openjdk7
notifications:
Expand Down
58 changes: 40 additions & 18 deletions src/one_function_to_rule_them_all.clj
Original file line number Diff line number Diff line change
@@ -1,43 +1,65 @@
(ns one-function-to-rule-them-all)

(defn concat-elements [a-seq]
:-)
(reduce concat () a-seq))

(defn str-cat [a-seq]
:-)
(if (empty? a-seq)
""
(reduce (fn [str1 str2] (str str1 " " str2)) a-seq)))

(defn my-interpose [x a-seq]
[:-])
(if (empty? a-seq)
[]
(reduce (fn [vec elem] (conj vec x elem)) [(first a-seq)] (rest a-seq))))

(defn my-count [a-seq]
:-)
(reduce (fn [count _] (inc count)) 0 a-seq))

(defn my-reverse [a-seq]
[:-])
(reduce conj () a-seq))

(defn min-max-element [a-seq]
[:-])
(let [first (first a-seq)
min-max (fn [[mini maxi] x] [(min mini x) (max maxi x)])]
(reduce min-max [first first] (rest a-seq))))

(defn insert [sorted-seq n]
[:-])
(loop [result []
remaining sorted-seq]
(cond
(empty? remaining) (concat result [n])
(< n (first remaining)) (concat result (cons n remaining))
:else (recur (conj result (first remaining)) (rest remaining)))))

(defn insertion-sort [a-seq]
[:-])
(reduce insert [] a-seq))

(defn parity [a-seq]
[:-])
(let [toggle (fn [a-set elem]
(if (contains? a-set elem)
(disj a-set elem)
(conj a-set elem)))]
(reduce toggle #{} a-seq)))

(defn minus [x]
:-)
(defn minus
([x] (- x))
([x y] (- x y)))

(defn count-params [x]
:-)
(defn count-params [& args]
(count args))

(defn my-* [x]
:-)
(defn my-*
([] 1)
([x] x)
([x y] (* x y))
([x y & more] (reduce * (* x y) more)))

(defn pred-and [x]
(fn [x] :-))
(defn pred-and
([] (fn [_] true))
([p?] p?)
([p1? p2?] (fn [x] (and (p1? x) (p2? x))))
([p1? p2? & more] (reduce pred-and (pred-and p1? p2?) more)))

(defn my-map [f a-seq]
[:-])
)