mullikine

{-# LANGUAGE OverloadedStrings #-}

import Turtle
import Data.Text (words)

rpmspecSrc qf spec = do
  (_res, out) <- procStrict "rpmspec" ["-q", "--srpm", "--undefine=dist", "--qf", qf, spec] empty
  return out

nvr = "%{name}-%{version}-%{release}"

mullikine

; sets as unordered lists:

; a set for now is defined as as being able 
; to undergo the following operations

; 1)  element-of-set? checks if x is in set
(define (element-of-set? x set)
  (cond ((null? set) false)
        ((equal? x (car set)) true)
        (else (element-of-set? x (cdr set)))))

mullikine

;; The following implementation of rb-tree is based on http://www.cs.kent.ac.uk/people/staff/smk/redblack/.

(defun change-to-black (tree)
  (pattern-match tree
    ((:pattern (_ . rest) :variable rest :ignore _) `(:B . ,rest))
    (:otherwise nil)))

(defun rb-insert (tree obj cmp)
  (change-to-black (rb-insert% tree obj cmp)))

mullikine

import System.Environment (getArgs)
import Control.Monad (mapM_)
import Data.Functor ((<$>))
import Data.String.Utils (replace) -- missingH
import System.IO.UTF8 (putStrLn, readFile) -- utf8-string
import Prelude hiding (putStrLn, readFile)

main :: IO ()
main = main' =<< getArgs

mullikine

Transforming Code into Beautiful, Idiomatic Python

Notes from Raymond Hettinger's talk at pycon US 2013 video, slides.

The code examples and direct quotes are all from Raymond's talk. I've reproduced them here for my own edification and the hopes that others will find them as handy as I have!

Looping over a range of numbers

for i in [0, 1, 2, 3, 4, 5]:

mullikine

iniital board:
              1         3         2         5         4         2         2         3   
    1     12345678  .....6..  12345678  12345678  ....5...  12345678  1.......  12345678  3
    4     12345678  .2......  1.......  12345678  12345678  12345678  12345678  12345678  2
    3     .2......  12345678  12345678  12345678  .....6..  12345678  ..3.....  12345678  5
    3     12345678  12345678  12345678  12345678  12345678  .......8  12345678  12345678  2
    2     12345678  12345678  .....6..  12345678  12345678  ..3.....  ......7.  12345678  3
    2     12345678  12345678  ....5...  12345678  12345678  12345678  12345678  12345678  1
    4     12345678  12345678  12345678  12345678  12345678  12345678  12345678  ..3.....  3
    3     12345678  12345678  12345678  12345678  ..3.....  12345678  12345678  12345678  3

mullikine

mullikine

mullikine

Latency Comparison Numbers
--------------------------
L1 cache reference                           0.5 ns
Branch mispredict                            5   ns
L2 cache reference                           7   ns                      14x L1 cache
Mutex lock/unlock                           25   ns
Main memory reference                      100   ns                      20x L2 cache, 200x L1 cache
Compress 1K bytes with Zippy             3,000   ns        3 us
Send 1K bytes over 1 Gbps network       10,000   ns       10 us
Read 4K randomly from SSD*             150,000   ns      150 us          ~1GB/sec SSD

mullikine

Docker Commands, Help & Tips

Show commands & management commands

$ docker

Docker version info