swr1bm86

• defprotocol: defines an interface
• deftype: create a bare-bones object which implements a protocol
• defrecord: creates an immutable persistent map which implements a protocol

Typically you'll use defrecord (or even a basic map);
unless you need some specific Java inter-op,
where by you'll want to use deftype instead.

Note: defprotocol allows you to add new abstractions in a clean way Rather than (like OOP) having polymorphism on the class itself,

swr1bm86

PROGRAM := llvm-brainfuck
OBJECTS := main.o
 
CXX := clang++
CXXFLAGS := $(shell llvm-config --cppflags) -Wall -Werror -pedantic
LDFLAGS := $(shell llvm-config --ldflags --libs core)
 
all: $(PROGRAM) $(SHIM)
 
$(PROGRAM): $(OBJECTS)

swr1bm86

(ns my.app
  (:require
   [aleph.http               :refer :all]
   [compojure.core           :refer [defroutes GET]]
   [compojure.handler        :as handler]
   [lamina.core              :refer :all]
   [com.netflix.hystrix.core :as hystrix]
   [clj-http.client          :as client]))

(defn get-pants []

swr1bm86

import Control.Applicative ((<$>))

center :: String -> Int -> String
center s n = spaces ++ s ++ spaces
  where spaces = replicate ((n - length s) `div` 2) ' '

-- http://www.haskell.org/haskellwiki/Blow_your_mind, Ctrl-F "pascal"
pascal :: [[Int]]
pascal = iterate (\row -> zipWith (+) ([0] ++ row) (row ++ [0])) [1]

swr1bm86

sumPairs :: [Integer] -> [Integer]
sumPairs (x:y:s) = (x + y) : sumPairs (y:s)
sumPairs _       = []

pascal :: Integer -> [Integer]
pascal 0 = [1]
pascal n = sumPairs $ [0] ++ (pascal $ n - 1) ++ [0]

sierpinski :: Integer -> String
sierpinski n = concat $ map (ascii . odd) $ pascal n

swr1bm86

{-# LANGUAGE GeneralizedNewtypeDeriving #-}

module Language.Brainfuck.Parser
       (parse)
       where

import Control.Monad.Except
import Control.Monad.State

data ParseError = Unexpected Char

swr1bm86

There's a couple of ways, one way is

• Get search results
  • Do SPC / and type in your search string
  • or SPC x S and search string - where x is your scope indicator (p for project, d for directory, etc..)
• Once you have the occurences you want, hit C-c C-e inside the helm buffer to put all your match occurences and puts them into a special buffer called the edit buffer or something like that
• in that buffer you can use any commands you'd normally use on a buffer
• the C-c C-c to commit your changes.

swr1bm86

/*
 * Minimal C++ implementation of Functor, Monad and Maybe.
 *
 * Requires c++0x variadic templates and lambda expressions:
 * 
 *      g++ -std=c++0x main.cpp -o main
 *
 * fmap, monadic bind and return implementations for std::vector
 * and Maybe.
 *

swr1bm86

# maybe.py - a Pythonic implementation of the Maybe monad
# Copyright (C) 2014. Senko Rasic <senko.rasic@goodcode.io>
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#

swr1bm86

(* ocamlfind ocamlopt -o exmpl -package curl -linkpkg exmpl.ml *)
open Printf

let _ = Curl.global_init Curl.CURLINIT_GLOBALALL

(*
 *************************************************************************
 ** Aux. functions
 *************************************************************************
 *)