hobo_support 2.0.0 → 2.0.1

data/VERSION

@@ -1 +1 @@
-2.0.0
+2.0.1

data/test/hobosupport.rdoctest

@@ -44,7 +44,7 @@ We have the "." operator to call methods on objects. These extensions introduce
     >> nil._?.length
     => nil
 
-When the receiver is nil, any method with any arguments will return nil.  You can use Ruby's || idiom to provide a different value when nil.
+When the receiver is nil, any method with any arguments will return nil.  You can use Ruby's `||` idiom to provide a different value when nil.
 
     >> expires = nil
     >> expires._?.to_s( :default ) || "never"
@@ -52,7 +52,7 @@ When the receiver is nil, any method with any arguments will return nil.  You ca
 
 Note that `_?` should *always* be followed by a method call.  It is not intended to store the intermediate result.  Don't do this!
 
-intermediate = nil._?
+    >> intermediate = nil._?
 
 ### `Object#try`
 
@@ -81,7 +81,7 @@ may use `try` to call a Rails 2.3 function that doesn't exist on Rails
 
     >> nil.try(:foo)
     => nil
-    >> nil.try {|p| "(not available"}
+    >> nil.try {|p| "(not available)"}
     >> "(not available)"
     >> "foo".try(:reverse)
-    >> "oof"
+    >> "oof"

data/test/hobosupport/enumerable.rdoctest

@@ -14,6 +14,12 @@ E.g. The length of the first word that starts with a capital letter
     >> %w(my name is Fred).map_and_find { |s| s.length if s =~ /^[A-Z]/ }
     => 4
 
+Usage with the `not_found` argument
+
+    >> %w(my name is not available).map_and_find('Foo') { |s| s.length if s =~ /^[A-Z]/ }
+    => "Foo" 
+
+
 ## `Enumerable#map_with_index`
 
 * `enum.map_with_index { |element, index| block }`
@@ -74,6 +80,7 @@ Shorthand for `reject` when you need to reject on a single method call.
 ## `Enumerable#drop_while`
 
 * `enum.drop_while { |element| block }`
+* `enum.drop_while! { |element| block }`
 
 Passes each element in turn to the block until the block returns false. Returns the remaining elements in a new array.
 
@@ -92,7 +99,7 @@ There is also a destructive version for arrays
 
 * `enum.take_while { |element| block }`
 
-Passes each element in turn to the block until the block returns false. Returns a new with the elements for which the block returned true
+Passes each element in turn to the block until the block returns false. Returns a new array with the elements for which the block returned true.
 
     >> %w(this is a nice example).take_while { |s| s.length > 1 }
     => ["this", "is"]

data/test/hobosupport/hash.rdoctest

@@ -13,7 +13,7 @@ This is the Hash version of `Enumerable#select`. i.e. a way to create a new hash
     >> {1=>2, 3=>4, 6=>5}.select_hash { |key, value| key < value }
     => {1=>2, 3=>4}
 
-You can also give a block that takes one argument, in which case the block is given the value only
+You can also give a block that takes one argument, in which case the block is given the value only.
 
     >> {1=>2, 3=>4, 6=>5}.select_hash { |value| value != 2 }
     => {3=>4, 6=>5}
@@ -24,12 +24,12 @@ You can also give a block that takes one argument, in which case the block is gi
 * `hash.map_hash { |key, value| block } => hash`
 * `hash.map_hash { |value| block } => hash`
 
-Applies a function to each *value* in a Hash, resulting in a new hash with the same keys but new values. The block is passed each key, value pair and should return the new value
+Applies a function to each *value* in a Hash, resulting in a new hash with the same keys but new values. The block is passed each key, value pair and should return the new value.
 
     >> {1=>2, 3=>4, 6=>5}.map_hash { |key, value| key < value }
     => {1=>true, 3=>true, 6=>false}
 
-You can also give a block which takes one argument, in which case only the value is passed in
+You can also give a block which takes one argument, in which case only the value is passed in.
 
     >> {1=>2, 3=>4, 6=>5}.map_hash { |value| value * 100 }
     => {1=>200, 3=>400, 6=>500 }
@@ -40,12 +40,12 @@ You can also give a block which takes one argument, in which case only the value
 * `hash.partition_hash(keys) => [hash1, hash2]`
 * `hash.partition_hash { |key, value| block } => hash`
 
-Returns an array of two hashes, the first with all the key/value pairs where the key was in passed Enumerable, the second with the remaining key/value pairs
+Returns an array of two hashes, the first with all the key/value pairs where the key was in passed Enumerable, the second with the remaining key/value pairs.
 
     >> {1=>2, 3=>4, 6=>5}.partition_hash([1, 3])
     => [{1=>2, 3=>4}, {6=>5}]
 
-When passed a block, each pair is passed to the block in turn. The result is two hashes, the first containing those pairs for which the block returned true, the second with the remaining pairs
+When passed a block, each pair is passed to the block in turn. The result is two hashes, the first containing those pairs for which the block returned true, the second with the remaining pairs.
 
     >> {1=>2, 3=>4, 6=>5}.partition_hash { |key, value| key < value }
     => [{1=>2, 3=>4}, {6=>5}]
@@ -54,7 +54,7 @@ When passed a block, each pair is passed to the block in turn. The result is two
 
 * `hash.recursive_update(hash2)`
 
-Like `#update` but where a sub-hash would overwrite another sub-hash, they are instead also merged, recursively
+Like `#update` but where a sub-hash would overwrite another sub-hash, they are instead also merged, recursively.
 
     >> h = { :a => 1, :b => { :x => 10 } }
     >> h.recursive_update({ :c => 3, :b => { :y => 20 } })
@@ -75,7 +75,7 @@ Returns a new hash, the left-hand-side hash with all pairs removed where the key
 
 * `hash & array => array`
 
-Returns a new array, the left hand side hash restricted to pairs where the key is present in the right-hand-side array
+Returns a new array, the left hand side hash restricted to pairs where the key is present in the right-hand-side array.
 
     >> {1=>2, 3=>4, 6=>5} & [1, 3]
     => {1=>2, 3=>4}
@@ -84,7 +84,7 @@ Returns a new array, the left hand side hash restricted to pairs where the key i
 
 * `hash | hash => hash`
 
-An alias for merge
+An alias for merge.
 
     >> {1 => 2} | {1 => 3, 2 => 4}
     => {1 => 3, 2 => 4}
@@ -103,16 +103,16 @@ Returns an array of values for the given keys. Useful for extracting a few optio
 
 * `hash.compact => hash`
 
-Returns a hash with the same items as the receiver except those where the value is nil
+Returns a hash with the same items as the receiver except those where the value is nil.
 
     >> {1=>'a', 2=>nil, 3=>'b'}.compact
     => {1=>'a', 3=>'b'}
 
-## `Hash#compact`
+## `Hash#compact!`
 
 * `hash.compact!`
 
-Removes every pair from the hash where the value is nil
+Removes every pair from the hash where the value is nil.
 
     >> h = {1=>'a', 2=>nil, 3=>'b'}
     >> h.compact!

data/test/hobosupport/metaid.rdoctest

@@ -7,10 +7,10 @@ Why the Luck Stiff's essential meta-programming additions to Object. These are p
 
 ## `Object#metaclass`
 
-Returns the "metaclass", "eigenclass" or "singleton class" of a given ruby Object
+Returns the "metaclass", "eigenclass" or "singleton class" of a given ruby Object.
 
     >> o = Object.new
-    >> def o.foo; ;123; end
+    >> def o.foo; 123; end
     >> o.foo
     => 123
     >> o.metaclass.method_defined?(:foo)

data/test/hobosupport/module.rdoctest

@@ -41,7 +41,7 @@ When a module is included in a class, it gets a callback on the `included` metho
     => "MY NAME IS C"
 
 
-## `Module#interiting_cattr_reader`
+## `Module#inheriting_cattr_reader`
 
 Declares a reader for an instance variable on the class. The attribute is looked up on the superclass if not defined on the receiving class. In other words, the superclass defines a default that subclasses can override. The declaration can also give a default, as shown here.
 
@@ -52,7 +52,7 @@ Declares a reader for an instance variable on the class. The attribute is looked
 
      class B < A; end
 
-`B` has the same nickname as its superclass `A`
+`B` has the same nickname as its superclass `A`.
 
     >> A.nickname
     => "Andy"

data/test/hobosupport/xss.rdoctest

@@ -4,7 +4,7 @@
     >> $:.unshift File.join(File.expand_path(File.dirname(__FILE__)), '../../../hobo_support/lib')
     >> require 'hobo_support'
 
-## safe_join
+## `safe_join`
 
 Version of Array#join that preserves html\_safe:
 
@@ -27,7 +27,6 @@ Version of Array#join that preserves html\_safe:
     >> ["<a>".html_safe, "<b>".html_safe].safe_join.html_safe?
     => true
 
-
     >> ["<a>", "<b>"].safe_join("<br>")
     => "&lt;a&gt;&lt;br&gt;&lt;b&gt;"
 

metadata

@@ -1,7 +1,7 @@
 --- !ruby/object:Gem::Specification
 name: hobo_support
 version: !ruby/object:Gem::Version
-  version: 2.0.0
+  version: 2.0.1
   prerelease: 
 platform: ruby
 authors:
@@ -9,7 +9,7 @@ authors:
 autorequire: 
 bindir: bin
 cert_chain: []
-date: 2013-02-27 00:00:00.000000000 Z
+date: 2013-06-23 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: rails
@@ -32,7 +32,7 @@ dependencies:
   requirement: !ruby/object:Gem::Requirement
     none: false
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
   type: :development
@@ -40,7 +40,7 @@ dependencies:
   version_requirements: !ruby/object:Gem::Requirement
     none: false
     requirements:
-    - - ! '>='
+    - - '>='
       - !ruby/object:Gem::Version
         version: '0'
 description: Core Ruby extensions from the Hobo project
@@ -100,18 +100,18 @@ require_paths:
 required_ruby_version: !ruby/object:Gem::Requirement
   none: false
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: '0'
 required_rubygems_version: !ruby/object:Gem::Requirement
   none: false
   requirements:
-  - - ! '>='
+  - - '>='
     - !ruby/object:Gem::Version
       version: 1.3.6
 requirements: []
 rubyforge_project: hobo
-rubygems_version: 1.8.24
+rubygems_version: 1.8.25
 signing_key: 
 specification_version: 3
 summary: Core Ruby extensions from the Hobo project