recursive_struct 0.0.6 → 0.0.7
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +8 -8
- data/.gitignore +1 -0
- data/README.md +4 -1
- data/lib/recursive_struct.rb +4 -12
- data/lib/recursive_struct/data.rb +2 -2
- data/lib/recursive_struct/version.rb +1 -1
- metadata +3 -3
checksums.yaml
CHANGED
@@ -1,15 +1,15 @@
|
|
1
1
|
---
|
2
2
|
!binary "U0hBMQ==":
|
3
3
|
metadata.gz: !binary |-
|
4
|
-
|
4
|
+
YWI4ZDczZmFhOTYxNWQ2Nzk5MTI3ZGNmMTkzMWQ2M2EwYjU4MzBmYw==
|
5
5
|
data.tar.gz: !binary |-
|
6
|
-
|
6
|
+
MzgxZTAyMTQyN2RiNWM4Y2Y4YWZiMTM4OTA4MWRjZDc5ZjRkNTJlMg==
|
7
7
|
SHA512:
|
8
8
|
metadata.gz: !binary |-
|
9
|
-
|
10
|
-
|
11
|
-
|
9
|
+
YjU1M2JhNjE1NGI2ZTM3YzZkNTY3NGVmZjQ0NWFmNmQ0MjJjNjE1MjllNGQ1
|
10
|
+
M2NjMWExNDM5NTE2NDc1YWQ0ZDVmNWVjYWYzZDg3ODM2MTRlMGJlZjIzMTJl
|
11
|
+
MWEyYWU5ZWFiYzA1ODgxODkwMTFjNTRiZTQ4OGQxMDk5MDNiY2Y=
|
12
12
|
data.tar.gz: !binary |-
|
13
|
-
|
14
|
-
|
15
|
-
|
13
|
+
NDUzYTRiN2FlNDAzYzkwZDc4NDU3OTIxNDQ1NGY4N2ZlNzVjMzZkMjJmNGEw
|
14
|
+
N2ViNGFkZDJjYTYzMDJmZWVlODdkYzMxMjY5NmJkNjlmZDdkNGMyMDc1ZjIy
|
15
|
+
YTJiNDc3MzJlOThmM2Q4OGVjMWFlZDhlNTFlMTg0NGUwNzA2MTk=
|
data/.gitignore
CHANGED
data/README.md
CHANGED
@@ -27,13 +27,16 @@ struct = RecursiveStruct.new(hash}
|
|
27
27
|
struct.a # #<RecursiveStruct @data={:b=>true}>
|
28
28
|
struct.a.b # true
|
29
29
|
struct.c # false
|
30
|
+
struct.d # nil
|
30
31
|
```
|
31
32
|
|
32
33
|
You can also use a setter for a method that doesn't exist. A getter and setter will be generated dynamically.
|
33
34
|
```
|
34
35
|
struct = RecursiveStruct.new
|
35
36
|
struct.a = true
|
36
|
-
struct
|
37
|
+
struct[:b] = true
|
38
|
+
struct.a # true
|
39
|
+
struct[:b] # true
|
37
40
|
```
|
38
41
|
|
39
42
|
If this value happens to be a hash, it will be wrapped in a RecursiveStruct.
|
data/lib/recursive_struct.rb
CHANGED
@@ -4,33 +4,25 @@ class RecursiveStruct
|
|
4
4
|
include RecursiveStruct::Data
|
5
5
|
|
6
6
|
def initialize(hash = nil)
|
7
|
-
if hash
|
8
|
-
hash.each do |key, value|
|
9
|
-
set_data(key, value)
|
10
|
-
end
|
11
|
-
end
|
7
|
+
hash.each { |key, value| set_data(key, value) } if hash
|
12
8
|
end
|
13
9
|
|
14
|
-
def method_missing(name, *args)
|
10
|
+
def method_missing(name, *args, &block)
|
15
11
|
key = name.to_s
|
16
12
|
|
17
13
|
if key.include?('=')
|
18
14
|
add_setter(key.chomp('='), *args)
|
19
15
|
elsif data.respond_to?(key)
|
20
|
-
send_data(key, *args)
|
16
|
+
send_data(key, *args, &block)
|
21
17
|
elsif args.length == 0
|
22
18
|
get_data(key)
|
23
19
|
else
|
24
|
-
super(name, *args)
|
20
|
+
super(name, *args, &block)
|
25
21
|
end
|
26
22
|
end
|
27
23
|
|
28
24
|
private
|
29
25
|
|
30
|
-
def process(value)
|
31
|
-
value.is_a?(Hash) ? self.class.new(value) : value
|
32
|
-
end
|
33
|
-
|
34
26
|
def add_setter(key, *args)
|
35
27
|
if key == '[]' && args.length == 2
|
36
28
|
set_data(args.first, args.last)
|
metadata
CHANGED
@@ -1,14 +1,14 @@
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
2
2
|
name: recursive_struct
|
3
3
|
version: !ruby/object:Gem::Version
|
4
|
-
version: 0.0.
|
4
|
+
version: 0.0.7
|
5
5
|
platform: ruby
|
6
6
|
authors:
|
7
7
|
- Phillip Boksz
|
8
8
|
autorequire:
|
9
9
|
bindir: bin
|
10
10
|
cert_chain: []
|
11
|
-
date: 2014-12-
|
11
|
+
date: 2014-12-15 00:00:00.000000000 Z
|
12
12
|
dependencies:
|
13
13
|
- !ruby/object:Gem::Dependency
|
14
14
|
name: bundler
|
@@ -106,7 +106,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
|
|
106
106
|
version: '0'
|
107
107
|
requirements: []
|
108
108
|
rubyforge_project:
|
109
|
-
rubygems_version: 2.4.
|
109
|
+
rubygems_version: 2.4.5
|
110
110
|
signing_key:
|
111
111
|
specification_version: 4
|
112
112
|
summary: A gem to create recursive structs similar to open struct.
|