Using Python's built-in defaultdict we can easily define a tree data structure:
def tree(): return defaultdict(tree)
That's it!
<?xml version="1.0" encoding="UTF-8"?> | |
<xsl:stylesheet version="1.0" xmlns:xsl="http://www.w3.org/1999/XSL/Transform"> | |
<!-- | |
Author: Neil Albrock | |
Version: 1.0 | |
Description: Truncate by a character limit and retain HTML content. | |
Usage: | |
<xsl:call-template name="truncate"> | |
<xsl:with-param name="data" select="path/to/your/body" /> |
(function($,undefined){ | |
$.fn.atomGallery = function(options) { | |
//Plugin settings | |
var settings = $.extend( | |
{}, | |
{ | |
slideOutTime:1200, | |
slideOutCSS:{"opacity":"toggle","top":"+=30em"}, | |
slideOutEasing:"easeOutSine", | |
slideInTime:1000, |
## Solve Every Sudoku Puzzle | |
## See http://norvig.com/sudoku.html | |
## Throughout this program we have: | |
## r is a row, e.g. 'A' | |
## c is a column, e.g. '3' | |
## s is a square, e.g. 'A3' | |
## d is a digit, e.g. '9' | |
## u is a unit, e.g. ['A1','B1','C1','D1','E1','F1','G1','H1','I1'] |
// The `quickEach` method will pass a non-unique jQuery instance | |
// to the callback meaning that there will be no need to instantiate | |
// a fresh jQuery instance on each iteration. Most of the slow-down | |
// inherent in jQuery's native iterator method (`each`) is the constant | |
// need to have access to jQuery's methods, and so most developers | |
// see constructing multiple instances as no issue... E.g. | |
// $(...).each(function(){ $(this)... $(this)... $(this)... }); | |
// A better approach would be `quickEach`. | |
jQuery.fn.quickEach = (function(){ |
<?xml version="1.0" encoding="UTF-8"?> | |
<xsl:stylesheet version="1.0" | |
xmlns:xsl="http://www.w3.org/1999/XSL/Transform" | |
xmlns:json="http://json.org/" | |
xmlns:xs="http://www.w3.org/2001/XMLSchema"> | |
<!-- this is in the context of Symphony CMS, hence ../utilities --> | |
<xsl:import href="../utilities/xml2json.xsl"/> | |
<xsl:output omit-xml-declaration="yes" encoding="UTF-8" indent="yes" /> |
#! /usr/bin/env python | |
import redis | |
import random | |
import pylibmc | |
import sys | |
r = redis.Redis(host = 'localhost', port = 6389) | |
mc = pylibmc.Client(['localhost:11222']) |
import redis | |
import simplejson as json | |
import logging | |
import settings | |
import math | |
log = logging.getLogger(__name__) | |
# | |
# The following formulas are adapted from the Aviation Formulary |
#!/usr/bin/perl -w | |
# | |
# splitmysqldump - split mysqldump file into per-database dump files. | |
use strict; | |
use warnings; | |
my $dbfile; | |
my $dbname = q{}; | |
my $header = q{}; | |
while (<>) { |
Using Python's built-in defaultdict we can easily define a tree data structure:
def tree(): return defaultdict(tree)
That's it!
# autocomplete.py - Redis autocomplete example | |
# download female-names.txt from http://antirez.com/misc/female-names.txt | |
# Ruby original: http://gist.github.com/574044 | |
# Requires http://github.com/andymccurdy/redis-py/ | |
from redis import Redis | |
r = Redis() | |
KEY = 'compl' |