Skip to content

Instantly share code, notes, and snippets.

View actsasbuffoon's full-sized avatar

Michael Tomer actsasbuffoon

  • Corista
  • Boston, MA
View GitHub Profile
@actsasbuffoon
actsasbuffoon / simple_neural_net.rb
Last active May 4, 2016 16:19
A simple neural network example.
class Neuron
attr_accessor :inputs, :threshold, :weights
def initialize(threshold, weights)
@threshold = threshold
@weights = weights
@inputs = []
end
def output
swagger: "2.0"
info:
description: Simple example
version: "1.0.0"
title: Example
license:
name: Apache 2.0
url: http://www.apache.org/licenses/LICENSE-2.0.html
host: 127.0.0.1:8080
schemes:
@actsasbuffoon
actsasbuffoon / lang.hs
Last active August 29, 2015 14:12
The beginnings of a simple imperative language in Haskell
{-# LANGUAGE ViewPatterns #-}
{-# OPTIONS_GHC -Wall #-}
module Main where
-- This is a simple dynamically typed imperative language with mutable state. It's somewhat similar to JavaScript, but
-- it differs in many ways. There are a few notable oddities to the language that I'm still working out. For instance,
-- we don't have reference types. In most languages you would write something like this:
--
-- foo = new Person("Mike")
@actsasbuffoon
actsasbuffoon / fun_with_javascript.js
Last active December 27, 2015 12:09
We've replaced Michael's JavaScript interpreter with Cthulhu. Let's see if he can tell the difference!
// Let's have some fun with JavaScript.
{} + 0
// => 0
// That's a little strange, but okay. Surely nothing would change if I wrapped
// the whole thing in parens, right?
({} + 0)
// => "[object Object]0"
@actsasbuffoon
actsasbuffoon / pathfinder.rb
Created December 20, 2012 12:23
Ruby implementation of Dijkstra's algorithm. http://en.wikipedia.org/wiki/Dijkstra's_algorithm
map = <<-EOS
. . . . . . . . . . . . . . . .
. . . . . . . . . . . . . . . .
. . . . . . . X X X X X X X . .
. . . . . . . X . . . . . X . .
. . . . . . . X . . . . . . . .
. . . . . . . X . . . . . X . .
. . . . . . . X . . S . . X . .
. . . . . . . X . . . . . X . .
. . . . . . . X X X X X X X . .
@actsasbuffoon
actsasbuffoon / maze.rb
Created December 20, 2012 12:17
A recursive backtracking maze generator made with Ruby-Processing. gem install ruby-processing rp5 run maze.rb
require 'rubygems'
class Array
def random
self[rand length]
end
end
class Hash
def random
@actsasbuffoon
actsasbuffoon / calculate_change.clj
Created August 26, 2012 00:17
My first attempt at Clojure. Suggestions/criticism welcome.
(defn calculate-change
([paid cost] (make-change paid cost 0))
([paid cost denomination-index]
(let
[
currency-values [
[:hundreds 10000]
[:fifties 5000]
[:twenties 2000]
[:tens 1000]
@actsasbuffoon
actsasbuffoon / example.scala
Created June 24, 2012 23:38
Setting up a table definition
TableDefinition.register("SetSummaries", Map(
"SetID" -> java.lang.Integer,
"UserID" -> java.lang.Integer,
"ProgramNumber" -> java.lang.Integer,
"ProgramID" -> java.lang.Integer,
"SessionNumber" -> java.lang.Integer,
"SetNumber" -> java.lang.Integer,
"ExerciseID" -> java.lang.Integer,
"Skipped" -> java.lang.Boolean,
"PaceScore" -> java.lang.Integer,
@actsasbuffoon
actsasbuffoon / table_definition.scala
Created June 24, 2012 23:08
Trying to create a collection of classes. Not going too well.
class TableDefinition(val name: String, val columns: Map[String, Class]) {
}
object TableDefinition {
val table_definitions = collection.mutable.Map[String, TableDefinition]()
def register(name: String, attributes: Map[String, Class]) {
TableDefinition.register(new TableDefinition(name, attributes) )
}
@actsasbuffoon
actsasbuffoon / pivotal_cards.rb
Created November 14, 2011 15:49
A script to generate cards for Pivotal stories
#!/usr/bin/env ruby
# Script to generate PDF cards suitable for planning poker
# from Pivotal Tracker [http://www.pivotaltracker.com/] CSV export.
# Inspired by Bryan Helmkamp's http://github.com/brynary/features2cards/
# Example output: http://img.skitch.com/20100522-d1kkhfu6yub7gpye97ikfuubi2.png
require 'rubygems'