shlomibabluki

# coding=UTF-8
from __future__ import division
import re

# This is a naive text summarization algorithm
# Created by Shlomi Babluki
# April, 2013


class SummaryTool(object):

aparrish

import re
import random

def vtoc_idx(s):
  match_obj = re.search(r'[aeiou][^aeiou]', s.lower())
	if match_obj:
		return match_obj.start() + 1
	else:
		return None

xeoncross

<?php

function pre_print_r($var){
  echo "<pre>";
	print_r($var);
	echo "</pre>";
}


function Bigrams($word){

MarcelloDuarte

<?php

$decrease = function($self, $number) {
    if ($number >= 0) {
        echo $number . PHP_EOL;
        $self($self, --$number);
    } 
};

$decrease($decrease, 10);

adriengibrat

<?php
//set_include_path(get_include_path() . PATH_SEPARATOR . __DIR__); // optional
spl_autoload_register(function ($class) {
	$file = preg_replace('#\\\|_(?!.+\\\)#','/', $class) . '.php';
	if (stream_resolve_include_path($file))
		require $file;
});

alixaxel

<?php

function RESTful($root, $convention = '_%s')
{
	$root = rtrim(str_replace('\\', '/', realpath($root)), '/');
	$segments = preg_replace('~/+~', '/', trim(substr($_SERVER['PHP_SELF'], strlen($_SERVER['SCRIPT_NAME'])), '/'));

	foreach (range(0, count($segments = explode('/', $segments))) as $i)
	{
		if (is_file(sprintf('%s/%s.php', $root, $path = implode('/', array_slice($segments, 0, $i)))) === true)

EmanueleMinotto

Microframework

Moved to: https://github.com/EmanueleMinotto/crystal

Read more: https://github.com/EmanueleMinotto/crystal/wiki

gnarmis

from math import log, floor, pow


class MinMaxHeap(object):
    """an implementation of min-max heap using an array,
        which starts at 1 (ignores 0th element)
    """

    def __init__(self, array=[]):
        super(MinMaxHeap, self).__init__()

leemartin

$ ->
  result = []
  count  = 0

  # Loop through each reel
  $('.reel-outer'). each ->
    $this    = $(this)
    index    = $this.index()
    spinPlus = 0

ndarville

Business Models

Advertising

Models	Examples
Display ads	Yahoo!
Search ads	Google