linjian

# http://ariejan.net/2011/09/24/rspec-speed-up-by-tweaking-ruby-garbage-collection
#
# Usage:
# DEFER_GC=10 rspec spec/
# DEFER_GC=10 cucumber features/
#
# put it to spec/support/deferred_garbage_collection_all_in_one.rb
#        or feature/support/hooks.rb
class DeferredGarbageCollection
  DEFERRED_GC_THRESHOLD = (ENV['DEFER_GC'] || -1).to_f

alieseparker

# Floyd-Warshall Algorithm
## Introduction:
Finds Shortest Path (or longest path) among all pairs of nodes in a graph.
Complexity: O(|n|³)


## How does it work?
- There can be more than one route between two nodes.
- The number of nodes in the route isn’t important (Path 4 has 4 nodes but is shorter than Path 2, which has 3 nodes)
- There can be more than one path of minimal length

otaviomedeiros

# RSpec matcher for alias_method.
# https://gist.github.com/1950961
# Usage:
#
#     describe User do
#       it { should alias_from(:username).to(:email) }
#     end


RSpec::Matchers.define :alias_from do |alias_method|

barockok

require 'mechanize'
require 'nokogiri'
require 'active_support/all'

class SaadAlGhamidi
	def initialize
		@page_agent = Mechanize.new
		@file_agent = Mechanize.new
		@file_agent.pluggable_parser.default = Mechanize::Download
	end

barockok

merchant_id       = 'XXXXXXXXXXXXXXXXXXX'
merchant_hash_key = 'XXXXXXXXXXXXXXXXXXX'

# implemetation for generating form 
payment_service_for @order.id, merchant_id, \
  merchant_hash_key:  merchant_hash_key, 
  service:            :veritrans,
  amount:             @order.total_amount,
  currency:           'IDR',
  html:               {:id => 'payment-form' , :authenticity_token => false } do |service|

jrafanie

~/Code/playground/rails-3-2-stable $ cat app/models/person.rb 
class Person
  attr_accessor :abc
end


~/Code/playground/rails-3-2-stable $ cat app/models/story.rb
class Story < ActiveRecord::Base
  attr_accessor :abc
end

OliverJAsh

export default 'bar';