This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
import math | |
from scipy import ndimage as ndi | |
from skimage import feature | |
import numpy as np | |
import os | |
from scipy import ndimage as ndi | |
import cv2 | |
import Queue | |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
<!DOCTYPE html> | |
<html> | |
<head> | |
<script src="https://d3js.org/d3.v4.js"></script> | |
<script src="https://ajax.googleapis.com/ajax/libs/jquery/3.1.1/jquery.min.js"></script> | |
<script> | |
function createDivGear(color, strokeWidth, dashArray, cx, cy, r, time, rot){ | |
var svg = d3.select("svg"); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
from flask import Flask, flash, redirect, render_template, request, url_for | |
from flaskext.mysql import MySQL | |
import sys | |
mysql = MySQL() | |
app = Flask(__name__) | |
app.secret_key = 'many random bytes' | |
app.config['MYSQL_DATABASE_USER'] = 'root' |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
private ArrayList<LatLng> closestPoints_stupidSort(ArrayList<Pair<LatLng, Double>> pairs) { | |
ArrayList<Pair<LatLng, Double>> newPairs = new ArrayList<Pair<LatLng,Double>>(); | |
for(int i = 0; i < pairs.size(); i ++){ | |
if(newPairs.size() == 0){ newPairs.add(new Pair<LatLng, Double>(pairs.get(i).first, pairs.get(i).second)); continue; } | |
for(int j = 0; j < newPairs.size(); j++){ | |
if(newPairs.get(j).second > pairs.get(i).second){ | |
int jf = (j > 0)? j-1: j; | |
Log.v("NEW VAL OF JF : ", newPairs.size() + " : " + jf); | |
newPairs.add(jf, new Pair<LatLng, Double>(pairs.get(i).first, pairs.get(i).second)); |
NewerOlder