dougwt

def combinations(n, list, combos=[]):
    # initialize combos during the first pass through
    if combos is None:
        combos = []

    if len(list) == n:
        # when list has been dwindeled down to size n
        # check to see if the combo has already been found
        # if not, add it to our list
        if combos.count(list) == 0:

dougwt

import collections
import random


class RollingAverage:
    """Generates a function that tracks a rolling average of a given size."""
    def __init__(self, size):
        self.size = size
        self.deque = collections.deque(list(), self.size)
        self.count = 0

dougwt

* { 
    outline: 1px solid red; 
}

dougwt

git commit --allow-empty -m "push to execute post-receive"
git push web +master:refs/heads/master

dougwt

* {
  margin: 0;
  padding: 0;
  border: 0;
  outline: 0;
  font-size: 100%;
  box-sizing: border-box;
  vertical-align: baseline;
  background: transparent;
}