Integralist

hash = { 'foo' => 'bar' }

# Version 1
hash = Hash[hash.map { |k, v| [k.to_sym, v] }]

# Version 2
hash = hash.reduce({}) do |memo, (k, v)| 
  memo.tap { |m| m[k.to_sym] = v }
end

gosuri

# Depth-first search (DFS) is an algorithm for traversing or
# searching a tree, tree structure, or graph. One starts at 
# the root (selecting some node as the root in the graph case)
# and explores as far as possible along each branch before backtracking.
#
# A graph can be represented by its adjacency matrix G,
# where G[i][j] == 1 if there is an edge between 
# vertices i and j and 0 otherwise.
#
# Below Graph in diagram http://i.imgur.com/sV1UzUn.png

pboling

web: bundle exec rails server puma -p $PORT -e $RACK_ENV
critical: env HEROKU_PROCESS=critical bundle exec sidekiq -c 2 -q critical,4
default: env HEROKU_PROCESS=default bundle exec sidekiq -c 4 -q default,2
low: env HEROKU_PROCESS=low bundle exec sidekiq -c 1 -q low,1

dangerp

$.getScript('/users/show')