kputnam

#!/usr/bin/env ruby
require "pp"
require "benchmark/ips"
require "memory_profiler"

GC.disable

def mem(label, &block)
  result = MemoryProfiler::Reporter.report(&block)
  print label.ljust(30); pp result.allocated_memory_by_class

kputnam

#!/bin/sh

# make sure we aren't running already
what=`basename $0`
for p in `ps h -o pid -C $what`; do
  if [ $p != $$ ]; then
    exit 0
  fi
done

kputnam

#!/bin/sh

# either pass a single URL or --input-file=one-url-per-line.txt

wget \
  --tries=5 \
  --server-response \
  --save-headers \
  --default-page=index.html \
  --adjust-extension \

kputnam

-- Covariate functor
class Fun f where
  fun :: (a -> b) -> f a -> f b

-- Contravariate functor
class Con f where
  con :: (b -> a) -> f a -> f b

-- Function parameterized over input type 'i'

kputnam

Notes on Ruby's method refinement

The example below creates a refinement module which adds a method to instances of Integer. In the Test class, we bring it into scope by declaring using Refinements. Next, we create an instance method using def_delegators named Test#xxx that calls @k.xxx, which should resolve to the refinement method we added to Integer. Finally, we "manually" create essentially the same method, this time named yyy, but we define it "manually" without using def_delegators.

require "forwardable"

module Refinements
  refine Integer do
 def xxx

kputnam

Machine Learning

TensorFlow tutorial

MLconf

• MLconf SFO 2015
• MLconf ATL 2015
• MLconf SEA 2015
• MLconf NYC 2015

kputnam

#!/usr/bin/perl
use URI::Escape;

my $url = 'http://careers.stackoverflow.com/jobs/feed?searchTerm=';

# Either use search terms given as command-line arguments, or use default terms
my $q   = join('+', map { uri_escape($_); } (@ARGV > 0) ?
                @ARGV : ('-.net', '-css', '-c#', '-android', '-php', '-ios', '-vb.net', '-excel' ));

# Read XML from child process

kputnam

(function() {
  var otherLib = (typeof($) == 'function');

  if (typeof(jQuery) != 'undefined') {
    alert('jQuery already defined');
    return;
  }

  function getScript(url, callback) {
    var script = document.createElement('script');

kputnam

import Data.Ord
import Data.List
import Test.QuickCheck

-- | Quantify how "unsorted" a given list of elements is, by computing
--   at each position in the list: how many later elements are smaller?
--
--     e.g. cost "abc"   == 0
--          cost "acb"   == 1
--          cost "cba"   == 2

kputnam

{-# LANGUAGE ScopedTypeVariables #-}

module KMeans
  ( euclidean
  , kMeans
  , kMeansPar
  , chunk
  , random
  ) where