| #!/bin/bash | |
| INTF=$1 | |
| iwconfig "$INTF" 2>&1 | grep -q no\ wireless\ extensions\. && { | |
| echo wired | |
| exit 0 | |
| } | |
| essid=`iwconfig "$INTF" | grep 'ESSID:' | cut -d' ' -f 2- | sed 's/^ *//g' | cut -d' ' -f 4- | sed 's/ *$//g'` | |
| essid="${essid:7:(-1)}" | |
| quality=`iwconfig "$INTF" | grep 'Link Quality' | sed 's/^ *//g' | cut -d'=' -f2 | cut -d' ' -f1` |
| Options +FollowSymLinks | |
| RewriteEngine On | |
| RewriteBase / | |
| RewriteRule ^just/(1*)/?$ /index.php?just=$1 [L] | |
| RewriteRule ^add-and/(\w+)/1(1*)/(1+)(/.*)$ /$1/$2$3$4 | |
| RewriteRule ^add/(1+)/(1+)/?$ /add-and/just/$1/$2/ |
| module IKS | |
| import StdArray, StdFile, StdList, StdOverloaded, StdString | |
| from StdFunc import o | |
| import StdDynamic | |
| import Data.Functor | |
| import Control.Applicative | |
| import Control.Monad |
| \documentclass[a4paper]{article} | |
| \usepackage[T1]{fontenc} | |
| \usepackage{geometry} | |
| \usepackage{fancyvrb} | |
| \fvset{tabsize=2} | |
| \title{Lambda Calculus in \TeX} | |
| \author{Camil Staps} |
| module dyn | |
| import StdEnv | |
| import Data.Maybe | |
| :: Type | |
| = Cons String | |
| | App Type Type | |
| instance == Type |
| module fst | |
| fst :: a -> b // (a,b)->a, (a,b,c)->a, (a,b,c,d)->a, etc. | |
| fst _ = code { | |
| get_node_arity 0 | |
| push_b 0 | |
| push_b 0 | |
| repl_args_b | |
| decI | |
| .o 2 1 i |
| // ==UserScript== | |
| // @name Stack Exchange HTML math editor | |
| // @author Camil Staps <info@camilstaps.nl> | |
| // @namespace nl.camilstaps.htmlmath | |
| // @description Adds a math bar to the Stack Exchange editor | |
| // @include /^https?:\/\/(.*\.)?stackoverflow\.com/.*$/ | |
| // @include /^https?:\/\/(.*\.)?serverfault\.com/.*$/ | |
| // @include /^https?:\/\/(.*\.)?superuser\.com/.*$/ | |
| // @include /^https?:\/\/(.*\.)?stackexchange\.com/.*$/ | |
| // @include /^https?:\/\/(.*\.)?askubuntu\.com/.*$/ |
This is an unfinished list of remarks on how to write good pseudocode.
Pseudocode is a loosely defined way of transmitting the concept of an algorithm from a writer to a reader. Central is the efficiency of this communication, not the interpretability of the code by an automated program (e.g., a parser).