briangordon

public class RecursiveThreadPoolExecutor extends ThreadPoolExecutor {
	private AtomicInteger count;
		
	public RecursiveThreadPoolExecutor(int corePoolSize, int maximumPoolSize, long keepAliveTime, TimeUnit unit, BlockingQueue<Runnable> workQueue) {
		super(corePoolSize, maximumPoolSize, keepAliveTime, unit, workQueue);
			
		count = new AtomicInteger(0);
	}
		
	public void execute(Runnable command) {

briangordon

var n = 40;

// Each row has exactly one queen. We have to determine which column to place each queen in.
var board = [];

function initBoard() {
    // Put one queen in each row
    board = [];
    for(var row = 0; row < n; row++) {
        board[row] = [];

briangordon

var buffer = document.createElement('canvas');
var bufContext = buffer.getContext("2d");

buffer.width = 60;
buffer.height = 20;

bufContext.fillStyle = "#FFFFFF";
bufContext.fillRect(0, 0, 60, 20);

bufContext.textBaseline = "top";

briangordon

    /**
     * Add a package name prefix if the name is not absolute Remove leading "/"
     * if name is absolute
     */
    private String resolveName(String name) {
        if (name == null) {
            return name;
        }
        if (!name.startsWith("/")) {
            Class<?> c = this;

briangordon

interface Condiment {}
interface Ketchup extends ISuper {}

// This is a covariant interface
interface Kitchen<T extends Condiment> {
    public void squirtCondiment(T covariant);
}

// This implements the Kitchen interface even though the implementation refers specifically to Ketchup in the type signature
class KetchupKitchen implements Kitchen<Ketchup> {

briangordon

Consider the subset of regular expressions that only use lowercase letters, parentheses, and the Kleene star *. 
The presence of a Kleene star means that the preceding parenthesized phrase can appear zero or more times. 
Parentheses are only valid around the text preceding a Kleene star. Write a program that takes such a regular 
expression and a string and determines whether or not that entire string matches the regular expression.

For example, the string on the left matches the regular expression on the right:

    hello			hello
    testtest			(test)*
    helllllllo			he(l)*lo

briangordon

P r o g r a m m i n g - a - M o d e - F i n d e r
     -a guide to programming a mode finder-
                 By: Brian Gordon
 ____________
/Introduction\_________________________________
|                                              |
|This guide will outline the technique I found |
|is the best way to determine a mode from a    |
|set of data. It includes most of the source   |
|code from the original program, then explains |

briangordon

function MyClass () {
    var privateVariable = 5;
    var privateMethod = function () { 
        return privateVariable; 
    };

    this.publicMethod = function () {
        return privateMethod();
    }
}

briangordon

a,10144200
abandon,15323
ability,51476
able,103171
abortion,18925
about,208550
above,23866
abroad,8788
absence,13597
absolute,9622

briangordon

Keybase proof

I hereby claim:

• I am briangordon on github.
• I am brian (https://keybase.io/brian) on keybase.
• I have the public key with fingerprint 41AA 1387 FA3D 5EAC 4F4B  18EE AE46 EFC0 2F3E 2BA8

To claim this, I am signing this object: