- Update HISTORY.rst
- Commit the changes:
git add HISTORY.rst
git commit -m "Changelog for upcoming release 0.1.1."
- Update version number (can also be patch or major)
bumpversion minor
set-option -g prefix ` | |
set -g base-index 1 | |
# send ` | |
bind-key a send-prefix | |
# start window index of 1 instead of 0 | |
set-option -g base-index 1 | |
# Start panes at 1 instead of 0. tmux 1.6 only |
from itertools import chain, repeat | |
import sys | |
import types | |
# byte offsets for structures | |
if hasattr(sys, 'gettotalrefcount'): | |
# under PyDEBUG builds | |
_f_localsplus_offset = 392 | |
_ob_item_offset = 40 | |
else: |
# Byte-compiled / optimized / DLL files | |
__pycache__/ | |
*.py[cod] | |
# C extensions | |
*.so | |
# Distribution / packaging | |
.Python | |
env/ |
Write a program that does what it’s supposed to do | |
Write idiomatic code | |
Debug a program that you wrote | |
Debug a program someone else wrote | |
Debug the interaction between a system you wrote and one you didn’t | |
File a good bug report | |
Modify a program you didn’t write | |
Test a program you wrote | |
Test a program you didn’t write | |
Learn a new programming language |
git add HISTORY.rst
git commit -m "Changelog for upcoming release 0.1.1."
bumpversion minor
""" | |
bitmap utils and much of the ctc code modified | |
From Shawn Tan, Rakesh and Mohammad Pezeshki | |
""" | |
# Author: Kyle Kastner | |
# License: BSD 3-clause | |
from theano import tensor | |
from scipy import linalg | |
import theano | |
import numpy as np |
#!/usr/bin/env bash | |
# memusg -- Measure memory usage of processes | |
# Usage: memusg COMMAND [ARGS]... | |
# | |
# Author: Jaeho Shin <netj@sparcs.org> | |
# Created: 2010-08-16 | |
############################################################################ | |
# Copyright 2010 Jaeho Shin. # | |
# # | |
# Licensed under the Apache License, Version 2.0 (the "License"); # |
RDBMS-based job queues have been criticized recently for being unable to handle heavy loads. And they deserve it, to some extent, because the queries used to safely lock a job have been pretty hairy. SELECT FOR UPDATE followed by an UPDATE works fine at first, but then you add more workers, and each is trying to SELECT FOR UPDATE the same row (and maybe throwing NOWAIT in there, then catching the errors and retrying), and things slow down.
On top of that, they have to actually update the row to mark it as locked, so the rest of your workers are sitting there waiting while one of them propagates its lock to disk (and the disks of however many servers you're replicating to). QueueClassic got some mileage out of the novel idea of randomly picking a row near the front of the queue to lock, but I can't still seem to get more than an an extra few hundred jobs per second out of it under heavy load.
So, many developers have started going straight t