Erik Bjäreholt ErikBjare

## blockstack-verification.txt
Verifying my Blockstack ID is secured with the address 1MUWQSMtg2BeKvsMN6pZMRgptzwhiuXruA https://explorer.blockstack.org/address/1MUWQSMtg2BeKvsMN6pZMRgptzwhiuXruA

## keybase.md

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                ErikBjare
                / keybase.md
            
            
              Created Jun 16, 2017
            
          
      View keybase.md
  
    
    Keybase proof
I hereby claim:

I am ErikBjare on github.
I am erb (https://keybase.io/erb) on keybase.
I have a public key whose fingerprint is AE64 E141 3876 3D20 1E7A  E732 7A8F 433A 86E4 C130

To claim this, I am signing this object:

  
## _.md

      
              3 files
            
          
              0 forks
            
          
              0 comments
            
          
              0 stars
            
          
                ErikBjare
                / _.md
            
            
              Last active May 17, 2017
            
              
                knowtree-graph
              
          
      View _.md
  
    
    [ Launch: asd ] c3c98b497afa902c075a4c23da029385 by ErikBjare


## windows_time_since_input.py
import time

import ctypes
from ctypes import Structure, POINTER, WINFUNCTYPE, windll
from ctypes.wintypes import BOOL, UINT, DWORD

class LastInputInfo(Structure):
    _fields_ = [
        ("cbSize", UINT),
        ("dwTime", DWORD)

## gist:908f73cb01c58b3178ca
Verifying that +erikbjare is my openname (Bitcoin username). https://onename.io/erikbjare

## lifelogger.ipynb

      
              1 file
            
          
              0 forks
            
          
              0 comments
            
          
              1 star
            
          
                ErikBjare
                / lifelogger.ipynb
            
            
              Created Apr 19, 2014
            
              
                MongoDB Notebook, find it here: http://nbviewer.ipython.org/gist/ErikBjare/11092794

              
      View lifelogger.ipynb
  
    
      Sorry, something went wrong. Reload?
      Sorry, we cannot display this file.
      Sorry, this file is invalid so it cannot be displayed.
      
          Viewer requires iframe.
      
    
## ticker_notify.sh
#!/bin/sh
# Requires jq

# Remember to chmod +x!
#
# Add the following cron-job (using "crontab -e") to run at hourly intervals:
#     0 * * * * export DISPLAY=:0.0 && /bin/bash <SCRIPT_PATH_GOES_HERE> > /dev/null 2>&1
# Change <SCRIPT_PATH_GOES_HERE> to the appropriate name

BTCE_PRICE="$(curl -s https://btc-e.com/api/2/btc_usd/ticker | jq '.ticker.last')"

## btce_ticker.sh
#!/bin/sh

# Oneliner by @Coornail, modifications by @ErikBjare

watch -n1 -d "curl -s https://btc-e.com/api/2/btc_usd/ticker | json_pp | tail --line=+2 | head --line=12"

## fib.lisp
(defun fib (l n)
    (if (< (length l) n)
        (fib (append l (list (apply #'+ (last l 2)))) n)
        l
))

## fib.hs
-- Takes an empty list *l* and calculates a *n* numbers in the fibonacci sequence
fib l n
    | l == [] = fib [1,1] n
    | length(l) <= n = fib (sum(take 2 l) : l) n
    | otherwise = l
	import time

	import ctypes
	from ctypes import Structure, POINTER, WINFUNCTYPE, windll
	from ctypes.wintypes import BOOL, UINT, DWORD

	class LastInputInfo(Structure):
	_fields_ = [
	("cbSize", UINT),
	("dwTime", DWORD)
	#!/bin/sh
	# Requires jq

	# Remember to chmod +x!
	#
	# Add the following cron-job (using "crontab -e") to run at hourly intervals:
	# 0 * * * * export DISPLAY=:0.0 && /bin/bash <SCRIPT_PATH_GOES_HERE> > /dev/null 2>&1
	# Change <SCRIPT_PATH_GOES_HERE> to the appropriate name

	BTCE_PRICE="$(curl -s https://btc-e.com/api/2/btc_usd/ticker \| jq '.ticker.last')"
	#!/bin/sh

	# Oneliner by @Coornail, modifications by @ErikBjare

	watch -n1 -d "curl -s https://btc-e.com/api/2/btc_usd/ticker \| json_pp \| tail --line=+2 \| head --line=12"
	(defun fib (l n)
	(if (< (length l) n)
	(fib (append l (list (apply #'+ (last l 2)))) n)
	l
	))
	-- Takes an empty list l and calculates a n numbers in the fibonacci sequence
	fib l n
	\| l == [] = fib [1,1] n
	\| length(l) <= n = fib (sum(take 2 l) : l) n
	\| otherwise = l