easy_format 0.2.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
@@ -0,0 +1,7 @@
1
+ ---
2
+ SHA1:
3
+ metadata.gz: e5b9bc0ed74a7d7a5fd9afe9925f84e7347bc841
4
+ data.tar.gz: b084beea9c21fbf1bb2da066f2a2e1a173b35eb4
5
+ SHA512:
6
+ metadata.gz: 1e7080e208b155e62ef8b8cee042c0fd9850e1b164c18359de0f64cec008d7ffed548a0f520c03e4173e5db644cbc27d34d9bac1bb48936e71e0b2221de81a19
7
+ data.tar.gz: 335450487d9c182fe0e3d3fa8329ce9e2818796208ca1709b1978796ec11d94b16a1250bc11c50845f7515be2606251852d5168f96cc8e31ee12f34b64244be3
data/LICENSE ADDED
@@ -0,0 +1,201 @@
1
+ Apache License
2
+ Version 2.0, January 2004
3
+ http://www.apache.org/licenses/
4
+
5
+ TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
6
+
7
+ 1. Definitions.
8
+
9
+ "License" shall mean the terms and conditions for use, reproduction,
10
+ and distribution as defined by Sections 1 through 9 of this document.
11
+
12
+ "Licensor" shall mean the copyright owner or entity authorized by
13
+ the copyright owner that is granting the License.
14
+
15
+ "Legal Entity" shall mean the union of the acting entity and all
16
+ other entities that control, are controlled by, or are under common
17
+ control with that entity. For the purposes of this definition,
18
+ "control" means (i) the power, direct or indirect, to cause the
19
+ direction or management of such entity, whether by contract or
20
+ otherwise, or (ii) ownership of fifty percent (50%) or more of the
21
+ outstanding shares, or (iii) beneficial ownership of such entity.
22
+
23
+ "You" (or "Your") shall mean an individual or Legal Entity
24
+ exercising permissions granted by this License.
25
+
26
+ "Source" form shall mean the preferred form for making modifications,
27
+ including but not limited to software source code, documentation
28
+ source, and configuration files.
29
+
30
+ "Object" form shall mean any form resulting from mechanical
31
+ transformation or translation of a Source form, including but
32
+ not limited to compiled object code, generated documentation,
33
+ and conversions to other media types.
34
+
35
+ "Work" shall mean the work of authorship, whether in Source or
36
+ Object form, made available under the License, as indicated by a
37
+ copyright notice that is included in or attached to the work
38
+ (an example is provided in the Appendix below).
39
+
40
+ "Derivative Works" shall mean any work, whether in Source or Object
41
+ form, that is based on (or derived from) the Work and for which the
42
+ editorial revisions, annotations, elaborations, or other modifications
43
+ represent, as a whole, an original work of authorship. For the purposes
44
+ of this License, Derivative Works shall not include works that remain
45
+ separable from, or merely link (or bind by name) to the interfaces of,
46
+ the Work and Derivative Works thereof.
47
+
48
+ "Contribution" shall mean any work of authorship, including
49
+ the original version of the Work and any modifications or additions
50
+ to that Work or Derivative Works thereof, that is intentionally
51
+ submitted to Licensor for inclusion in the Work by the copyright owner
52
+ or by an individual or Legal Entity authorized to submit on behalf of
53
+ the copyright owner. For the purposes of this definition, "submitted"
54
+ means any form of electronic, verbal, or written communication sent
55
+ to the Licensor or its representatives, including but not limited to
56
+ communication on electronic mailing lists, source code control systems,
57
+ and issue tracking systems that are managed by, or on behalf of, the
58
+ Licensor for the purpose of discussing and improving the Work, but
59
+ excluding communication that is conspicuously marked or otherwise
60
+ designated in writing by the copyright owner as "Not a Contribution."
61
+
62
+ "Contributor" shall mean Licensor and any individual or Legal Entity
63
+ on behalf of whom a Contribution has been received by Licensor and
64
+ subsequently incorporated within the Work.
65
+
66
+ 2. Grant of Copyright License. Subject to the terms and conditions of
67
+ this License, each Contributor hereby grants to You a perpetual,
68
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
69
+ copyright license to reproduce, prepare Derivative Works of,
70
+ publicly display, publicly perform, sublicense, and distribute the
71
+ Work and such Derivative Works in Source or Object form.
72
+
73
+ 3. Grant of Patent License. Subject to the terms and conditions of
74
+ this License, each Contributor hereby grants to You a perpetual,
75
+ worldwide, non-exclusive, no-charge, royalty-free, irrevocable
76
+ (except as stated in this section) patent license to make, have made,
77
+ use, offer to sell, sell, import, and otherwise transfer the Work,
78
+ where such license applies only to those patent claims licensable
79
+ by such Contributor that are necessarily infringed by their
80
+ Contribution(s) alone or by combination of their Contribution(s)
81
+ with the Work to which such Contribution(s) was submitted. If You
82
+ institute patent litigation against any entity (including a
83
+ cross-claim or counterclaim in a lawsuit) alleging that the Work
84
+ or a Contribution incorporated within the Work constitutes direct
85
+ or contributory patent infringement, then any patent licenses
86
+ granted to You under this License for that Work shall terminate
87
+ as of the date such litigation is filed.
88
+
89
+ 4. Redistribution. You may reproduce and distribute copies of the
90
+ Work or Derivative Works thereof in any medium, with or without
91
+ modifications, and in Source or Object form, provided that You
92
+ meet the following conditions:
93
+
94
+ (a) You must give any other recipients of the Work or
95
+ Derivative Works a copy of this License; and
96
+
97
+ (b) You must cause any modified files to carry prominent notices
98
+ stating that You changed the files; and
99
+
100
+ (c) You must retain, in the Source form of any Derivative Works
101
+ that You distribute, all copyright, patent, trademark, and
102
+ attribution notices from the Source form of the Work,
103
+ excluding those notices that do not pertain to any part of
104
+ the Derivative Works; and
105
+
106
+ (d) If the Work includes a "NOTICE" text file as part of its
107
+ distribution, then any Derivative Works that You distribute must
108
+ include a readable copy of the attribution notices contained
109
+ within such NOTICE file, excluding those notices that do not
110
+ pertain to any part of the Derivative Works, in at least one
111
+ of the following places: within a NOTICE text file distributed
112
+ as part of the Derivative Works; within the Source form or
113
+ documentation, if provided along with the Derivative Works; or,
114
+ within a display generated by the Derivative Works, if and
115
+ wherever such third-party notices normally appear. The contents
116
+ of the NOTICE file are for informational purposes only and
117
+ do not modify the License. You may add Your own attribution
118
+ notices within Derivative Works that You distribute, alongside
119
+ or as an addendum to the NOTICE text from the Work, provided
120
+ that such additional attribution notices cannot be construed
121
+ as modifying the License.
122
+
123
+ You may add Your own copyright statement to Your modifications and
124
+ may provide additional or different license terms and conditions
125
+ for use, reproduction, or distribution of Your modifications, or
126
+ for any such Derivative Works as a whole, provided Your use,
127
+ reproduction, and distribution of the Work otherwise complies with
128
+ the conditions stated in this License.
129
+
130
+ 5. Submission of Contributions. Unless You explicitly state otherwise,
131
+ any Contribution intentionally submitted for inclusion in the Work
132
+ by You to the Licensor shall be under the terms and conditions of
133
+ this License, without any additional terms or conditions.
134
+ Notwithstanding the above, nothing herein shall supersede or modify
135
+ the terms of any separate license agreement you may have executed
136
+ with Licensor regarding such Contributions.
137
+
138
+ 6. Trademarks. This License does not grant permission to use the trade
139
+ names, trademarks, service marks, or product names of the Licensor,
140
+ except as required for reasonable and customary use in describing the
141
+ origin of the Work and reproducing the content of the NOTICE file.
142
+
143
+ 7. Disclaimer of Warranty. Unless required by applicable law or
144
+ agreed to in writing, Licensor provides the Work (and each
145
+ Contributor provides its Contributions) on an "AS IS" BASIS,
146
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
147
+ implied, including, without limitation, any warranties or conditions
148
+ of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
149
+ PARTICULAR PURPOSE. You are solely responsible for determining the
150
+ appropriateness of using or redistributing the Work and assume any
151
+ risks associated with Your exercise of permissions under this License.
152
+
153
+ 8. Limitation of Liability. In no event and under no legal theory,
154
+ whether in tort (including negligence), contract, or otherwise,
155
+ unless required by applicable law (such as deliberate and grossly
156
+ negligent acts) or agreed to in writing, shall any Contributor be
157
+ liable to You for damages, including any direct, indirect, special,
158
+ incidental, or consequential damages of any character arising as a
159
+ result of this License or out of the use or inability to use the
160
+ Work (including but not limited to damages for loss of goodwill,
161
+ work stoppage, computer failure or malfunction, or any and all
162
+ other commercial damages or losses), even if such Contributor
163
+ has been advised of the possibility of such damages.
164
+
165
+ 9. Accepting Warranty or Additional Liability. While redistributing
166
+ the Work or Derivative Works thereof, You may choose to offer,
167
+ and charge a fee for, acceptance of support, warranty, indemnity,
168
+ or other liability obligations and/or rights consistent with this
169
+ License. However, in accepting such obligations, You may act only
170
+ on Your own behalf and on Your sole responsibility, not on behalf
171
+ of any other Contributor, and only if You agree to indemnify,
172
+ defend, and hold each Contributor harmless for any liability
173
+ incurred by, or claims asserted against, such Contributor by reason
174
+ of your accepting any such warranty or additional liability.
175
+
176
+ END OF TERMS AND CONDITIONS
177
+
178
+ APPENDIX: How to apply the Apache License to your work.
179
+
180
+ To apply the Apache License to your work, attach the following
181
+ boilerplate notice, with the fields enclosed by brackets "[]"
182
+ replaced with your own identifying information. (Don't include
183
+ the brackets!) The text should be enclosed in the appropriate
184
+ comment syntax for the file format. We also recommend that a
185
+ file or class name and description of purpose be included on the
186
+ same "printed page" as the copyright notice for easier
187
+ identification within third-party archives.
188
+
189
+ Copyright [yyyy] [name of copyright owner]
190
+
191
+ Licensed under the Apache License, Version 2.0 (the "License");
192
+ you may not use this file except in compliance with the License.
193
+ You may obtain a copy of the License at
194
+
195
+ http://www.apache.org/licenses/LICENSE-2.0
196
+
197
+ Unless required by applicable law or agreed to in writing, software
198
+ distributed under the License is distributed on an "AS IS" BASIS,
199
+ WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
200
+ See the License for the specific language governing permissions and
201
+ limitations under the License.
@@ -0,0 +1,22 @@
1
+ #
2
+ # Author:: Alex Munoz (<amunoz951@gmail.com>)
3
+ # Copyright:: Copyright (c) 2020 Alex Munoz
4
+ # License:: Apache License, Version 2.0
5
+ #
6
+ # Licensed under the Apache License, Version 2.0 (the "License");
7
+ # you may not use this file except in compliance with the License.
8
+ # You may obtain a copy of the License at
9
+ #
10
+ # http://www.apache.org/licenses/LICENSE-2.0
11
+ #
12
+ # Unless required by applicable law or agreed to in writing, software
13
+ # distributed under the License is distributed on an "AS IS" BASIS,
14
+ # WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
15
+ # See the License for the specific language governing permissions and
16
+ # limitations under the License.
17
+
18
+ require 'time' # deprecated - Remove 11/01/2020
19
+ require_relative 'easy_format/data_type_helper' # deprecated - Remove 11/01/2020 along with corresponding files
20
+ require_relative 'easy_format/date_time' # deprecated - Remove 11/01/2020 along with corresponding files
21
+ require_relative 'easy_format/file_system'
22
+ require_relative 'easy_format/validation'
@@ -0,0 +1,175 @@
1
+ module EasyFormat
2
+ module_function
3
+
4
+ module Hash
5
+ module_function
6
+
7
+ def log_deprecation(namespace, method_name)
8
+ EasyIO.logger.warn "#{namespace}.#{method_name} is deprecated! Use Hashly.#{method_name} instead (require hashly)!"
9
+ end
10
+
11
+ def safe_value(hash, *keys)
12
+ EasyFormat::Hash.log_deprecation('EasyFormat::Hash', __method__)
13
+ return nil if hash.nil? || hash[keys.first].nil?
14
+ return hash[keys.first] if keys.length == 1 # return the value if we have reached the final key
15
+ safe_value(hash[keys.shift], *keys) # recurse until we have reached the final key
16
+ end
17
+
18
+ def stringify_all_keys(hash)
19
+ EasyFormat::Hash.log_deprecation('EasyFormat::Hash', __method__)
20
+ stringified_hash = {}
21
+ hash.each do |k, v|
22
+ stringified_hash[k.to_s] = v.is_a?(::Hash) ? stringify_all_keys(v) : v
23
+ end
24
+ stringified_hash
25
+ end
26
+
27
+ def symbolize_all_keys(hash)
28
+ EasyFormat::Hash.log_deprecation('EasyFormat::Hash', __method__)
29
+ symbolized_hash = {}
30
+ hash.each do |k, v|
31
+ symbolized_hash[k.to_sym] = v.is_a?(::Hash) ? symbolize_all_keys(v) : v
32
+ end
33
+ symbolized_hash
34
+ end
35
+
36
+ # Evaluates the block on every key pair recursively. If any block is truthy, the method returns true, otherwise, false.
37
+ def any?(hash, &block)
38
+ EasyFormat::Hash.log_deprecation('EasyFormat::Hash', __method__)
39
+ raise 'hash is a required argument' if hash.nil?
40
+ raise 'A block must be provided to this method to evaluate on each key pair. The evaluation occurs recursively. Block arguments: |k, v|' if block.nil?
41
+ hash.each do |k, v|
42
+ return true if yield(k, v)
43
+ return true if v.is_a?(::Hash) && any?(v, &block) # recurse
44
+ end
45
+ false
46
+ end
47
+
48
+ # Sorts by key recursively - optionally include sorting of arrays
49
+ def deep_sort(hash, include_arrays: true)
50
+ EasyFormat::Hash.log_deprecation('EasyFormat::Hash', __method__)
51
+ raise "argument must be of type Hash - Actual type: #{hash.class}" unless hash.is_a?(::Hash)
52
+ hash.each_with_object({}) do |(k, v), child_hash|
53
+ child_hash[k] = case v
54
+ when ::Hash
55
+ deep_sort(v)
56
+ when ::Array
57
+ include_arrays ? v.sort : v
58
+ else
59
+ v
60
+ end
61
+ end.sort.to_h
62
+ end
63
+ end
64
+
65
+ # Deep merge two structures
66
+ # boolean_or: use a boolean || operator on the base and override if they are not a Hash or Array
67
+ # Left outer join: Only merge keys that already exist in the base
68
+ def deep_merge(base, override, boolean_or: false, left_outer_join_depth: 0)
69
+ EasyFormat::Hash.log_deprecation('EasyFormat', __method__)
70
+ left_outer_join_depth -= 1 # decrement left_outer_join_depth for recursion
71
+ if base.nil?
72
+ return nil if left_outer_join_depth >= 0
73
+ return override.is_a?(Hash) ? override.dup : override
74
+ end
75
+
76
+ case override
77
+ when nil
78
+ base = base.dup if base.is_a?(Hash) # duplicate hash to avoid modification by reference issues
79
+ base # if override doesn't exist, simply return the existing value
80
+ when ::Hash
81
+ base = base.dup
82
+ override.each do |src_key, src_value|
83
+ next if base[src_key].nil? && left_outer_join_depth >= 0 # if this is a left outer join and the key does not exist in the base, skip it
84
+ base[src_key] = base[src_key] ? deep_merge(base[src_key], src_value, boolean_or: boolean_or, left_outer_join_depth: left_outer_join_depth) : src_value # Recurse if both are Hash
85
+ end
86
+ base
87
+ when ::Array
88
+ base |= override
89
+ base
90
+ when ::String, ::Integer, ::Time, ::TrueClass, ::FalseClass
91
+ boolean_or ? base || override : override
92
+ else
93
+ throw "Implementation for deep merge of type #{override.class} is missing."
94
+ end
95
+ end
96
+
97
+ # Identifies what keys in the comparison hash are missing from base hash.
98
+ # Optionally keep the values from the comparison hash, otherwise assigns the missing keys a value of :missing_key
99
+ def deep_diff_by_key(base, comparison, keep_values: false)
100
+ EasyFormat::Hash.log_deprecation('EasyFormat', __method__)
101
+ missing_keys = {}
102
+ if comparison.is_a?(::Hash)
103
+ compared_keys = base.is_a?(::Hash) ? comparison.keys - base.keys : comparison.keys # Determine what keys the comparison has that the base doesn't
104
+ compared_keys.each { |k| missing_keys[k] = keep_values ? comparison[k] : :missing_key } # Save the missing keys
105
+ comparison.each do |k, v|
106
+ missing_keys[k] = deep_diff_by_key(base[k], v, keep_values: keep_values) if v.is_a?(::Hash) # Recurse to find more missing keys if the hash goes deeper
107
+ end
108
+ end
109
+ missing_keys.reject { |_k, v| v.is_a?(::Hash) && v.empty? } # Remove any empty hashes as there were no missing keys in them
110
+ end
111
+
112
+ # Deep diff two structures
113
+ # For a hash, returns keys found in both hashes where the values don't match.
114
+ # If a key exists in the base, but NOT the comparison, it is NOT considered a difference so that it can be a one way comparison.
115
+ # For an array, returns an array with values found in the comparison array but not in the base array.
116
+ def deep_diff(base, comparison)
117
+ EasyFormat::Hash.log_deprecation('EasyFormat', __method__)
118
+ if base.nil? # if base is nil, entire comparison object is different
119
+ return comparison.is_a?(Hash) ? comparison.dup : comparison
120
+ end
121
+
122
+ case comparison
123
+ when nil
124
+ {}
125
+ when ::Hash
126
+ differing_values = {}
127
+ base = base.dup
128
+ comparison.each do |src_key, src_value|
129
+ difference = deep_diff(base[src_key], src_value)
130
+ differing_values[src_key] = difference unless difference == :no_diff
131
+ end
132
+ differing_values.reject { |_k, v| v.is_a?(::Hash) && v.empty? }
133
+ when ::Array
134
+ difference = comparison - base
135
+ difference.empty? ? :no_diff : difference
136
+ else
137
+ base == comparison ? :no_diff : comparison
138
+ end
139
+ end
140
+
141
+ # Reject hash keys however deep they are. Provide a block and if it evaluates to true for a given key/value pair, it will be rejected.
142
+ def deep_reject(hash, &block)
143
+ EasyFormat::Hash.log_deprecation('EasyFormat', __method__)
144
+ hash.each_with_object({}) do |(k, v), h|
145
+ next if yield(k, v) # reject the current key/value pair by skipping it if the block given evaluates to true
146
+ h[k] = v.is_a?(::Hash) ? deep_reject(v, &block) : v # recursively go up the hash tree or keep the value if it's not a hash.
147
+ end
148
+ end
149
+
150
+ # Deep diff two Hashes
151
+ # Remove any keys in the first hash also contained in the second hash
152
+ # If a key exists in the base, but NOT the comparison, it is kept.
153
+ def deep_reject_by_hash(base, comparison)
154
+ EasyFormat::Hash.log_deprecation('EasyFormat', __method__)
155
+ return nil if base.nil?
156
+
157
+ case comparison
158
+ when ::Hash
159
+ return base unless base.is_a?(::Hash) # if base is not a hash but the comparison is, return the base
160
+ base = base.dup
161
+ comparison.each do |src_key, src_value|
162
+ base[src_key] = deep_reject_by_hash(base[src_key], src_value) # recurse to the leaf
163
+ base[src_key] = nil if base[src_key].is_a?(::Hash) && base[src_key].empty? # set leaves to nil if they are empty hashes
164
+ end
165
+ base.reject { |_k, v| v.nil? } # reject any leaves that were set to nil
166
+ else # rubocop:disable Style/EmptyElse - for clarity
167
+ nil # drop the value if we have reached a leaf in the comparison hash
168
+ end
169
+ end
170
+
171
+ def reject_keys_with_nil_values(base)
172
+ EasyFormat::Hash.log_deprecation('EasyFormat', __method__)
173
+ deep_reject(base) { |_k, v| v.nil? }
174
+ end
175
+ end
@@ -0,0 +1,27 @@
1
+ module EasyFormat
2
+ module DateTime
3
+ module_function
4
+
5
+ def log_deprecation(namespace, method_name)
6
+ EasyIO.logger.warn "#{namespace}.#{method_name} is deprecated! Use EasyTime.#{method_name} instead (require 'easy_time')!"
7
+ end
8
+
9
+ def yyyymmdd(date = Time.now)
10
+ log_deprecation('EasyFormat::DateTime', __method__)
11
+ date = ::Time.parse(date) unless date.is_a?(Time)
12
+ date.strftime('%Y%m%d')
13
+ end
14
+
15
+ def hhmmss(time = Time.now)
16
+ log_deprecation('EasyFormat::DateTime', __method__)
17
+ time = ::Time.parse(time) unless time.is_a?(Time)
18
+ time.strftime('%H%M%S')
19
+ end
20
+
21
+ def yyyymmdd_hhmmss(date_and_time = Time.now)
22
+ log_deprecation('EasyFormat::DateTime', __method__)
23
+ date_and_time = ::Time.parse(date_and_time) unless date_and_time.is_a?(Time)
24
+ date_and_time.strftime('%Y%m%d_%H%M%S')
25
+ end
26
+ end
27
+ end
@@ -0,0 +1,18 @@
1
+ module EasyFormat
2
+ module File
3
+ module_function
4
+
5
+ def windows_friendly_name(name, type: :file) # type options: :file or :path
6
+ type == :file ? name.gsub(%r{[\x00/\\:\*\?\"<>\|]}, '_') : name.gsub(/[\x00\*\?\"<>\|]/, '_')
7
+ end
8
+ end
9
+
10
+ module Directory
11
+ module_function
12
+
13
+ def ensure_trailing_slash(directory)
14
+ return nil if directory.nil?
15
+ ::File.join(directory, '')
16
+ end
17
+ end
18
+ end
@@ -0,0 +1,15 @@
1
+ module EasyFormat
2
+ module_function
3
+
4
+ # Optional parameters should be an array of symbols or strings
5
+ # rubocop:disable Security/Eval
6
+ def validate_parameters(method, method_binding, optional_parameters = [])
7
+ method.parameters.each do |parameter|
8
+ parameter_name = parameter.last.to_s
9
+ next if optional_parameters.any? { |o| o.to_s.casecmp(parameter_name) == 0 }
10
+ parameter_value = eval(parameter_name, method_binding)
11
+ raise "#{parameter_name} is a required parameter for #{caller[2][/`.*'/][1..-2]}!" if parameter_value.nil? || (parameter_value.respond_to?(:empty?) && parameter_value.empty?)
12
+ end
13
+ end
14
+ # rubocop:enable Security/Eval
15
+ end
metadata ADDED
@@ -0,0 +1,51 @@
1
+ --- !ruby/object:Gem::Specification
2
+ name: easy_format
3
+ version: !ruby/object:Gem::Version
4
+ version: 0.2.0
5
+ platform: ruby
6
+ authors:
7
+ - Alex Munoz
8
+ autorequire:
9
+ bindir: bin
10
+ cert_chain: []
11
+ date: 2020-05-27 00:00:00.000000000 Z
12
+ dependencies: []
13
+ description:
14
+ email:
15
+ - amunoz951@gmail.com
16
+ executables: []
17
+ extensions: []
18
+ extra_rdoc_files: []
19
+ files:
20
+ - LICENSE
21
+ - lib/easy_format.rb
22
+ - lib/easy_format/data_type_helper.rb
23
+ - lib/easy_format/date_time.rb
24
+ - lib/easy_format/file_system.rb
25
+ - lib/easy_format/validation.rb
26
+ homepage: https://github.com/amunoz951/easy_format
27
+ licenses:
28
+ - Apache-2.0
29
+ metadata: {}
30
+ post_install_message:
31
+ rdoc_options: []
32
+ require_paths:
33
+ - lib
34
+ required_ruby_version: !ruby/object:Gem::Requirement
35
+ requirements:
36
+ - - ">="
37
+ - !ruby/object:Gem::Version
38
+ version: '2.3'
39
+ required_rubygems_version: !ruby/object:Gem::Requirement
40
+ requirements:
41
+ - - ">="
42
+ - !ruby/object:Gem::Version
43
+ version: '0'
44
+ requirements: []
45
+ rubyforge_project:
46
+ rubygems_version: 2.5.2.3
47
+ signing_key:
48
+ specification_version: 4
49
+ summary: Ruby library for ease of merging hashes recursively, conforming to OS filesystem
50
+ friendly names, and more.
51
+ test_files: []