| # Tail recursion in Python | |
| # http://stackoverflow.com/questions/13591970/does-python-optimize-tail-recursion | |
| # As far as the question, does Python inherently support tail recursion? | |
| # No, and it never will since Guido prefers to be able to have proper tracebacks | |
| # http://neopythonic.blogspot.com.au/2009/04/tail-recursion-elimination.html | |
| # http://neopythonic.blogspot.com.au/2009/04/final-words-on-tail-calls.html | |
| # But it's possible to do it with a decorator, and the stack never gets too deep. | |
| # http://code.activestate.com/recipes/496691-new-tail-recursion-decorator/ |
| -- These examples are from http://en.wikipedia.org/wiki/Join_(SQL) | |
| DROP DATABASE IF EXISTS dumb_example; | |
| CREATE DATABASE dumb_example; | |
| USE dumb_example; | |
| CREATE TABLE department | |
| ( | |
| DepartmentID INT, | |
| DepartmentName VARCHAR(20) |
Because it's slow. Using mmap with /dev/mem is way way faster, even in Python, and zippity-quick in C.
Based on C code by Dom and Gert at http://elinux.org/RPi_Low-level_peripherals. Using mmap is potentially much faster than http://en.wikipedia.org/wiki/Sysfs, which is what almost all RPi tutorials recommend.
| % http://www-cdf.fnal.gov/offline/PostScript/BLUEBOOK.PDF | |
| /xcenter 306 def | |
| /ycenter 500 def | |
| /scalefactor 8 def | |
| /scale1 { | |
| scalefactor mul | |
| } def |
| """ | |
| Mock is confusing as hell. Document some of it. | |
| http://www.voidspace.org.uk/python/mock/patch.html | |
| http://mock.readthedocs.org/en/latest/index.html | |
| """ | |
| import unittest | |
| import pprint | |
| from mock import MagicMock, patch, call |
| import logging | |
| import sys | |
| import types | |
| # It's great to log the entering/leaving of methods and functions, but it would be way cool | |
| # to see who gets called by the function you go into. That probably means hacking ASTs and | |
| # finding the GOSUB bytecode. | |
| def discover(obj, filtfunc=None): | |
| if filtfunc is None: |