miner

;; http://rosettacode.org/wiki/Four_bit_adder

(ns miner.fourbit)

;; a bit is represented as a boolean (true/false)
;; a word is a big-endian vector of bits [true false true true] = 11

;; maybe little endian is more convenient???

(defn bvec

miner

(ns sudoku
  (:refer-clojure :exclude [==])
  (:use clojure.core.logic))

(defn get-square [rows x y]
  (for [x (range x (+ x 3))
        y (range y (+ y 3))]
    (get-in rows [x y])))

(defn init [vars hints]

miner

(ns miner.roman
  (:require [clojure.test :refer :all]))

;; inspired by 
;; http://www.jayway.com/2012/08/04/a-decimal-to-roman-numeral-converter-in-just-a-few-lines/

(def roman-map {1000 "M" 900 "CM" 500 "D" 400 "CD"
                100 "C" 90 "XC" 50 "L" 40 "XL"
                10 "X" 9 "IX" 5 "V" 4 "IV" 1 "I"})

miner

;; inspired by https://twitter.com/puredanger/status/241282082268143619

;; reduce-kv is faster than destructuring with maps
;; use (get m k) instead of (k m) to be safe with non-keyword keys

(defn sub=
  "Like = for most things, but maps compare recursively by only the keys in a, so it returns true
if a is a 'submap' of b."
  [a b]
  (if (and (map? a) (map? b))

miner

(ns miner.infix)

;; Inspired by the excellent book "The Joy of Clojure".
;; http://fogus.me/fun/unfix/infix-src.html
;; 
;; Converted to be used as a data-reader by Steve Miner.  The main change is to preserve
;; the prefix forms rather than calculating the result.  Also, the reader gets symbols, not
;; the actual functions.

(def && #(and % %2))

miner

;;; 01/14/14  16:18 by miner -- Steve Miner revised this code to be more idiomatic Clojure.
;;;

; Short sidebar: Clojure has a special form for the efficient compilation of tail recursion.
; Something like this would work as a factorial function:
(defn fact2 [n]
  (loop [n n acc 1]
    (if (zero? n) acc (recur (dec n) (* n acc)))))

; We're not going to discuss `recur` any further as we're imagining a language that doesn't

miner

;; I posted an earlier version on my blog:
;; http://fnclojure.wordpress.com/2012/08/06/roman-numerals-in-clojure/

;; This version is faster and more readable.

(defn range-down
  "Returns a seq of integers from HIGH (exclusive) down to LOW (inclusive).
   LOW defaults to 0. STEP is a positve decrement, defaults to 1.  Like
   `(reverse (range low high step))' but a bit faster."
  ([high] (range (dec high) -1 -1))

miner

(ns miner.lucky
  (:require [clojure.data.avl :as avl]))
     
;; http://en.wikipedia.org/wiki/Lucky_number

(defn lucky-avl
  ([max] (lucky-avl 1 (apply avl/sorted-set (range 1 max 2))))
  ([i avl]
   (let [n (nth avl i nil)]
     (if (and n (<= n (count avl)))

miner

Keybase proof

I hereby claim:

• I am miner on github.
• I am miner (https://keybase.io/miner) on keybase.
• I have a public key whose fingerprint is DB15 4E49 B5BD BE5A 10B4 4437 6A9B 8B0A 4D6A 8900

To claim this, I am signing this object:

miner

(ns miner.dijkstra-primes)

;; ----------------------------------------------------------------------
;; http://heinrichhartmann.com/2016/04/03/Dijkstra's-Prime-Number-Algorithm.html
;; https://github.com/HeinrichHartmann/DijkstraPrimes/blob/master/Primes.lua

;; Converted to Clojure by SEM.  Note that there are lots of shadowing and recursive calls in
;; the Clojure code to avoid the mutation in the original code.  The Clojure loops are a bit
;; ugly.  Not sure if this is the best way to do things.  However, the performance is pretty
;; good.