Madison Ruby Conf Stretches
- extend one arm forward, flex hand up(like stop sign), use other hands to pull fingers back toward body. then flex hand down and pull fingers toward body. do both sides
| module ActionView | |
| module Helpers | |
| class InstanceTag | |
| def to_check_box_tag(options = {}, checked_value = "1", unchecked_value = "0") | |
| options = options.stringify_keys | |
| options["type"] = "checkbox" | |
| options["value"] = checked_value | |
| if options.has_key?("checked") | |
| cv = options.delete "checked" | |
| checked = cv == true || cv == "checked" |
| var Favorite = { | |
| client_name: "", | |
| client_id: "", | |
| user_id: "", | |
| add_or_remove: "", | |
| getID: function(params){ | |
| this.client_name = params.attr("client_name"); | |
| this.client_id = params.attr("client_id"); | |
| this.user_id = params.attr("user_id"); |
| class B | |
| def self.method_missing(m, *args) | |
| puts "B#{m.to_s.upcase}" | |
| end | |
| end | |
| class B | |
| def self.oosh | |
| puts 1.to_f/0 | |
| end |
| module Searchable | |
| def self.searchable_fields | |
| [] | |
| end | |
| def self.included(klass) | |
| klass.named_scope :by_search, lambda {|q, options| | |
| if q.present? | |
| search_text = [klass.searchable_fields].flatten.collect {|f| |
| #!/usr/bin/env ruby | |
| require 'open-uri' | |
| category = ARGV[0] || 'fail' | |
| url = "http://api.cheezburger.com/xml/category/#{category}/lol/random" | |
| open(url) do |f| | |
| xml = f.read | |
| if xml =~ /LolImageUrl\>([^\<]*)/m |
| # ruby 1.9 supports 4 ways to call a proc! ex: f =->n {[:hello, n]}; f[:ruby]; f.call(:ruby); f.(:ruby) | |
| # | |
| # turns out, you can also call a proc via proc === :arg -- which means you can use proc's in when clauses! | |
| # ruby doc: http://ruby-doc.org/ruby-1.9/classes/Proc.html#M001165 | |
| # | |
| # ... kudos to @chadfowler for the tip! | |
| # | |
| # (note: works on 1.8.7 as well :-)) | |
| def am_i_awesome? |
| fizz = [nil, nil, "Fizz"].cycle.take(100) | |
| buzz = [nil, nil, nil, nil, "Buzz"].cycle.take(100) | |
| numbers = 1..100 | |
| numbers.zip(fizz, buzz) do |n, f, b| | |
| fizzbuzz = [f, b].join | |
| puts(fizzbuzz.empty? ? n : fizzbuzz) | |
| end |
| (defn sumo | |
| ([l n] (sumo l 0 n)) | |
| ([l acc n] | |
| (matche [l] | |
| ([[]] (fd/== acc n)) | |
| ([[x . r]] | |
| (fresh [nacc] | |
| (fd/in x (fd/interval 0 1)) | |
| (fd/+ acc x nacc) | |
| (sumo r nacc n)))))) |
| type InitFunction func() (interface{}, error) | |
| type ConnectionPoolWrapper struct { | |
| size int | |
| conn chan interface{} | |
| } | |
| /** | |
| Call the init function size times. If the init function fails during any call, then | |
| the creation of the pool is considered a failure. |