hash_map 0.3.0 → 0.3.1

checksums.yaml

@@ -1,7 +1,7 @@
 ---
 SHA1:
-  metadata.gz: 94701f9bddaba8235a48d0340f4c900c0d73cf1a
-  data.tar.gz: 827a696b1b3194e1b83857795772cc4e78c4d7b0
+  metadata.gz: eecd42833f732acc06ac6bb480e914a2e4410f79
+  data.tar.gz: 6a52704178d7f42c5dce703ded69da6dd1e8be7e
 SHA512:
-  metadata.gz: 6507b7366edc76cb9f072c6eecab282a8abaf8e18759dbb77d54766f4546946eafee13491ba7b6137a74f54c289900ce7f1bb36ed38123b905a94a282926b216
-  data.tar.gz: 8897e48ef5d0272feb79db75fee7390bda74ed9287139c226022a802b3b81757d33178349669e05b2b009db333bb77985a4eecb4af396be1f258d23fd02ebad4
+  metadata.gz: 49a7ed40a89d7d78064eefe4d1e91d8efa4ce9b69e18ad0e012f1794922edbcb0da005f1e7580c8a61ea91bc384d9cb3717efa0b48e2fdbaf2568faa03598610
+  data.tar.gz: fe30f661e0fe6b52bb0e7bfa8930d4f70509e72a45287d83f89a59d4a5fb1949b7a3c08996122823135d869ff7f87ede894f34219220a456868db60fdd2761a0

data/README.md

@@ -1,4 +1,5 @@
 # HashMap
+[ ![Codeship Status for arturictus/hash_map](https://codeship.com/projects/5900adb0-7452-0133-84a1-52f3970f70f1/status?branch=master)](https://codeship.com/projects/117597)
 
 HashMap is a small library that allow you to map hashes with style :).
 It will remove from your code many of the ugly navigation inside hashes to
@@ -93,7 +94,7 @@ ProfileMapper.map(original)
 Enjoy!
 
 ### Examples:
-**no from needed**
+**No 'from' key needed:**
 ```ruby
 class Clever < HashMap::Base
   property :name # will get value from the key 'name'
@@ -101,16 +102,35 @@ class Clever < HashMap::Base
 end
 ```
 
-**properties**
+**Properties:**
 ```ruby
 class Properties < HashMap::Base
   properties :name, :address, :house
 end
 ```
+**Methods:**
 
-**blocks:**
+You can create your helpers in the mapper and call them inside the block
 
-If in **fron_child** block when you want to get the value with a block
+```ruby
+class Methods < HashMap::Base
+  property(:common_names) { names }
+  property(:date) { |original| parse_date original[:date] }
+  property(:class_name) { self.class.name } #=> "Methods"
+
+  def names
+    %w(John Morty)
+  end
+
+  def parse_date(date)
+    date.strftime('%H:%M')
+  end
+end
+```
+
+**Blocks:**
+
+In **from_child** block when you want to get the value with a block
 the value of the child and original will be yielded in this order: child, original
 
 ```ruby
@@ -148,6 +168,8 @@ Blocks.map(hash)
 
 ```
 
+
+
 ### Motivation
 I got bored of doing this:
 ```ruby

data/lib/hash_map.rb

@@ -1,4 +1,4 @@
-require "hash_map/version"
+require 'hash_map/version'
 require 'active_support/all'
 module HashMap
   def self.root

data/lib/hash_map/base.rb

@@ -1,5 +1,5 @@
 module HashMap
-  class Base < Struct.new(:original)
+  Base = Struct.new(:original) do
     include ToDSL
     delegate :[], to: :output
 
@@ -8,7 +8,7 @@ module HashMap
     end
 
     def mapper
-      @mapper ||= Mapper.new(original, self.class.attributes)
+      @mapper ||= Mapper.new(original, self)
     end
 
     def output

data/lib/hash_map/dsl.rb

@@ -27,12 +27,8 @@ module HashMap
       @attributes = []
     end
 
-    def attributes
-      @attributes
-    end
-
     def property(key, opts = {}, &block)
-      new_hash = {}.tap{ |h| h[:key] =  single_to_ary(key) }
+      new_hash = {}.tap { |h| h[:key] = single_to_ary(key) }
       new_hash[:proc] = block if block
       new_hash[:from] = generate_from(new_hash, opts)
       attributes << new_hash.merge!(opts.except(:from))
@@ -77,7 +73,7 @@ module HashMap
       from ? single_to_ary(from) : hash[:key].dup
     end
 
-    def _nested(key, opts = {}, &block)
+    def _nested(_key, _opts = {}, &block)
       klass = self.class.new
       klass.instance_exec(&block)
       klass.attributes.flatten

data/lib/hash_map/mapper.rb

@@ -1,14 +1,14 @@
 module HashMap
   class Mapper
-    attr_reader :original, :data_structure
-    def initialize(original, data_structure)
+    attr_reader :original, :hash_map
+    def initialize(original, hash_map)
       @original = HashWithIndifferentAccess.new(original)
-      @data_structure = data_structure
+      @hash_map = hash_map
     end
 
     def output
       new_hash = HashWithIndifferentAccess.new
-      data_structure.each do |struc|
+      hash_map.class.attributes.each do |struc|
         value = get_value(struc)
         new_hash.deep_merge! build_keys(struc[:key], value)
       end
@@ -19,10 +19,10 @@ module HashMap
 
     def get_value(struct)
       value = if struct[:proc]
-        execute_block(struct)
-      elsif struct[:from]
-        get_value_from_key(struct)
-      end
+                execute_block(struct)
+              elsif struct[:from]
+                get_value_from_key(struct)
+              end
       nil_to_default(value, struct)
     end
 
@@ -37,20 +37,20 @@ module HashMap
       block = struct[:proc]
       if struct[:from_child]
         nested = get_value_from_key(struct, :from_child)
-        block.call(nested, original)
+        hash_map.instance_exec nested, original, &block
       else
-        block.call(original, original)
+        hash_map.instance_exec original, original, &block
       end
     end
 
     def build_keys(ary, value)
       ary.reverse.inject(value) do |a, n|
-        HashWithIndifferentAccess.new({ n => a })
+        HashWithIndifferentAccess.new(n => a)
       end
     end
 
     def nil_to_default(value, struct)
-      value || struct[:default]
+      value.nil? ? struct[:default] : value
     end
   end
 end

data/lib/hash_map/version.rb

@@ -1,3 +1,3 @@
 module HashMap
-  VERSION = "0.3.0"
+  VERSION = "0.3.1"
 end

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: hash_map
 version: !ruby/object:Gem::Version
-  version: 0.3.0
+  version: 0.3.1
 platform: ruby
 authors:
 - Artur Pañach
 autorequire: 
 bindir: exe
 cert_chain: []
-date: 2015-11-19 00:00:00.000000000 Z
+date: 2015-11-23 00:00:00.000000000 Z
 dependencies:
 - !ruby/object:Gem::Dependency
   name: bundler