Arachnid

import bisect

class NFA(object):
  EPSILON = object()
  ANY = object()
  
  def __init__(self, start_state):
    self.transitions = {}
    self.final_states = set()
    self._start_state = start_state

steipete

- (UIImage *)pspdf_preloadedImage {
    CGImageRef image = self.CGImage;
    
    // make a bitmap context of a suitable size to draw to, forcing decode
    size_t width = CGImageGetWidth(image);
    size_t height = CGImageGetHeight(image);
    
    CGColorSpaceRef colourSpace = CGColorSpaceCreateDeviceRGB();
    CGContextRef imageContext =  CGBitmapContextCreate(NULL, width, height, 8, width*4, colourSpace,
                                                       kCGImageAlphaPremultipliedFirst | kCGBitmapByteOrder32Little);

lucasfais

Sublime Text 2 – Useful Shortcuts (Mac OS X)

General

⌘T	go to file
⌘⌃P	go to project
⌘R	go to methods
⌃G	go to line
⌘KB	toggle side bar
⌘⇧P	command prompt

ieure

function up ()
{
    if [ "$1" != "" -a "$2" != "" ]; then
        local DIR=$1
        local TARGET=$2
    elif [ "$1" ]; then
        local DIR=$PWD
        local TARGET=$1
    fi
    while [ ! -e $DIR/$TARGET -a $DIR != "/" ]; do

qrush

froots

if (typeof (AC) === "undefined") {
    AC = {}
}
AC.ImageReplacer = Class.create({
    _defaultOptions: {
        listenToSwapView: true,
        filenameRegex: /(.*)(\.[a-z]{3}($|#.*|\?.*))/i,
        filenameInsert: "_☃x",
        ignoreCheck: /(^http:\/\/movies\.apple\.com\/|\/105\/|\/global\/elements\/quicktime\/|_(([2-9]|[1-9][0-9]+)x|nohires)(\.[a-z]{3})($|#.*|\?.*))/i,
        attribute: "data-hires",

avalonalex

#!/usr/bin/env python

import argparse
import copy
import math
import pickle
import random
from itertools import combinations

agnoster

agnoster.zsh-theme

A ZSH theme optimized for people who use:

• Solarized
• Git
• Unicode-compatible fonts and terminals (I use iTerm2 + Menlo)

For Mac users, I highly recommend iTerm 2 + Solarized Dark

zolunx10

*
!.gitignore
!alternative.yaml
!*.custom.yaml
!kaomoji.*.yaml

jeewamp

/**
 * @param adjacencyList, oddVertices, EulerianPath.
 */
public <P extends Integer, Q extends ArrayList<P>> ArrayList<P>
hierholzersAlgorithm(HashMap<P, Q> adjacencyList, ArrayList<P> oddVertices, ArrayList<P> path) {

    P currentVertex=null;
    //If path is not empty, the start vertex should be in the path. 
    //Check if Semi-Eulerian. If yes, start traversing from one of them.
    if(oddVertices.size()==2) {