Skip to content

Instantly share code, notes, and snippets.

View Nicksil's full-sized avatar

Nick Silvester Nicksil

  • FOCIIS
  • North Carolina, USA
View GitHub Profile
@Nicksil
Nicksil / gist:5605332
Last active December 17, 2015 11:49
Python Pythagorean Theorem - Distance
import math
# Pythagorean theorem
# a² + b² = c²
def distance(p, q):
return math.sqrt((p[0] - q[0])**2 + (p[1] - q[1])**2)
# >>> distance([200, 250], (300, 350))
# 141.4213562373095
@Nicksil
Nicksil / gist:5632051
Last active December 17, 2015 15:29
Repeat function using time.sleep()
import time
def execute_something():
# code
time.sleep(60)
while True:
execute_something()
@Nicksil
Nicksil / gist:5632127
Created May 23, 2013 01:08
Repeat function using threading.Timer()
import threading
def f():
print('Hello, World!')
# call f() again in 30 seconds
threading.Timer(30, f).start()
f()
@Nicksil
Nicksil / gist:5645926
Created May 24, 2013 19:26
Python - Find Duplicate
# File: FindDuplicate.py
# Author: Keith Schwarz (htiek@cs.stanford.edu)
#
# An algorithm for solving the following (classic) hard interview problem:
#
# "You are given an array of integers of length n, where each element ranges
# from 0 to n - 2, inclusive. Prove that at least one duplicate element must
# exist, and give an O(n)-time, O(1)-space algorithm for finding some
# duplicated element. You must not modify the array elements during this
# process."
@Nicksil
Nicksil / gist:5645958
Created May 24, 2013 19:32
Python - Matrix Find
# File: MatrixFind.py
# Author: Keith Schwarz (htiek@cs.stanford.edu)
#
# An algorithm for finding a specific value in a specially-formatted matrix of
# values.
#
# The algorithm takes as input a matrix of values where each row and each
# column are in sorted order, along with a value to locate in that array, then
# returns whether that element exists in the matrix. For example, given the
# matrix
@Nicksil
Nicksil / gist:5646003
Created May 24, 2013 19:40
Python - Knuth-Morris-Pratt (KMP) string-matching algorithm
# File: KnuthMorrisPratt.py
# Author: Keith Schwarz (htiek@cs.stanford.edu)
#
# An implementation of the Knuth-Morris-Pratt (KMP) string-matching algorithm.
# This algorithm takes as input a pattern string P and target string T, then
# finds the first occurrence of the string T in the pattern P, doing so in time
# O(|P| + |T|). The logic behind the algorithm is not particularly complex,
# though getting it to run in linear time requires a few non-obvious tricks.
#
# To motivate KMP, consider the naive algorithm for trying to match a pattern
@Nicksil
Nicksil / gist:7275358
Created November 2, 2013 04:05
Django CSRF_TOKEN AJAX Fix
$(document).ready(function() {
// AJAX GET
$('.get-more').click(function() {
$.ajax({
type: "GET",
url: "/ajax/more/",
success: function(data) {
for(i=0; i<data.length; i++) {
$('ul').append('<li>'+data[i]+'</li>');
}
# ~/.osx — http://mths.be/osx
###############################################################################
# General UI/UX #
###############################################################################
# Set computer name (as done via System Preferences → Sharing)
scutil --set ComputerName "MathBook Pro"
scutil --set HostName "MathBook Pro"
scutil --set LocalHostName "MathBook-Pro"
  • async
  • Finish goddamn site
  • AppleScript
  • caching, memcached
  • nginx
  • reddis
  • Celery
  • Fabric
  • starlingswarmintelligence port to Python
radio_val = radio_val.toLowerCase().replace(/\b[a-z]/g, function(letter) {
return letter.toUpperCase();
});