This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Please check http://contributors.rubyonrails.org/ |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Please check Please check http://contributors.rubyonrails.org/names_mapping |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Please check http://github.com/fxn/rails-contributors/tree/master |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Please check http://contributors.rubyonrails.org/names_mapping |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Throw this into your bash init file for automatic | |
# paging of a few svn commands, a la git. | |
SVN_PATH=`which svn` | |
function svn | |
{ | |
case $1 in | |
cat | diff | help | list | log ) | |
if test -t 1 | |
then |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# ls(1) | |
alias ls='ls -F' | |
alias ll='ls -lh' | |
alias la='ls -lhA' | |
# Rails commands | |
alias ss='script/server' | |
alias sc='script/console' | |
alias sr='script/runner' | |
alias sa='script/about' |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
# Computes STI models who are grandchildren or more. | |
# | |
# In a STI the root class and its subclasses work normally, but if there are | |
# grandchildren we need to preload them. Reason is, given A < B < C, if you | |
# for example compute B.count without loading A, only B records are taken into | |
# account in the query (where a clause about the type column intervenes). This | |
# is not a bug, Active Record is simply not aware of A. Once it is, the clause | |
# becomes an OR with all relevant types. | |
# | |
# I used this script to compute them. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
A backup from http://sites.google.com/site/redcodenl/creating-shazam-in-java-1 just in case | |
---- | |
Creating Shazam in Java | |
A couple of days ago I encountered this article: How Shazam Works | |
This got me interested in how a program like Shazam works… And more importantly, how hard is it to program something similar in Java? |
OlderNewer