magical

Utilities
---------
htop
tree
atool
the_silver_searcher (silversearcher-ag)
whois
mtr
mosh
vim

magical

- objdump (from binutils)
- ndisasm (from nasm)
- file
- xxd
- vbindiff
- strace

magical

ifMUD
An interactive conversation
Copyright 1997-2007 by Loungent Technologies, a wholly owned subsidiary of
rec.[arts|games].int-fiction; All rights reserved.
Release 4 / Serial number 990908 / perlMUD v2.1z

    "The characters were mostly of the cardboard cutout variety.
    I wanted to punch everyone except the one Scottish guy."
         --Jearl

magical

package main

import (
	"fmt"
	"io"
	"math/rand"
	"strings"
)

type ReaderSource struct {

magical

Latency numbers every programmer should know

L1 cache reference ......................... 0.5 ns
Branch mispredict ............................ 5 ns
L2 cache reference ........................... 7 ns
Mutex lock/unlock ........................... 25 ns
Main memory reference ...................... 100 ns             
Compress 1K bytes with Zippy ............. 3,000 ns  =   3 µs
Send 2K bytes over 1 Gbps network ....... 20,000 ns  =  20 µs
SSD random read ........................ 150,000 ns  = 150 µs

Read 1 MB sequentially from memory ..... 250,000 ns = 250 µs

magical

Item Stats Structure
0x00    uint16    Purchase Price (in units of $10)
0x02    uint8        Held effect?
0x03    uint8        Effect argument
0x04    uint8        Natural Gift effect
0x05    uint8        Fling effect
0x06    uint8        Fling power
0x07    uint8        Natural Gift power
0x08    uint16    Bits 0-4: Natural Gift type (31=n/a)
            Flags?

magical

import Control.Monad (fail)
import Control.Monad.Trans (lift, liftIO)
import Text.Parsec ((<|>), (<?>))
import Text.Read (readMaybe)
import System.IO (hFlush, stdout)

import qualified Control.Monad.Trans.State.Strict as State
import qualified Data.HashMap.Strict as HashMap
import qualified Text.Parsec as P

magical

def quicksort(list):
    #print "quick>", list
    if len(list) <= 1:
        return list

    pivot = list[len(list)//2]
    a = mergesort([x for x in list if x <= pivot])
    b = mergesort([x for x in list if not x <= pivot])
    #print "quick<", a+b
    return a + b

magical

package main

import (
	"flag"
	"fmt"
	"time"
)

type pair struct{ End, Start Point }

magical

type node = { accept: bool; links: link list }
 and link = Link of char * node

type nfa_type = NFA of node list * node 

type regexp =
        | Empty
        | Epsilon
        | Single of char