klynch

# Orignal version taken from http://www.djangosnippets.org/snippets/186/
# Original author: udfalkso
# Modified by: Shwagroo Team and Gun.io

import sys
import os
import re
import hotshot, hotshot.stats
import tempfile
import StringIO

klynch

import java.io.*;
/**
 * Calculates the amount of byte entropy across a window
 * size, N. The maximum entropy across any window size
 * is N unless N > 255 in which case the maximum number of
 * of byte patterns which may exist is 255. 
 *
 * This program is based on Charlie Daly's Entropy.java
 * program which does more or less the same thing, but 
 * this program has lower memory requirements allowing

klynch

#!/bin/sh
### BEGIN INIT INFO
# Provides:          dropbox
# Required-Start:    $local_fs $remote_fs $network $syslog $named
# Required-Stop:     $local_fs $remote_fs $network $syslog $named
# Default-Start:     2 3 4 5
# Default-Stop:      0 1 6
# X-Interactive:     false
# Short-Description: dropbox service
### END INIT INFO

klynch

-- By Richard Kulesus, 2009.  Released without license!
-- Use this for whatever!
-- I seriously despise code authors who copyright tiny bits of obvious code
-- like it's some great treasure.  This is small and simple, and if it saves
-- the next guy some time and trouble coding applescript I'll feel good!
--
-- Quickly change all the hot-corners to do what you want.
-- Particularly useful for presentations and full-screen games.
-- Customize the activity of each hot-corner with "all windows/application windows/dashboard/disable screen saver/none/show desktop/show spaces/sleep display/start screen saver"
-- The MODIFIERS are the keys which can be used to supplement hot-corner activation.

klynch

template<class T> struct NullFunctor { boolean operator()(const std::vector<T>& perm) { return FALSE; } };

//! Iterator to generate all permutations of a list. A functor can be specified for fast culling of entire subtrees of undesired permutations. 
/**
 *  The permuations are in lexicographic order. ie. {1,2,3} , {1,3,2} , {2,1,3} , {2,3,1} , {3,1,2} , {3,2,1}
 *  The current permutation list can be accessed with the dereference/pointer operators.
 *
 *  If a functor is provided then undesired subtrees can be culled.  The functor must provide this function:
 *
 *  boolean operator()(const std::vector<T>& perm)