aspyct

c = compile("print('hello')", "noFile", "exec")
f = FunctionType(c, globals())
f()

aspyct

cd `dirname $BASH_SOURCE`

aspyct

rvmsudo rvm 1.9.3 do rake install prefix=/usr/local

aspyct

set nocompatible
filetype off

set rtp+=~/.vim/bundle/vundle
call vundle#rc()

syntax on
set hidden
set backspace=indent,eol,start
set nu

aspyct

description "My service"
author "Antoine d'Otreppe <a.dotreppe@aspyct.org>"

start on runlevel [35]
stop on runlevel [0126]

exec /path/to/script.sh
respawn

aspyct

def sayHello():
    print("hello")

def sayBye():
    sayBye()

sayHello, sayBye = sayBye, sayHello

aspyct

<!--  Add these permissions to your android manifest -->
<uses-permission android:name="android.permission.ACCESS_WIFI_STATE"/>
<uses-permission android:name="android.permission.CHANGE_WIFI_STATE"/>

aspyct

/**
 * More info?
 * a.dotreppe@aspyct.org
 * http://aspyct.org
 *
 * Hope it helps :)
 */

#include <stdio.h>
#include <stdlib.h> 

aspyct

# Sample implementation of quicksort and mergesort in ruby
# Both algorithm sort in O(n * lg(n)) time
# Quicksort works inplace, where mergesort works in a new array

def quicksort(array, from=0, to=nil)
    if to == nil
        # Sort the whole array, by default
        to = array.count - 1
    end

aspyct

class Heap
    def initialize
        # @elements is an array representing the tree
        # for each i:
        # parent => @elements[i / 2]
        # left => @elements[i * 2]
        # right => @elements[i * 2 + 1]
        @elements = []
    end