Ben Hoyt benhoyt

## tiny-vdom-speed.html
<html>
  <head><title>More speed tests</title></head>
<body>
<h1>More speed tests</h1>
<div id="main"></div>
<script>
/*
  <ul>
  {% for item in items %}
    <li>item: {{ item }}</li>

## test_dom.html
<html>
<head>
<title>Test speed of various methods of building DOM</title>
</head>
<body>
Test speed of various methods of building DOM
</body>

<script>

## is_none_bytecode.diff
b66bbc41ce52efe667af0ba47a6098216b758236
diff --git a/Include/opcode.h b/Include/opcode.h
index 99c3b0ef81..dceedc662a 100644
--- a/Include/opcode.h
+++ b/Include/opcode.h
@@ -12,6 +12,8 @@ extern "C" {
 #define ROT_THREE                 3
 #define DUP_TOP                   4
 #define DUP_TOP_TWO               5
+#define COMPARE_IS_NONE           6

## sliding_window_sort.py
"""Efficient sliding-window sorting of time-series data in CSV file.

Demo for http://stackoverflow.com/a/42398981/68707

Tested on Python 3.5.
"""

import collections
import csv
import datetime

## thread_test.py
"""Test how many threads we can run at once."""

import itertools
import threading
import time
import sys

import requests


## snakes_and_ladders.py
"""Calculate the average number of moves in a snakes and ladders game.

Because as a parent one gets roped into these board (boring?) games
every so often, and I wanted to calculate the average duration of a
snakes and ladders game. Turns out it's about 36 moves (though
admittedly that's for a single-player game). :-)

> python snakes_and_ladders.py
Played 10000 rounds, averaged 36.0559 moves, max 324 moves, took 0.508s
"""

## birthday_probability.py
"""Calculate the probability of generating a duplicate random number after
generating "n" random numbers in the range "d".

Usage: python birthday_probability.py n [d=365]

Each value can either be an integer directly, or in the format "2**x", where
x is the number of bits in the value.

For example, to calculate the probability that two people will have the same
birthday in a room with 23 people:

## atomic_counter.py
"""An atomic, thread-safe incrementing counter."""

import threading


class AtomicCounter:
    """An atomic, thread-safe incrementing counter.

    >>> counter = AtomicCounter()
    >>> counter.increment()

## generate_key.py
"""Function to generate a random string (key) of length chars."""

import binascii
import os


def generate_key(length=40, get_bytes=os.urandom):
    """Return a randomly-generated key of length chars.

    >>> len(generate_key())

## ngrams.py
"""Print most frequent N-grams in given file.

Usage: python ngrams.py filename

Problem description: Build a tool which receives a corpus of text,
analyses it and reports the top 10 most frequent bigrams, trigrams,
four-grams (i.e. most frequently occurring two, three and four word
consecutive combinations).

NOTES
	<html>
	<head><title>More speed tests</title></head>
	<body>
	<h1>More speed tests</h1>
	<div id="main"></div>
	<script>
	/*
	<ul>
	{% for item in items %}
	<li>item: {{ item }}</li>
	<html>
	<head>
	<title>Test speed of various methods of building DOM</title>
	</head>
	<body>
	Test speed of various methods of building DOM
	</body>

	<script>
	b66bbc41ce52efe667af0ba47a6098216b758236
	diff --git a/Include/opcode.h b/Include/opcode.h
	index 99c3b0ef81..dceedc662a 100644
	--- a/Include/opcode.h
	+++ b/Include/opcode.h
	@@ -12,6 +12,8 @@ extern "C" {
	#define ROT_THREE 3
	#define DUP_TOP 4
	#define DUP_TOP_TWO 5
	+#define COMPARE_IS_NONE 6
	"""Efficient sliding-window sorting of time-series data in CSV file.

	Demo for http://stackoverflow.com/a/42398981/68707

	Tested on Python 3.5.
	"""

	import collections
	import csv
	import datetime
	"""Test how many threads we can run at once."""

	import itertools
	import threading
	import time
	import sys

	import requests
	"""Calculate the average number of moves in a snakes and ladders game.

	Because as a parent one gets roped into these board (boring?) games
	every so often, and I wanted to calculate the average duration of a
	snakes and ladders game. Turns out it's about 36 moves (though
	admittedly that's for a single-player game). :-)

	> python snakes_and_ladders.py
	Played 10000 rounds, averaged 36.0559 moves, max 324 moves, took 0.508s
	"""
	"""Calculate the probability of generating a duplicate random number after
	generating "n" random numbers in the range "d".

	Usage: python birthday_probability.py n [d=365]

	Each value can either be an integer directly, or in the format "2**x", where
	x is the number of bits in the value.

	For example, to calculate the probability that two people will have the same
	birthday in a room with 23 people:
	"""An atomic, thread-safe incrementing counter."""

	import threading


	class AtomicCounter:
	"""An atomic, thread-safe incrementing counter.

	>>> counter = AtomicCounter()
	>>> counter.increment()
	"""Function to generate a random string (key) of length chars."""

	import binascii
	import os


	def generate_key(length=40, get_bytes=os.urandom):
	"""Return a randomly-generated key of length chars.

	>>> len(generate_key())
	"""Print most frequent N-grams in given file.

	Usage: python ngrams.py filename

	Problem description: Build a tool which receives a corpus of text,
	analyses it and reports the top 10 most frequent bigrams, trigrams,
	four-grams (i.e. most frequently occurring two, three and four word
	consecutive combinations).

	NOTES