steida

/*
*   Sugar for type detection working across frames and browsers ;)
*
*   Detected types
*
*       'arguments', 'array', 'boolean', 'date', 'document', 'element', 'error', 'fragment', 
*       'function', 'nodelist', 'null', 'number', 'object', 'regexp', 'string', 'textnode', 
*       'undefined', 'window'
*
*   Copyright (c) 2009 Daniel Steigerwald (http://daniel.steigerwald.cz), Mit Style License

MrJaba

import scala.io.Source;
import scala.collection.mutable;

class Anagrams(file:String){
	
	private val combinations = mutable.Map.empty[String, List[String]];
	
	def run() : List[List[String]] = {
		for( word <- Source.fromFile(file).getLines ){
			val characterStr = sortByChars(word.trim);

chitchcock

Stevey's Google Platforms Rant

I was at Amazon for about six and a half years, and now I've been at Google for that long. One thing that struck me immediately about the two companies -- an impression that has been reinforced almost daily -- is that Amazon does everything wrong, and Google does everything right. Sure, it's a sweeping generalization, but a surprisingly accurate one. It's pretty crazy. There are probably a hundred or even two hundred different ways you can compare the two companies, and Google is superior in all but three of them, if I recall correctly. I actually did a spreadsheet at one point but Legal wouldn't let me show it to anyone, even though recruiting loved it.

I mean, just to give you a very brief taste: Amazon's recruiting process is fundamentally flawed by having teams hire for themselves, so their hiring bar is incredibly inconsistent across teams, despite various efforts they've made to level it out. And their operations are a mess; they don't real

Gunio

import requests
import lxml
from lxml import html

r = requests.get('http://gun.io')
tree = lxml.html.fromstring(r.content)
elements = tree.get_element_by_id('frontsubtext')
for el in elements:
    print el.text_content()

tonious

/* Read this comment first: https://gist.github.com/tonious/1377667#gistcomment-2277101
 * 2017-12-05
 * 
 *  -- T.
 */

#define _XOPEN_SOURCE 500 /* Enable certain library functions (strdup) on linux.  See feature_test_macros(7) */

#include <stdlib.h>
#include <stdio.h>

nmandery

/*
http://stackoverflow.com/questions/1371460/state-machines-tutorials/1371654#1371654

State machines are very simple in C if you use function pointers.

Basically you need 2 arrays - one for state function pointers and one for state 
transition rules. Every state function returns the code, you lookup state 
transition table by state and return code to find the next state and then 
just execute it.
*/

danprager

old_roman = (('M', 1000),
             ('D', 500),
             ('C', 100),
             ('L', 50),
             ('X', 10),
             ('V', 5),
             ('I', 1))

new_roman = (('M', 1000),
             ('CM', 900),

xorpaul

import sys

class HashTable:
  def __init__(self):
    self.fill = 8 # Active + # Dummy
    self.list = [0] * self.fill
    self.used = 0 # Active
  def __getitem__(self, slot):
    return self.list[slot]
  def insert(self, slot, key):

int3

#include <stdlib.h>
#include <stdio.h>
#include <stdbool.h>
#include <string.h>
#include <assert.h>

// no actual pointer should have this value, due to alignment
static void* DELETED = (void*)1;

static int TABLE_SIZE = 701;

joewalnes

#!/usr/bin/env python
 
"""A tiny script that polls your location on Google Latitude, and updates
the color of a Blink1 LED. http://shop.thingm.com/blink1/
 
Red = At work
Blue = At home
Green = On my way
 
Should work on Windows, OS-X and Linux. Requires Python 2.7 or later.