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

submission #533

Open
wants to merge 1 commit 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
59 changes: 40 additions & 19 deletions src/one_function_to_rule_them_all.clj
Original file line number Diff line number Diff line change
@@ -1,43 +1,64 @@
(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 [x y] (str x " " y)) a-seq)))

(defn my-interpose [x a-seq]
[:-])
(let [interposer (fn [coll elem] (if (empty? coll) [elem] (conj (conj coll x) elem)))]
(reduce interposer () a-seq)))

(defn my-count [a-seq]
:-)
(let [counter (fn [acc e] (inc acc))]
(reduce counter 0 a-seq)))

(defn my-reverse [a-seq]
[:-])
(let [reverser (fn [acc e] (cons e acc))]
(reduce reverser [] a-seq)))

(defn min-max-element [a-seq]
[:-])
(let [minmax (fn [[mn mx] elem] [(min elem mn) (max elem mx)])
f (first a-seq)]
(reduce minmax [f f] a-seq)))

(defn insert [sorted-seq n]
[:-])
(cond
(empty? sorted-seq) [n]
(< n (first sorted-seq)) (cons n sorted-seq)
:else (cons (first sorted-seq) (insert (rest sorted-seq) n))))

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

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

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

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

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

(defn pred-and [x]
(fn [x] :-))
(defn pred-and
([] (fn [x] true))
([p] p)
([p q & more] (let [reducer (fn [p q] (fn [x] (and (p x) (q x))))]
(reduce reducer (reducer p q) more))))

(defn my-map [f & seqs]
(if (empty? (first seqs))
[]
(let [f-on-seqs (fn [f seqs] (reduce (fn [acc elem] (conj acc (f elem))) [] seqs))]
(cons (apply f (f-on-seqs first seqs)) (apply my-map f (f-on-seqs rest seqs))))))

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