Mark Josef mark

## array_methods.rb
class Array

  def hashify
    Hash.new.tap do |hash|
      each { |obj| hash[obj] = yield(obj) }
    end
  end

  def reverse_hashify
    Hash.new.tap do |hash|

## gist:1232151
Topic
- [ ] Code Katas
	- [ ] Find all the unique sequences of digits, like [1, 1, 2, 3, 8] that have the following properties:
			Each element of the sequence is a digit between 1 and 9
			The digits add to 15
			There is at least digit that appears exactly twice
			No digit appears more than twice
			Order is irrelevant [1, 1, 2, 3, 8] and [1, 3, 2, 1, 8] are the same sequence and only count once.
	I believe the original problem did specify that there are 38 sequences that match.
	- [ ] Bowling Scores

## subsets.rb
require 'benchmark'
require 'test/unit'

class Array

  def map_with_index
    ary = []
    each_with_index { |elt, i| ary << yield(elt, i) }
    ary
  end

## gist:1265415
select:
  applicants:
    - cas_id
    - last_name
    - first_name
  designations:
    - date_locked
  statuses:
    - name
join:

## gist:1389177
class Object

  def truthy
    self && yield
    self
  end

  def falsy
    self || yield
    self

## gist:1730601
[core]
        repositoryformatversion = 0
        filemode = true
        bare = false
        logallrefupdates = true
[remote "origin"]
        fetch = +refs/heads/*:refs/remotes/origin/*
        url = git@git.amsapps.com:cpi2.git
[branch "master"]
        remote = origin

## scoping in Ruby
def foo
  1
end

def meth(arg)
  "Arg = #{ arg }"
end

def same_line
  foo = meth foo

## psr.rb
def evaluate_game(game)
  "PSRP"[ "#{ game[0][1] }#{ game[1][1] }" ] ? game[1] : game[0]
end

def report_game(game)
  puts "#{ game[0][0] } vs. #{ game[1][0] }"
  puts "\tWinner = #{ evaluate_game(game)[0] }\n\n"
end

paper1    = [ "Papa Err",   "P" ]

## index.html
<!DOCTYPE html>
<head>
	<title>and my axe</title>
	<style type="text/css">
		* { text-align: center; }
		a {
			text-decoration: none;
			color: #000;
		}
		h1 {

## send_key_path.rb
class Object

  def send_key_path(key_path)
    key_path.inject(self) { |current, method| current.send(method) }
  end

end

class Foo
  def bar
	class Array

	def hashify
	Hash.new.tap do \|hash\|
	each { \|obj\| hash[obj] = yield(obj) }
	end
	end

	def reverse_hashify
	Hash.new.tap do \|hash\|
	Topic
	- [ ] Code Katas
	- [ ] Find all the unique sequences of digits, like [1, 1, 2, 3, 8] that have the following properties:
	Each element of the sequence is a digit between 1 and 9
	The digits add to 15
	There is at least digit that appears exactly twice
	No digit appears more than twice
	Order is irrelevant [1, 1, 2, 3, 8] and [1, 3, 2, 1, 8] are the same sequence and only count once.
	I believe the original problem did specify that there are 38 sequences that match.
	- [ ] Bowling Scores
	require 'benchmark'
	require 'test/unit'

	class Array

	def map_with_index
	ary = []
	each_with_index { \|elt, i\| ary << yield(elt, i) }
	ary
	end
	select:
	applicants:
	- cas_id
	- last_name
	- first_name
	designations:
	- date_locked
	statuses:
	- name
	join:
	class Object

	def truthy
	self && yield
	self
	end

	def falsy
	self \|\| yield
	self
	[core]
	repositoryformatversion = 0
	filemode = true
	bare = false
	logallrefupdates = true
	[remote "origin"]
	fetch = +refs/heads/:refs/remotes/origin/
	url = git@git.amsapps.com:cpi2.git
	[branch "master"]
	remote = origin
	def foo
	1
	end

	def meth(arg)
	"Arg = #{ arg }"
	end

	def same_line
	foo = meth foo
	def evaluate_game(game)
	"PSRP"[ "#{ game[0][1] }#{ game[1][1] }" ] ? game[1] : game[0]
	end

	def report_game(game)
	puts "#{ game[0][0] } vs. #{ game[1][0] }"
	puts "\tWinner = #{ evaluate_game(game)[0] }\n\n"
	end

	paper1 = [ "Papa Err", "P" ]
	<!DOCTYPE html>
	<head>
	<title>and my axe</title>
	<style type="text/css">
	* { text-align: center; }
	a {
	text-decoration: none;
	color: #000;
	}
	h1 {
	class Object

	def send_key_path(key_path)
	key_path.inject(self) { \|current, method\| current.send(method) }
	end

	end

	class Foo
	def bar