gavinwahl

import ast
import operator


ops = {
        ast.Add: operator.add,
        ast.Mult: operator.mul,
        ast.Sub: operator.sub,
        ast.Div: operator.truediv,
        ast.FloorDiv: operator.floordiv,

gavinwahl

#! /usr/bin/env python

# Verhoeff implementation from Hermann Himmelbauer,
# http://en.wikibooks.org/wiki/Algorithm_Implementation/Checksums/Verhoeff_Algorithm#Python

verhoeff_table_d = (
    (0,1,2,3,4,5,6,7,8,9),
    (1,2,3,4,0,6,7,8,9,5),
    (2,3,4,0,1,7,8,9,5,6),
    (3,4,0,1,2,8,9,5,6,7),

gavinwahl

from django import template

register = template.Library()

class ParseClassesNode(template.Node):
    def parse_until(self, parser, token, end):
        contents = token.split_contents()
        self.classes = ' '.join(contents[1:])
        self.nodelist = parser.parse((end,))
        parser.delete_first_token()

gavinwahl

(define (zip-cons a b)
  (if (null? a)
    '()
    (cons (cons (car a) (car b)) 
          (zip-cons (cdr a) (cdr b)))))

(define (p c r)
  (cond
    ((null? c) (map (lambda (x) '()) r))
    ((eq? (car c) (caar r))

gavinwahl

expand (Plus a) = foldr interleave [] $ do
                       match <- expand a
                       return $ match:(map (match++) (expand (Plus a)))

expand (Plus a) = (concat . ap (iterate . liftM2 (++) . expand) expand) a