mmagm

import Data.List

swap :: Int -> Int -> [a] -> [a]
swap i j xs | i == j    = xs
swap i j xs | otherwise = initial ++ (xs !! b) : middle ++ (xs !! a) : end 
    where [a,b] = sort [i,j]
          initial = take a xs
          middle  = take (b-a-1) (drop (a+1) xs)
          end     = drop (b+1) xs

lancejpollard

Copied from http://code.lancepollard.com/complete-list-of-html-meta-tags/

Basic HTML Meta Tags

<meta name="keywords" content="your, tags"/>
<meta name="description" content="150 words"/>
<meta name="subject" content="your website's subject">
<meta name="copyright"content="company name">
<meta name="language" content="ES">

oli

# ~/.gitconfig from @boblet
# initially based on http://rails.wincent.com/wiki/Git_quickstart

[core]
	excludesfile = /Users/oli/.gitignore
	legacyheaders = false # >git 1.5
	quotepath = false
# http://stackoverflow.com/questions/136178/git-diff-handling-long-lines
	pager = less -r
# if ↑ doesn’t work, try: pager = less -+$LESS -FRX

Kedrigern

{- Implementation of BST (binary search tree)
Script is absolutly free/libre, but with no guarantee.
Author: Ondrej Profant -}

import qualified Data.List

{- DEF data structure -}
data (Ord a, Eq a) => Tree a = Nil | Node (Tree a) a (Tree a) 
	deriving Show

kevsmith

%% -*- erlang-indent-level: 4;indent-tabs-mode: nil -*-
%% ex: ts=4 sw=4 et
%% @author Kevin Smith <kevin@opscode.com>
%% @copyright 2011 Opscode, Inc.

-module(example).

-behaviour(gen_server).

-export([start_link/0]).

leandrosilva

APP_NAME := my_awesome_app

all: compile
	
compile: clear
	@cp src/$(APP_NAME).app ebin/
	@erlc -pa ebin/ -o ebin/ src/*.erl
	
compile_test: compile
	@erlc -pa ebin/ -o ebin/ test/*.erl