I hereby claim:
- I am michel on github.
- I am micheldegraaf (https://keybase.io/micheldegraaf) on keybase.
- I have a public key whose fingerprint is D49B 05DA 9775 7124 C438 6F14 B676 F887 FCC9 B60E
To claim this, I am signing this object:
# Update, upgrade and install development tools: | |
apt-get update | |
apt-get -y upgrade | |
apt-get -y install git build-essential git-core curl libssl-dev \ | |
libreadline-gplv2-dev \ | |
zlib1g zlib1g-dev \ | |
libmysqlclient-dev \ | |
libcurl4-openssl-dev \ | |
libxslt-dev libxml2-dev |
#!/bin/bash | |
# Update and upgrade packages | |
sudo apt-get update && sudo apt-get upgrade | |
# Install postgres 9.3 | |
sudo apt-get install postgresql-9.3 postgresql-server-dev-9.3 postgresql-contrib-9.3 | |
# Having Postgres 9.1 already, this will create database instance configured to run on port 5433 |
function EditAlternativeLocal() | |
let filename = bufname("%") | |
if filename =~ "\.nl\.yml" | |
let alt_filename = substitute(filename, ".nl.yml", ".en.yml", "g") | |
execute "e " . alt_filename | |
elseif filename =~ "\.en\.yml" | |
let alt_filename = substitute(filename, ".en.yml", ".nl.yml", "g") | |
execute "e " . alt_filename | |
endif | |
endfunction |
I hereby claim:
To claim this, I am signing this object:
#Example gemfile | |
source :gemcutter | |
# Rails 2.3.5 | |
gem 'rails', '~> 2.3.5', :require => nil | |
gem 'ruby-mysql', '>= 2.9.1', :require => 'mysql' | |
gem 'haml', '2.2.19', :require => nil | |
gem 'inherited_resources', '= 1.0.3' |
<?xml version="1.0" encoding="UTF-8"?> | |
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd"> | |
<plist version="1.0"> | |
<dict> | |
<key>Colors</key> | |
<dict> | |
<key>Background</key> | |
<string>0.097 0.101 0.124</string> | |
<key>InsertionPoint</key> | |
<string>1.000 1.000 1.000</string> |
require 'socket' | |
require 'openssl' | |
require 'net/ftp' | |
class Net::FTPS < Net::FTP | |
end | |
class Net::FTPS::Implicit < Net::FTP | |
FTP_PORT = 990 |
#!/usr/bin/env ruby -wKU | |
# Say you have one string of alphabetic characters, and say you have another, | |
# guaranteed smaller string of alphabetic characters. Algorithmically speaking, | |
# what's the fastest way to find out if all the characters in the smaller string are in the larger string? | |
# | |
# For example, if the two strings were: | |
# | |
# | |
# String 1: ABCDEFGHLMNOPQRS |
#!/bin/bash | |
BASEDIR=http://build.chromium.org/f/chromium/snapshots/Mac | |
mkdir -p /tmp/chromium_nightly | |
cd /tmp/chromium_nightly | |
echo "Downloading number of latest revision" | |
REVNUM=`curl -# $BASEDIR/LATEST` | |
echo "Found latest revision number $REVNUM, starting download" |
alias app_setup='br db:drop:all && br db:create:all && br dsi:schema:load && br db:schema:load && br db:seed' |