Class: Hash
- Inherits:
-
Object
- Object
- Hash
- Defined in:
- lib/everythingrb/hash.rb
Overview
Extensions to Ruby’s core Hash class
Provides:
-
#to_struct, #to_ostruct, #to_istruct: Convert hashes to different structures
-
#join_map: Combine filter_map and join operations
-
#deep_freeze: Recursively freeze hash and contents
-
#transform_values.with_key: Transform values with access to keys
-
#transform, #transform!: Transform keys and values
-
#value_where, #values_where: Find values based on conditions
-
#rename_key, #rename_keys: Rename hash keys while preserving order
-
::new_nested_hash: Create automatically nesting hashes
Constant Summary collapse
- EMPTY_STRUCT =
This constant is part of a private API. You should avoid using this constant if possible, as it may be removed or be changed in the future.
A minimal empty struct for Ruby 3.2+ compatibility
Ruby 3.2 enforces stricter argument handling for Struct. This means trying to create a Struct from an empty Hash will result in an ArgumentError being raised. This is trying to keep a consistent experience with that version and newer versions.
Struct.new(:_).new(nil)
Class Method Summary collapse
-
.new_nested_hash(depth: nil) ⇒ Hash
Creates a new Hash that automatically initializes missing keys with nested hashes.
Instance Method Summary collapse
-
#deep_freeze ⇒ self
Recursively freezes self and all of its values.
-
#deep_transform_values(with_key: false) {|value, key| ... } ⇒ Hash, Enumerator
Recursively transforms all values in the hash and nested structures.
-
#deep_transform_values!(with_key: false) {|value, key| ... } ⇒ self, Enumerator
Recursively transforms all values in the hash and nested structures in place.
-
#join_map(join_with = "") {|key, value| ... } ⇒ String
Combines filter_map and join operations.
-
#og_deep_transform_values ⇒ Object
Allows calling original method.
-
#og_deep_transform_values! ⇒ Object
Allows calling original method.
-
#og_transform_values ⇒ Object
Allows calling original method.
-
#og_transform_values! ⇒ Object
Allows calling original method.
-
#rename_key(old_key, new_key) ⇒ Hash
Renames a key in the hash while preserving the original order of elements.
-
#rename_key!(old_key, new_key) ⇒ self
Renames a key in the hash in place while preserving the original order of elements.
-
#rename_key_unordered(old_key, new_key) ⇒ Hash
Renames a key in the hash without preserving element order (faster).
-
#rename_key_unordered!(old_key, new_key) ⇒ self
Renames a key in the hash in place without preserving element order (faster).
-
#rename_keys(**keys) ⇒ Hash
Renames multiple keys in the hash while preserving the original order of elements.
-
#rename_keys!(**keys) ⇒ self
Renames multiple keys in the hash in place while preserving the original order of elements.
-
#to_deep_h ⇒ Hash
Recursively converts all values that respond to #to_h.
-
#to_istruct ⇒ Data
Converts hash to an immutable Data structure.
-
#to_ostruct ⇒ OpenStruct
Converts hash to an OpenStruct recursively.
-
#to_struct ⇒ Struct
Converts hash to a Struct recursively.
-
#transform {|key, value| ... } ⇒ Hash, Enumerator
Transforms keys and values to create a new hash.
-
#transform! {|key, value| ... } ⇒ self, Enumerator
Transforms keys and values in place.
-
#transform_values(with_key: false) {|value, key| ... } ⇒ Hash, Enumerator
Returns a new hash with all values transformed by the block.
-
#transform_values!(with_key: false) {|value, key| ... } ⇒ self, Enumerator
Transforms all values in the hash in place.
-
#value_where {|key, value| ... } ⇒ Object, ...
Returns the first value where the key-value pair satisfies the given condition.
-
#values_where {|key, value| ... } ⇒ Array, Enumerator
Returns all values where the key-value pairs satisfy the given condition.
Class Method Details
.new_nested_hash(depth: nil) ⇒ Hash
While unlimited nesting is convenient, it can interfere with common Ruby patterns like ||= when initializing values at deep depths. Use the depth parameter to control this behavior.
Creates a new Hash that automatically initializes missing keys with nested hashes
This method creates a hash where any missing key access will automatically create another nested hash with the same behavior. You can control the nesting depth with the depth parameter.
71 72 73 74 75 76 77 78 79 80 81 82 |
# File 'lib/everythingrb/hash.rb', line 71 def self.new_nested_hash(depth: nil) new do |hash, key| next if depth == 0 hash[key] = if depth.nil? new_nested_hash else new_nested_hash(depth: depth - 1) end end end |
Instance Method Details
#deep_freeze ⇒ self
CAUTION: Be careful when freezing collections that contain class objects or singleton instances - this will freeze those classes/objects globally! Only use deep_freeze on pure data structures you want to make immutable.
Recursively freezes self and all of its values
249 250 251 252 |
# File 'lib/everythingrb/hash.rb', line 249 def deep_freeze each_value { |v| v.respond_to?(:deep_freeze) ? v.deep_freeze : v.freeze } freeze end |
#deep_transform_values(with_key: false) {|value, key| ... } ⇒ Hash, Enumerator
Recursively transforms all values in the hash and nested structures
Walks through the hash and all nested hashes/arrays and yields each non-hash and non-array value to the block, replacing it with the block’s return value.
368 369 370 371 372 373 374 375 376 |
# File 'lib/everythingrb/hash.rb', line 368 def deep_transform_values(with_key: false, &block) return to_enum(:deep_transform_values, with_key:) if block.nil? if with_key _deep_transform_values_with_key(self, nil, &block) else og_deep_transform_values(&block) end end |
#deep_transform_values!(with_key: false) {|value, key| ... } ⇒ self, Enumerator
Recursively transforms all values in the hash and nested structures in place
Same as #deep_transform_values but modifies the hash in place.
405 406 407 408 409 410 411 412 413 |
# File 'lib/everythingrb/hash.rb', line 405 def deep_transform_values!(with_key: false, &block) return to_enum(:deep_transform_values!, with_key:) if block.nil? if with_key _deep_transform_values_with_key!(self, nil, &block) else og_deep_transform_values!(&block) end end |
#join_map(join_with = "") {|key, value| ... } ⇒ String
Combines filter_map and join operations
103 104 105 106 107 |
# File 'lib/everythingrb/hash.rb', line 103 def join_map(join_with = "", &block) block = ->(kv_pair) { kv_pair.compact } if block.nil? filter_map(&block).join(join_with) end |
#og_deep_transform_values ⇒ Object
Allows calling original method. See below
337 |
# File 'lib/everythingrb/hash.rb', line 337 alias_method :og_deep_transform_values, :deep_transform_values |
#og_deep_transform_values! ⇒ Object
Allows calling original method. See below
340 |
# File 'lib/everythingrb/hash.rb', line 340 alias_method :og_deep_transform_values!, :deep_transform_values! |
#og_transform_values ⇒ Object
Allows calling original method. See below
255 |
# File 'lib/everythingrb/hash.rb', line 255 alias_method :og_transform_values, :transform_values |
#og_transform_values! ⇒ Object
Allows calling original method. See below
258 |
# File 'lib/everythingrb/hash.rb', line 258 alias_method :og_transform_values!, :transform_values! |
#rename_key(old_key, new_key) ⇒ Hash
Renames a key in the hash while preserving the original order of elements
556 557 558 |
# File 'lib/everythingrb/hash.rb', line 556 def rename_key(old_key, new_key) rename_keys(old_key => new_key) end |
#rename_key!(old_key, new_key) ⇒ self
Renames a key in the hash in place while preserving the original order of elements
573 574 575 |
# File 'lib/everythingrb/hash.rb', line 573 def rename_key!(old_key, new_key) rename_keys!(old_key => new_key) end |
#rename_key_unordered(old_key, new_key) ⇒ Hash
Renames a key in the hash without preserving element order (faster)
This method is significantly faster than #rename_key but does not guarantee that the order of elements in the hash will be preserved.
635 636 637 638 639 640 641 642 |
# File 'lib/everythingrb/hash.rb', line 635 def rename_key_unordered(old_key, new_key) # Fun thing I learned. For small hashes, using #except is 1.5x faster than using dup and delete. # But as the hash becomes larger, the performance improvements become diminished until they're roughly the same. # Neat! hash = except(old_key) hash[new_key] = self[old_key] hash end |
#rename_key_unordered!(old_key, new_key) ⇒ self
Renames a key in the hash in place without preserving element order (faster)
This method is significantly faster than #rename_key! but does not guarantee that the order of elements in the hash will be preserved.
660 661 662 663 |
# File 'lib/everythingrb/hash.rb', line 660 def rename_key_unordered!(old_key, new_key) self[new_key] = delete(old_key) self end |
#rename_keys(**keys) ⇒ Hash
Renames multiple keys in the hash while preserving the original order of elements
This method maintains the original order of all keys in the hash, renaming only the specified keys while keeping their positions unchanged.
591 592 593 594 595 596 |
# File 'lib/everythingrb/hash.rb', line 591 def rename_keys(**keys) # I tried multiple different ways to rename the key while preserving the order, this was the fastest transform_keys do |key| keys.key?(key) ? keys[key] : key end end |
#rename_keys!(**keys) ⇒ self
Renames multiple keys in the hash in place while preserving the original order of elements
This method maintains the original order of all keys in the hash, renaming only the specified keys while keeping their positions unchanged.
613 614 615 616 617 618 |
# File 'lib/everythingrb/hash.rb', line 613 def rename_keys!(**keys) # I tried multiple different ways to rename the key while preserving the order, this was the fastest transform_keys! do |key| keys.key?(key) ? keys[key] : key end end |
#to_deep_h ⇒ Hash
Recursively converts all values that respond to #to_h
Similar to #to_h but recursively traverses the Hash structure and calls #to_h on any object that responds to it. Useful for normalizing nested data structures and parsing nested JSON.
140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 |
# File 'lib/everythingrb/hash.rb', line 140 def to_deep_h transform_values do |value| case value when Hash value.to_deep_h when Array value.to_deep_h when String # If the string is not valid JSON, #to_deep_h will return `nil` value.to_deep_h || value else value.respond_to?(:to_h) ? value.to_h : value end end end |
#to_istruct ⇒ Data
Converts hash to an immutable Data structure
167 168 169 170 171 172 173 174 175 176 177 178 179 180 |
# File 'lib/everythingrb/hash.rb', line 167 def to_istruct recurse = lambda do |input| case input when Hash input.to_istruct when Array input.map(&recurse) else input end end Data.define(*keys.map(&:to_sym)).new(*values.map { |value| recurse.call(value) }) end |
#to_ostruct ⇒ OpenStruct
Converts hash to an OpenStruct recursively
221 222 223 224 225 226 227 228 229 230 231 232 233 234 |
# File 'lib/everythingrb/hash.rb', line 221 def to_ostruct recurse = lambda do |value| case value when Hash value.to_ostruct when Array value.map(&recurse) else value end end OpenStruct.new(**transform_values { |value| recurse.call(value) }) end |
#to_struct ⇒ Struct
Converts hash to a Struct recursively
193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 |
# File 'lib/everythingrb/hash.rb', line 193 def to_struct # For Ruby 3.2, it raises if you attempt to create a Struct with no keys return EMPTY_STRUCT if RUBY_VERSION.start_with?("3.2") && empty? recurse = lambda do |value| case value when Hash value.to_struct when Array value.map(&recurse) else value end end Struct.new(*keys.map(&:to_sym)).new(*values.map { |value| recurse.call(value) }) end |
#transform {|key, value| ... } ⇒ Hash, Enumerator
Transforms keys and values to create a new hash
465 466 467 468 469 |
# File 'lib/everythingrb/hash.rb', line 465 def transform(&block) return to_enum(:transform) if block.nil? to_h(&block) end |
#transform! {|key, value| ... } ⇒ self, Enumerator
Transforms keys and values in place
487 488 489 490 491 |
# File 'lib/everythingrb/hash.rb', line 487 def transform!(&block) return to_enum(:transform!) if block.nil? replace(transform(&block)) end |
#transform_values(with_key: false) {|value, key| ... } ⇒ Hash, Enumerator
Returns a new hash with all values transformed by the block
Enhances Ruby’s standard transform_values with key access capability.
283 284 285 286 287 288 289 290 291 292 293 |
# File 'lib/everythingrb/hash.rb', line 283 def transform_values(with_key: false, &block) return to_enum(:transform_values, with_key:) if block.nil? if with_key each_pair.with_object({}) do |(key, value), output| output[key] = block.call(value, key) end else og_transform_values(&block) end end |
#transform_values!(with_key: false) {|value, key| ... } ⇒ self, Enumerator
Transforms all values in the hash in place
Enhances Ruby’s standard transform_values! with key access capability.
322 323 324 325 326 327 328 329 330 331 332 |
# File 'lib/everythingrb/hash.rb', line 322 def transform_values!(with_key: false, &block) return to_enum(:transform_values!, with_key:) if block.nil? if with_key each_pair do |key, value| self[key] = block.call(value, key) end else og_transform_values!(&block) end end |
#value_where {|key, value| ... } ⇒ Object, ...
Returns the first value where the key-value pair satisfies the given condition
512 513 514 515 516 |
# File 'lib/everythingrb/hash.rb', line 512 def value_where(&block) return to_enum(:value_where) if block.nil? find(&block)&.last end |
#values_where {|key, value| ... } ⇒ Array, Enumerator
Returns all values where the key-value pairs satisfy the given condition
538 539 540 541 542 |
# File 'lib/everythingrb/hash.rb', line 538 def values_where(&block) return to_enum(:values_where) if block.nil? select(&block).values end |