ollybritton

#!/usr/bin/env python3

import argparse 
import codecs
import http.client
import http.server
import json
import logging
import re
import sys

ollybritton

var injectContentScript = function () {
  var verbose = false;
  // var defaultServerOptions = [];
  // for (var i = 110; i <= 169; i++) { defaultServerOptions.push('s' + i)}  
  var version = null;

  var defaultServerOptions = [
    's110', 's111', 's112', 's113', 's114', 's115', 's116', 's117', 's118', 's119', 
    's120', 's121', 's122', 's123', 's125', 's126', 's127', 's128', 's129', 

ollybritton

Keybase proof

I hereby claim:

• I am ollybritton on github.
• I am ollybritton (https://keybase.io/ollybritton) on keybase.
• I have a public key ASB5zkWLVBAPIcpAdOIjh56Ryegp49Bkh7XAHgVJnumyDQo

To claim this, I am signing this object:

ollybritton

# Shunting-yard Algorithm implemented in Python.
# Takes a string using infix notation and outputs it in postfix.
# For example: (5+4)*8 -> 5 4 + 8 *

import re
from collections import namedtuple

opinfo = namedtuple('Operator', 'precedence associativity')
operator_info = {
    "+": opinfo(0, "L"),

ollybritton

Alexa Skill Getter

A Pen by Oliver Britton on CodePen.

License.

ollybritton

'use strict';

/**
 * @todo Make it so that that the `rectifyDocumentURLs` function will not select URLs which do not to be fixed.
 */

/**
 * @file This file deals with parsing URLs and parsing them into a single, resources-less HTML string.
 * @summary Parses URLs to HTML.
 * @author Olly Britton

ollybritton

/**
 * @description Takes a given resource URL and a requested base URL and will return a resource URL that is a full URL.
 * @example
 * // Returns "https://example.com/script.js"
 * fixUrl("script.js", "https://example.com")
 * 
 * @param {string} resource_url The URL of the resource, ie "script.js".
 * @param {string} base_url The base url, ie "https://example.com".
 * @param {function} callback The callback.
 * 

ollybritton

let secret_password = "YjJodGVXZHZaSGRvZVRFeE1RPT0="; // You almost found it again...

ollybritton

#coding=utf-8
"""Breadth-First Search"""
# Breadth-First searches are a way to find if two nodes in a graph are connected.
# Graphs are represented as follows:
# {
# "A": ["B", "C"]
# "B": ["A", "C"]
# "C": ["A", "B"]
# }

ollybritton

#coding=utf-8
"""Depth-First Search"""
# Depth-First searches are a (bad) way to find if two nodes in a graph are connected.
# Graphs are represented as follows:
# {
# "A": ["B", "C"]
# "B": ["A", "C"]
# "C": ["A", "B"]
# }