cpdean

import pickle

path = "temp.db"


def get_db():
    #touch the file. if it didn't exist, return empty dict
    with open(path, 'a+') as f:
        if len(f.read()) == 0:
            print "file was empty"

cpdean

# nope

cpdean

# combines several repositories into one,
# taking care to combine all trunks naiively,
# and all branches intelligently

import sys
import pysvn
import functools


def indempotent(f):

cpdean

import itertools, timeit
import sys
if sys.version_info < (3,):
  range = xrange
    
a = (i for i in range(11**7)); b,c = itertools.tee(a)

print(timeit.timeit(lambda : sum(b), number=1))
# this line segfaults:
a = (i for i in range(11**7)); b,c = itertools.tee(a)

cpdean

source $VIMRUNTIME/vimrc_example.vim
source $VIMRUNTIME/mswin.vim

set backupdir=~\vim\tmp\
set directory=~\vim\tmp\
set gfn=Ubuntu_Mono_for_Powerline:h14:cANSI
set bg=dark
colorscheme desert

cpdean

#!/bin/sh

# install df dependencies for ubuntu precise32
# download and unzip df tar.bz2
# manipulate config file for text mode
sudo apt-get update -qq
sudo apt-get install libgtk2.0-0 libsdl-image1.2 libsdl-ttf2.0-0 libglu1-mesa -qq

cd /home/vagrant/
if [ ! -f df_34_11_linux.tar.bz2 ]

cpdean

import functools
import logging
import time

logging.basicConfig(level=logging.INFO)


def profile(comment=""):
    def time_part(f):
        @functools.wraps(f)

cpdean

import sys 
sys.stdout = sys.stderr
sys.path.insert(0,'/home/user/public/appname.example.com/public/appname')
activate_this = '/home/user/public/appname.example.com/public/appname/appvirtualenv/bin/activate_this.py'
execfile(activate_this, dict(__file__=activate_this))
from app import app as application

cpdean

When you want to combine iterables, the common way you write out list comprehensions and list operations wastes a lot of memory. For an easy performance speed up, try switching to generators/iterators.

They're data structures that are computed lazily as their elements are requested. That way you can chain together list operations like combining, interleaving, and slicing without needing to store the sequence in memory.

You lose flexibility, since you can't use subscripts or slice syntax, but your gains from avoiding python memory allocation can be pretty huge.

cpdean

This is how mock.patch should be used, but I'm having some problems on my own codebase.

It's weird, but in this tiny example everything works just fine...