amoilanen

#Downloads all the mp3 episode recordings from JavaScript Jabber http://javascriptjabber.com
#Assumes that the system 'wget' command is available which is the case on Linux
#Episodes will be downloaded to /home/user/JSJabber
require 'net/http'

def get(uri)
  response = Net::HTTP.get_response(URI.parse(uri))
  if response.code == "301"
    response = Net::HTTP.get_response(URI.parse(response.header['location']))
  end

amoilanen

require 'rubygems'
require 'couchrest'
require 'couchrest_model'
require 'json'
 
server = CouchRest.new

class JobOpening < CouchRest::Model::Base
  use_database "job_openings"

amoilanen

function functionName(func) {
  var match = func.toString().match(/function\s+([^(?:\()\s]*)/);
  return match ? match[1] : "";
}

/*
 * Tests
 */

var func1 = function(x, y) {

amoilanen

if (!Function.prototype.asMethod) {
  Function.prototype.asMethod = function() {
    var self = this;

    return function(first) {
      var rest = [].slice.call(arguments, 1);

      return self.apply(first, rest);
    }
  };

amoilanen

from selenium import webdriver

driver = webdriver.Firefox()
driver.get("http://www.google.com")
driver.quit()

amoilanen

/*
 * Simplistic map-reduce like API in JavaScript.
 *
 * No support for scalability or distributed computations, just an illustration of the computational model.
 */
(function(host) {

  function MapReduce(inputs, mapper, reducer) {
    this.inputs = inputs;
    this.mapper = mapper;

amoilanen

/*
 * Computing the Levenstein distance between strings.
 * http://en.wikipedia.org/wiki/Levenshtein_distance
 */

/*
 * Inefficient recursive algorithm.
 */
function stringDistance(str1, length1, str2, length2) {

amoilanen

function merge() {
  var sources = [].slice.call(arguments);

  return sources.reduce(function(previous, source) {
    Object.keys(source).forEach(function(propertyName) {
      previous[propertyName] = source[propertyName];
    });
    return previous;
  }, {});
}

amoilanen

var help = [
  'Command line tool to unuglify a JavaScript file.',
  '',
  'Before using install js-beautify:',
  '',
  'npm install js-beautify',
  '',
  'To unuglify file code.js run:',
  '',
  'node unuglify code.js > code.unuglified.js'

amoilanen

function generate(elements, len) {
  if (len == 1) {
    return elements.map(function(element) {
      return [element];
    });
  }
  var generated = [];
  var subsequences = generate(elements, len - 1);

  subsequences.forEach(function(subsequence) {