tianhuil

Suppose we wish to understand if a given X/Y pair falls within a set of non-intersecting arbitrary polygons. For example, we are trying to see if a given lat,long falls within a Michigan minor civil division. There are 1500+ such divisions each one of which could be a polygon with hundreds or thousands of points. The following is a practical solution that is fast enough to return to a user.

1. Break up Michigan into $N$ box oriented tiles. We can easily calculate if x, y will only fall within a tile based on the value (x % WIDTH, y % HEIGHT). Select $N$ such that most (e.g. ~60%?) tiles are fully contained within a polygon, and the vast majority (e.g. 95%) are in no more than 4 polygons. I imagine this would happen easy at $N$ less than 100,000.
2. Preprocess the polygon shape files using Shapely to determine a map

tianhuil

import gzip
import os
from itertools import islice
import argparse

# from https://stackoverflow.com/a/41333436/8930600
def grouper(iterable, n):
   iterator = iter(iterable)
   while True:
     group = tuple(islice(iterator, n))

tianhuil

from sklearn.base import BaseEstimator, TransformerMixin

class ClassifierTransform(BaseEstimator, TransformerMixin):
    def __init__(self, clf):
        self.clf = clf
        
    def fit(self, X, y=None):
        self.clf.fit(X, y)
        return self
    

tianhuil

from sklearn.base import BaseEstimator, ClassifierMixin, RegressorMixin

class _ResidualEstimator(BaseEstimator):
    def __init__(self, base, residual):
        self.base = base
        self.residual = residual
        
    def fit(self, X, y):
        self.base.fit(X, y)
        self.residual.fit(X, y - self.base.predict(X))

tianhuil

#!ipython
# to use this run these two steps
# curl https://gist.githubusercontent.com/tianhuil/a6675835a7a0c157fbcb296a743f52d4/raw/704a20201dd4362928f6e39ab0ab0bc0784b2af9/update_branches.ipy
# ipython merged_branches.ipy

!git checkout master
branches = !git branch
other_branches = [b.lstrip() for b in branches if b != '* master']

results = {}

tianhuil

# cd into a new folder and observe the error in the last line.

yes | rm email.py*
echo "from email.utils import formatdate; print 'OK'" > foo.py
PYTHONPATH="" python foo.py
touch email.py
PYTHONPATH="" python foo.py

tianhuil

React is a fairly simple browser-side framework. It promises to be faster than Angular.

The website itself, provides two great tutorials:

1. https://facebook.github.io/react/docs/hello-world.html
2. https://facebook.github.io/react/tutorial/tutorial.html

After going through these two, it is recommended that you go through this tutorial on react router:

tianhuil

#!/usr/bin/python

"""
Script to generate passphrases according to the vocabular in:
http://world.std.com/~reinhold/diceware.wordlist.asc

To see why this might be a better algorithm for choosing a password:
https://blog.agilebits.com/2011/06/21/toward-better-master-passwords/

Usage: ./dicewords.py n m

tianhuil

# from http://stackoverflow.com/questions/1816958/cant-pickle-type-instancemethod-when-using-pythons-multiprocessing-pool-ma

from multiprocessing import Pool, cpu_count
from multiprocessing.pool import ApplyResult

# --------- see Stenven's solution above -------------
from copy_reg import pickle
from types import MethodType

def _pickle_method(method):

tianhuil

# Instaling Ubuntu
# http://www.cloudera.com/content/cloudera-content/cloudera-docs/CDH4/latest/CDH4-Quick-Start/cdh4qs_topic_3_2.html

# While, we're at it, let's install the JDK ...
echo "y" | sudo apt-get install openjdk-6-jdk

# ... and Yelp's mrjob
pip install mrjob

# Install maven