graue

-- traditional fixed-point operator from functional programming
Y = function (f)
    return (function (x)
            return x(x)
            end)(function (x)
                 return f(function (v)
                          return (x(x))(v)
                          end)
                 end)
    end

graue

// from this

type SavedPlaylistItem = {
  id: string,
  checksum: number,
};

// generate this

function getSavedPlaylistItem(payload: Object): ?SavedPlaylistItem {

graue

@-moz-document url-prefix(https://news.ycombinator.com) {
    .comment {
        font-family: Alegreya, serif !important;
        font-size: 15pt !important;
    }

    .comment code {
        font-family: Inconsolata-g, fixed !important;
        font-size: 10pt !important;
    }

graue

(defn val-map
  "Map f over hashmap m's values. Should be in the dang core."
  [f m]
  (into {} (for [[k v] m] [k (f v)])))

graue

(ns vectors
  (:require [clojure.test :refer [deftest is run-tests]]))

(defprotocol VectorMath2D
  (-vplus [v1 v2] "Adds two vectors"))

(defrecord Vec2D [x y]
  VectorMath2D
    (-vplus [v1 v2]
      (Vec2D. (+ (:x v1)

graue

(defn divides [m n]
  (= 0
     (mod n m)))

(defn my-and [x y]
  (and x y))

(defn all? [pred xs]
  (reduce my-and true
    (map pred xs)))

graue

Exception in thread "main" java.lang.IllegalArgumentException: Don't know how to create ISeq from: ring_intro.core$wrap_uri_check$fn__205, compiling:(core.clj:27:3)
	at clojure.lang.Compiler$InvokeExpr.eval(Compiler.java:3463)
	at clojure.lang.Compiler$DefExpr.eval(Compiler.java:408)
	at clojure.lang.Compiler.eval(Compiler.java:6624)
	at clojure.lang.Compiler.load(Compiler.java:7064)
	at clojure.lang.RT.loadResourceScript(RT.java:370)
	at clojure.lang.RT.loadResourceScript(RT.java:361)
	at clojure.lang.RT.load(RT.java:440)
	at clojure.lang.RT.load(RT.java:411)
	at clojure.core$load$fn__5028.invoke(core.clj:5530)

graue

fn main() {
    let s = [1, 2, 3, 4].map(|&x| (x * x).to_str());
    for s.each |&item| {
        io::println(item);
    }
}

graue

mergeSort :: Ord a => [a] -> [a]
mergeSort []  = []
mergeSort [x] = [x]
mergeSort xs  = combineSortedLists
                  (mergeSort firstHalf)
                  (mergeSort secondHalf)
                where (firstHalf, secondHalf) = splitInHalf xs

splitInHalf :: [a] -> ([a], [a])
splitInHalf xs = splitAt halfLength xs

graue

@-moz-document url-prefix(https://news.ycombinator.com) {
    .comment {
        font-family: Alegreya, serif !important;
        font-size: 15pt !important;
    }

    .comment code {
        font-family: Inconsolata-g, fixed !important;
        font-size: 10pt !important;
    }