lwu

This code snippet, modifed from Mpanik's rundemo.cpp (r727, license LGPL), 
renders the State of California using USGS state boundaries data.

Here's a play-by-play (via https://lists.berlios.de/pipermail/mapnik-devel/2008-August/000679.html)

rundemo.cpp renders a map of Ontario/Quebec, and instead I wanted to draw a
map of California and its surrounding states.

I grabbed the data from the USGS in the form of "statesp020" (google it, or
browse through nationalatlas.gov) and first wanted to modify rundemo.py

bmaeser

lines with $ are commands

### install mkvtoolnix:

$ brew install mkvtoolnix

### list content of the mkv-file:
$ mkvmerge -i mymoviefile.mkv

### what will give you:

MohamedAlaa

tmux shortcuts & cheatsheet

start new:

tmux

start new with session name:

tmux new -s myname

dmytro

#!/bin/bash
# ssh-multi
# D.Kovalov
# Based on http://linuxpixies.blogspot.jp/2011/06/tmux-copy-mode-and-how-to-control.html

# a script to ssh multiple servers over multiple tmux panes


starttmux() {
    if [ -z "$HOSTS" ]; then

rsobik

#===============================================================================
# Filename:  boost.sh
# Author:    Pete Goodliffe
# Copyright: (c) Copyright 2009 Pete Goodliffe
# Licence:   Please feel free to use this, with attribution
# Modified version
#===============================================================================
#
# Builds a Boost framework for the iPhone.
# Creates a set of universal libraries that can be used on an iPhone and in the

mattfahrner

#! /usr/bin/python

import sys
import ldap
from ldap.controls import SimplePagedResultsControl
from distutils.version import LooseVersion

# Check if we're using the Python "ldap" 2.4 or greater API
LDAP24API = LooseVersion(ldap.__version__) >= LooseVersion('2.4')

ihabunek

module ObfuscatedGame where

import Data.Set as Set

neighbours p = Set.fromList [(fst p + dx, snd p + dy) | dx <- [-1..1], dy <- [-1..1], not (dx == 0 && dy == 0)]

lives g p = ((member p g) && count `elem` [2, 3]) || (not (member p g) && count == 3)
    where count = Set.size $ Set.filter (flip member g) (neighbours p)

nextGen g = Set.filter (lives g) (union g $ unions [neighbours p | p <- toList g])