Sha256: a4cd5dca120937d6ff1ead0be96d62b390fbea0a166c832eabbc1372c8d575d6
Contents?: true
Size: 1.38 KB
Versions: 108
Compression:
Stored size: 1.38 KB
Contents
require 'active_support/core_ext/hash/indifferent_access'
class Hash
def ids
keys
end
# Only updates the common keys that exist in self
def update_common(hash)
each_key do |k|
self[k] = hash[k] if hash.key? k
end
end
# Boolean method to check if self and another hash have intersecting keys
def intersect?(hash)
(keys.to_set & hash.keys.to_set).empty? ? false : true
end
# Returns a hash containing the intersecting keys between self and another hash
def intersections(hash)
(keys.to_set & hash.keys.to_set).to_a
end
# Filter a hash by a key filter of various types
def filter(filter)
filtered_hash = {}
select_logic = case filter
when String then 'k[Regexp.new(filter)]'
when (Fixnum || Integer || Float || Numeric) then "k[Regexp.new('#{filter}')]"
when Regexp then 'k[filter]'
when Symbol then 'k == filter'
when NilClass then true
else true
end
# rubocop:disable UnusedBlockArgument
filtered_hash = select do |k, v|
[TrueClass, FalseClass].include?(select_logic.class) ? select_logic : !!eval(select_logic)
end
filtered_hash
end
# Returns the longest key as measured by String#length
def longest_key
keys.map(&:to_s).max_by(&:length)
end
# Returns the longest key as measured by String#length
def longest_value
values.map(&:to_s).max_by(&:length)
end
end
Version data entries
108 entries across 108 versions & 1 rubygems