Module: Collapsium::RecursiveSort

Included in:
UberHash
Defined in:
lib/collapsium/recursive_sort.rb

Overview

Provides recursive sort functions for hashes.

Instance Method Summary collapse

Instance Method Details

#recursive_sort(&block) ⇒ Object

Same as #recursive_sort!, but returns a copy.



38
39
40
41
42
43
44
45
46
47
 
# File 'lib/collapsium/recursive_sort.rb', line 38

def recursive_sort(&block)
  ret = nil
  if respond_to?(:recursive_dup)
    ret = recursive_dup
  else
    ret = dup
  end
  ret.extend(RecursiveSort)
  return ret.recursive_sort!(&block)
end

#recursive_sort!(&block) ⇒ Object

Recursively sort a Hash by its keys. Without a block, this function will not be able to compare keys of different size.



17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
 
# File 'lib/collapsium/recursive_sort.rb', line 17

def recursive_sort!(&block)
  return keys.sort(&block).reduce(self) do |seed, key|
    # Delete (and later re-insert) value for ordering
    value = self[key]
    delete(key)

    # Recurse into Hash values
    if value.is_a?(Hash)
      value.extend(RecursiveSort)
      value.recursive_sort!(&block)
    end

    # re-insert value
    self[key] = value

    next seed
  end
end