tdeebswihart

# starter blocklist that contains a few rules that will be used to minimize
# the hosts provided by the urls in the script
*-analytics.*
a.*
ad.*
ad[0-9].*
ads.*
adserv*.*
adserver.*
adtech.*

tdeebswihart

Usage:

1. Save the attached .plist file to ~/Library/LaunchAgents/local.YOUR_USER.pia.plist
2. Change all of the YOUR_USER markers to your computer's username
3. Save pia-control.sh to ~/.local/bin/pia-control (or save it elsewhere and update the LaunchAgent)
4. Create the file ~/.pia_trusted_ssids with the SSIDs (wireless network names) of each of the networks you'd like to trust, one per line
5. Run launchctl load ~/Library/LaunchAgents/local.YOUR_USER.pia.plist; launchctl start local.YOUR_USER.pia

tdeebswihart

Keybase proof

I hereby claim:

• I am chronoslynx on github.
• I am panikode (https://keybase.io/panikode) on keybase.
• I have a public key ASAFp81dnTDjZUlE-oArPK6hyAkfQ7kler2e6KPdnoEyeQo

To claim this, I am signing this object:

tdeebswihart

#!/bin/bash
if (( $# < 2 )); then
  echo "usage: $0 modref|escape TESTCASE"
  exit 1
fi
test ! -d "examples/$2" && echo "unknown example $2">&2 && exit 1
case "$1" in
  modref)
    ant -Dchord.work.dir=examples/$2/ modref
    echo "[+] Note: < is from reference but not yours, > is in yours but not reference"

tdeebswihart

#!/bin/bash
if (( $# < 2 )); then
  echo "usage: $0 modref|escape TESTCASE"
  exit 1
fi
test ! -d "examples/$2" && echo "unknown example $2">&2 && exit 1
case "$1" in
  modref)
    ant -Dchord.work.dir=examples/$2/ modref
    echo "[+] Note: < is from reference but not yours, > is in yours but not reference"

tdeebswihart

#! /usr/bin/env python
import click
from collections import defaultdict
import os
import re
import subprocess

NETWORK = 'Udacity'

def call_ap(mp4path, show, season_num, episode_num, title):

tdeebswihart

use std::collections::HashSet;

/* /r/DailyProgrammer challenge #197 Hard
 * <http://www.reddit.com/r/dailyprogrammer/comments/2snhei/20150116_challenge_197_hard_crazy_professor/>
 * Goal: Find the 1,000,000th 20-smooth number: the one-millionth number that is not
 * divisible by any prime > 20
 */

trait Min<T: Ord> {
    fn min(&self) -> Option<T>;

tdeebswihart

Keybase proof

I hereby claim:

• I am chronoslynx on github.
• I am chronon (https://keybase.io/chronon) on keybase.
• I have a public key whose fingerprint is D974 F5DB CABB F837 63EC 1FF2 B0AF 207F B0FE 83FA

To claim this, I am signing this object:

tdeebswihart

class User < ActiveRecord::Base
# Connects this user object to Sufia behaviors.
  include Sufia::User
  include Curate::UserBehavior

# Connects this user object to Hydra behaviors.
  include Hydra::User

  attr_accessible :email, :password, :password_confirmation if Rails::VERSION::MAJOR < 4
# Connects this user object to Blacklights Bookmarks.