I hereby claim:
- I am Nooby on github.
- I am nooby (https://keybase.io/nooby) on keybase.
- I have a public key whose fingerprint is 41E5 43FC DC57 3530 F8B6 C918 EDDF A1DB 2FE6 DA20
To claim this, I am signing this object:
########################## | |
#Linux Specific GitIgnore# | |
########################## | |
.* | |
!.gitignore | |
*~ | |
*.sw[a-p] | |
# KDE | |
.directory |
#!/usr/bin/python | |
import sys | |
import StringIO | |
class SimpleProgress(): | |
def __init__(self, message, max): | |
self.message = message | |
self.max = max | |
self.current = 0 |
#!/bin/sh | |
DISP=`xrandr | tac | grep " connected " -m 1 | cut -d ' ' -f 1` | |
xrandr --output $DISP --primary |
class EventHook(object): | |
def __init__(self): | |
self.__handlers = [] | |
def __iadd__(self, handler): | |
self.__handlers.append(handler) | |
return self | |
def __isub__(self, handler): |
(defun cube-root (n) | |
;; Calculates the Cube Root of n. | |
(expt n 1/3)) | |
(defun factors (n &aux (lows '()) (highs '())) | |
;; We iterate in the range 1..sqrt(n) collecting ‘low’ factors and corresponding ‘high’ factors, | |
;; and combine at the end to produce an ordered list of factors. | |
;; http://rosettacode.org/wiki/Factors_of_an_integer#Common_Lisp | |
(do ((limit (isqrt n)) (factor 1 (1+ factor))) |
I hereby claim:
To claim this, I am signing this object: