Risto-Stevcev

var app = angular.module('app', []);
app.controller('TodoCtrl', function($scope) {
    $scope.foo = true;
    $scope.bar = false;
    $scope.baz = true;
    $scope.baa = true;
    
    $scope.checkboxes = {
        'foo': $scope.foo,
        'bar': $scope.bar,

Risto-Stevcev

import java.io.BufferedReader;
import java.io.StringReader;
import java.util.HashMap;

public class CSVMapper {
    public String transformCsv (String csvFile) {
        return csvMapToString(getCsvMap(csvFile));
    }

    private HashMap<String, Integer[]> getCsvMap (String csvFile) {

Risto-Stevcev

<span class="foo">bar</span>

Risto-Stevcev

module.exports = function(grunt) {
  grunt.initConfig({
    foo: {
      bar: {
       options: {}
      }
    }
  })
  
  grunt.loadTasks('tasks')

Risto-Stevcev

;;;; Partial Tail Call Optimization in Clojure
;; See this for why no full implicit TCO: https://groups.google.com/forum/#!msg/clojure/4bSdsbperNE/tXdcmbiv4g0J

; Naive non-optimized tail-recursive factorial function
(defn naive-factorial
  ([n] (naive-factorial n 1))
  ([n acc]
    (if (zero? n)
        acc
        (naive-factorial (- n 1) (* acc n)))))

Risto-Stevcev

(defn callfn [f & args]
  (apply f args))

(callfn + 1 2 3 4)
; returns 10

Risto-Stevcev

mkfifo mypipe; nc -l 8089 < mypipe | tee inflow | nc www.google.com 80 | tee outflow > mypipe; rm mypipe

Risto-Stevcev

-- In GHCi
:set +m
let x y = x y
-- ex: x 2 will loop infinitely

:{
  let {
    z y = y
      where
        t = x 2

Risto-Stevcev

var items = ['Cheese, blue', 'Cheese, cheshire', 'Avocadoes, raw'];

$('.food-input').keyup(function(event) {
  if (event.key.match(/^[a-zA-Z0-9, -]{1}$/g)) {
    var inputVal = event.target.value;
    var match = items.filter(function(item) {
      return item.match(new RegExp('^'+ inputVal +'.*', 'g'));
    });
    if (match.length > 0) {
      event.target.value = match[0];

Risto-Stevcev

// Just made it as an exercise for point-free ramda
> const R = require('ramda')
> const pfRng = R.compose(R.partial(R.times(R.compose(Math.floor, R.converge(R.multiply, [R.identity, Math.random])))), R.of)
> pfRng(20)()
[ 0, 0, 1, 1, 0, 2, 2, 2, 6, 2, 6, 10, 9, 6, 13, 6, 2, 5, 14, 6 ]