wiccy46

if has('win32') || has('win64')
  let g:plugged_home = '~/AppData/Local/nvim/plugged'
else
  let g:plugged_home = '~/.vim/plugged'
endif
" Plugins List
call plug#begin(g:plugged_home)
  " UI related
  Plug 'chriskempson/base16-vim'
  Plug 'vim-airline/vim-airline'

wiccy46

class Memoize:
    def __init__(self, func): 
        self.func = func
        self.cache = {}
    def __call__(self, arg):
        if arg not in self.cache: 
            self.cache[arg] = self.func(arg)
        return self.cache[arg]

wiccy46

from itertools import combinations

s = 'abcdef'
set(''.join(c) for i in range(len(s) + 1) for c in combinations(s, i))

wiccy46

# Use decorator to do something before or after certain function
# E.g. Timer and Certain error check

# importing time module 
from time import time 
class Timer: 
  
    def __init__(self, func): 
        self.function = func 
  

wiccy46

from collections import deque
d = deque()
for i in range(10000):
	d.append(i)

wiccy46

"""Quick-Union
worst case is still O(N^2) if tree too tall
"""
"""Find root"""
# id is your tree array
def root(i):
  while i != id[i]:
    id[i] = id[id[i]]; # one pass variant 
    i = id[i]
  return i

wiccy46

from operator import or_
from functools import reduce # python3 required
reduce(or_, [{1, 2, 3, 4}, {3, 4, 5, 6}])
# set([1, 2, 3, 4, 5, 6])

wiccy46

# Method 1  # sieve of eratosthenes
def primes(n): 
    i, p, ps, m = 0, 3, [2], n // 2
    sieve = [True] * m
    while p <= n:
        if sieve[i]:
            ps.append(p)
            for j in range(int((p*p-3)/2), m, p):
                sieve[j] = False
        i, p = i+1, p+2

wiccy46

class CustomInt(int):
    def __call__(self, v):
        return CustomInt(self + v)

def add(v):
    return CustomInt(v)
  
# add(3)(4)(5)

wiccy46

def get_divisors(n):    
    return set(reduce(list.__add__, ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))