briangordon

while($true) {
	Get-Process | ? {$_.StartTime -gt (Get-Date).AddMinutes(-1)} | Select-Object ProcessName,Description,Path >> out.txt
	sleep 0.01
}

briangordon

CHEATENGINE   `êcžö  áÏ Ð|¤ö  generic unknown error   KÊžö  Px¤ö   ¤ö  P~¤ö   |¤ö  °|¤ö  Ð|¤ö  iostream        iostream stream error    KÊžö  Px¤ö  0¤ö   ~¤ö  `|¤ö  °|¤ö  Ð|¤ö  system  invalid string position string too long         specularPowers  bool    aiEditable.actionSettings.taunt.tauntMinInterval    float   *   aiConstants.physics.clipMask.shotClip   probability int maxLookAngles   idVec2  weaponVars.burstWaitTime    int swapParticle    float   bool    float   onSprinting *   idAngles    int staticSpecularVector    idDeclParticle  bool    aiEditable.movement.usesSmoothAnimSearch    int aiEditable.targeting.spottedMax idVec3  specularScales  bool    aiEditable.actionSettings.taunt.tauntMaxInterval    float   int aiConstants.physics.clipMask.ikClip int minIdleTime int howLongToHold   idVec2  weaponVars.randomness   destroyParticle float   bool    onShooting  int additiveBlendLight  *   idDeclParticle  bool    aiEditable.movement.usesSmoothAnimCombat    *   aiEditable.ta

briangordon

#include <iostream>
#include <iomanip>
#include <fstream>
#include <sstream>
#include <string>
#include <vector>
#include <unordered_map>
#include <sys/time.h>

// We specify the total number of systems explicitly so that we can initialize data structures before reading in the whole csv file.

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:

briangordon

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

briangordon

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

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

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

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

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

    /**
     * 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;