Skip to content

Instantly share code, notes, and snippets.

View toshsan's full-sized avatar
🌴
On vacation

Santosh Sahoo toshsan

🌴
On vacation
View GitHub Profile
tableau20 = [(31, 119, 180), (174, 199, 232), (255, 127, 14), (255, 187, 120),
(44, 160, 44), (152, 223, 138), (214, 39, 40), (255, 152, 150),
(148, 103, 189), (197, 176, 213), (140, 86, 75), (196, 156, 148),
(227, 119, 194), (247, 182, 210), (127, 127, 127), (199, 199, 199),
(188, 189, 34), (219, 219, 141), (23, 190, 207), (158, 218, 229)]
@toshsan
toshsan / enlist.sh
Created March 6, 2015 22:06
enlist recursive trunks from Subversion
#!/bin/sh
if [ "help$1"=="help" ] || [ "$1"=="help" ]; then
echo "usage--- \nenlist http://svn/rootpath"
exit 1
fi
URL=$1
ROOTDIRS=$(svn ls $URL)
@toshsan
toshsan / nginx-s3-proxy
Last active October 6, 2017 19:27 — forked from mikhailov/gist:9639593
Nginx proxy to S3 with cache
# The Nginx configuration based on https://coderwall.com/p/rlguog
http {
ssl_certificate server.crt;
ssl_certificate_key server.key;
ssl_session_timeout 15m;
ssl_protocols SSLv3 TLSv1 TLSv1.1 TLSv1.2;
ssl_prefer_server_ciphers on;
ssl_session_cache shared:SSL:10m;
#!/usr/bin/python
zeroTo19 = ["zero", "one", "two", "three", "four", "five", "six", "seven", "eight", "nine",
"ten", "eleven", "twelve", "thirteen", "fourteeen", "fifteen", "sixteen", "seventeen", "eighteen", "nineteen"]
tens = [ "", "", "twenty", "thirty", "fourty", "fifty", "sixty", "seventy", "eighty", "ninety" ]
denoms = [ (1000000000000, "trillion"), (1000000000, "billion"), (1000000, "million"), (1000, "thousand"), (100, "hundred") ]
def num2words(n):
if n<20:
return zeroTo19[n]
/*
This code is public domain.
The MurmurHash3 algorithm was created by Austin Appleby and put into the public domain. See http://code.google.com/p/smhasher/
This C# variant was authored by
Elliott B. Edwards and was placed into the public domain as a gist
Status...Working on verification (Test Suite)
Set up to run as a LinqPad (linqpad.net) script (thus the ".Dump()" call)
*/
@toshsan
toshsan / cache.py
Last active August 29, 2015 14:13 — forked from craig552uk/cache.py
# -*- coding: utf-8 -*-
#
# A simple memory cache library
# Author: Craig Russell <[email protected]>
#
import time
class Cache(object):
@toshsan
toshsan / memoize.py
Created January 7, 2015 16:24
memoize
def memoize(function):
cache = {}
def wrap(*args):
if not args in cache:
print '{0} not in {1}'.format(args, cache)
cache[args] = function(*args)
return cache[args]
return wrap
BASE_ALPH = tuple("0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz")
BASE_DICT = dict((c, v) for v, c in enumerate(BASE_ALPH))
BASE_LEN = len(BASE_ALPH)
def base_decode(string):
num = 0
for char in string:
num = num * BASE_LEN + BASE_DICT[char]
return num
@toshsan
toshsan / color.py
Created September 30, 2014 00:39
Most significant color in Image, Color Algorithm
#https://news.ycombinator.com/item?id=4694663
from PIL import Image
import scipy
import scipy.cluster
from pprint import pprint
image = Image.open('logo.png')
NUM_CLUSTERS = 5
@toshsan
toshsan / primes.py
Created July 21, 2014 19:29
Python generator for N Prime number
def primes(n):
yield 2
primes=[2]
x = 1
i = 3
while(x<n):
isprime=True
for p in primes:
if i%p==0: isprime = False