jesslilly

var Expander = (function(){
  var Expander = function(id) {
    this._id = id;
    this._elem = elem = document.getElementById(id);
    this._step = 0;
    this._height = 0;
  };
  Expander.prototype.expand = function(incr,to) {
    var self = this;
    var animate = (incr>0 && this._height<to)

jesslilly

var expect = function(value1) {
  return {
    toBe: function(value2) {
      document.getElementById('test').innerHTML += 
        "<pre>"
      + ((JSON.stringify(value1) === JSON.stringify(value2)) ? "Pass " : "Fail ")
      + "(val1: " + JSON.stringify(value1)
      + " val2: " + JSON.stringify(value2)
      + ")</pre><br\>";
    }

jesslilly

using System;
					
public class Program
{
	public static void Main()
	{
		Console.WriteLine(wordRepeater("Hi! ",10));
		Console.WriteLine(wordRepeater2("Hello! ",10));
	}
	public static String wordRepeater(String name, int n) {

jesslilly

// See http://blog.bdoughan.com/2011/06/using-jaxbs-xmlaccessortype-to.html
@XmlAccessorType(XmlAccessType.PUBLIC_MEMBER)
@XmlRootElement
public class Cake implements PlainTextBean {
	private String type;

	// The getter is up here since the order of fields affects the order in the
	// xml.
	public String getType() {
		return type;

jesslilly

#!/usr/bin/env groovy

// GROOVY STYLE!!!!!!!!!!!!!!!!

def a = new ArrayList<String>()
a.add("Hello")
a.add("my")
a.add("name")
a.add("is")
a.add("Jess")

jesslilly

#!/usr/bin/env node

/*
 * Design a stack with a push, pop, and min method.
 * Min returns the smallest element.
 * All methods must operate in O(1) time.
 * I implemented this with simple numbers, but I could enhance it 
 * to use objects with a comparator function.
 */

jesslilly

#!/usr/bin/env node
var util = require("util");
util.puts("Search Array for value N.");
// This only took me 12 minutes to do on a white board.
// This has a complexity of O(log n).

//        0  1  2  3  4  5  6  7  8   9   10  11
var a = [ 1, 2, 3, 4, 5, 6, 7, 8, 10, 12, 14, 16 ];

var _indexOf = function(pos1, pos2, n) {

jesslilly

#!/usr/bin/env node

/*=========================================================
Break up a string of words with no spaces into a string of words with appropriate spaces.
=========================================================*/

var dictionary = {
	'the' : 0,
	'a' : 0,
	'may' : 0,

jesslilly

#!/usr/bin/env node
var util = require('util');
util.puts("Convert tree to query!");
var tree = {
	type : "and",
	left : {
		type : "eq",
		left : {
			type : "property",
			name : "City"

jesslilly

#!/usr/bin/env node

var a = require( "./tree" );

/*
 *  1A
 *  2A      2B        2C
 *  3A 3B             3C
 *                    4A 4B 4C
 *                          5A