branneman

(ns main (:gen-class))

;; Snake :: [[int int]…]
;;  vector of x,y tuples
;;  head is first, tail is last

;; out-of-bounds? :: (int int int) -> bool
;;  grid-size is 1-indexed, x+y are 0-indexed
(defn out-of-bounds? [grid-size x y]
  (or (neg? x) (neg? y) (>= x grid-size) (>= y grid-size)))

branneman

List of all Clojure Predicate functions

A predicate function returns a boolean true or false, and it's name ends with a ?. Ran against Clojure 1.10.0.

({:ns clojure.string,
  :predicates
  ({:fn ends-with?, :arglists ([s substr])}
   {:fn starts-with?, :arglists ([s substr])}
   {:fn includes?, :arglists ([s substr])}

branneman

const wrapPromise = fn => (...args) =>
  new Promise(resolve => setTimeout(
    () => resolve(fn(...args)),
    Math.floor(Math.random() * 1500) + 250)
  )
const upper = wrapPromise(str => str.toUpperCase())
const underline = str => `__${str}__`
const exclamate = wrapPromise(str => str + '!')

// Util: Create promise chain

branneman

//
// Tight coupling from A to B  => A needs B to be defined, callable and adhere to an interface
// No coupling from B to A     => B does not need A in any way (pure fn)
//
function a() { b() }
function b() {}
a()

//
// No coupling from A to B         => A and B work independently,

branneman

Run Debian as docker container

Setup

Start a container in detached mode:

docker run -dit --name deb -e "LANG=C.UTF-8" -w "/root" debian:latest bash

Connect to it and do initial setup:

branneman

const { curryN, curry } = require('./curry') // https://gist.github.com/branneman/4ffb7ec3fc4a2091849ba5d56742960c

// Array higher-order
const map = curry((fn, list) => list.map(fn))
const filter = curry((fn, list) => list.filter(fn))
const foldl = curry((fn, init, list) => list.reduce(fn, init))
const foldr = curry((fn, init, list) => list.reduceRight(fn, init))
const find = curry((fn, list) => list.find(fn))
const sort = curry((fn, list) => list.slice().sort(fn))
const includes = curry((fn, list) => list.includes(fn))

branneman

'use strict'

const curryN = (() => {
  const isPlaceholder = x => x['@@functional/placeholder'] === true
  const filterPlaceholders = xs => xs.filter(x => isPlaceholder(x))
  const filterValues = xs => xs.filter(x => !isPlaceholder(x))

  return (arity, fn, accIn = []) => (...args) => {
    const accOut = accIn.slice()

branneman

export {
  isNull,
  isUndef,
  isBool,
  isNum,
  isInt,
  isStr,
  isArr,
  isObj,
  isFunc,

branneman

/**
 * Turing Machine Interpreter
 *
 * Features:
 *  - Infinite tape, both ways
 *  - Uses JS values, anything that matches ==, is a valid symbol
 *
 * Definition:
 *  - States (Q): { integer, halt }
 *  - Input symbols read/write (Σ): any integer or string

branneman

Hogget: Philosophy

Elevator pitch

• Functional programming language
• Strong typed
• Dense syntax, everything is an expression
• Compiles to JavaScript

The Name

A Hogget is a sheep between one and two years of age. Inspired by Ramda, we also like sheep.