summaryrefslogtreecommitdiffhomepage
path: root/mrbgems/mruby-struct/mrblib/struct.rb
blob: 2439e2a37702ae0d8ba35fd33d38c1a52e73526b (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
##
# Struct
#
# ISO 15.2.18
class Struct

  ##
  # Calls the given block for each element of +self+
  # and pass the respective element.
  #
  # ISO 15.2.18.4.4
  def each(&block)
    self.class.members.each{|field|
      block.call(self[field])
    }
    self
  end

  ##
  # Calls the given block for each element of +self+
  # and pass the name and value of the respective
  # element.
  #
  # ISO 15.2.18.4.5
  def each_pair(&block)
    self.class.members.each{|field|
      block.call(field.to_sym, self[field])
    }
    self
  end

  ##
  # Calls the given block for each element of +self+
  # and returns an array with all elements of which
  # block is not false.
  #
  # ISO 15.2.18.4.7
  def select(&block)
    ary = []
    self.class.members.each{|field|
      val = self[field]
      ary.push(val) if block.call(val)
    }
    ary
  end

  def _inspect(recur_list)
    return "#<struct #{self.class}:...>" if recur_list[self.object_id]
    recur_list[self.object_id] = true
    name = self.class.to_s
    if name[0] == "#"
      str = "#<struct "
    else
      str = "#<struct #{name} "
    end
    buf = []
    self.each_pair do |k,v|
      buf.push k.to_s + "=" + v._inspect(recur_list)
    end
    str + buf.join(", ") + ">"
  end

  ##
  # call-seq:
  #   struct.to_s      -> string
  #   struct.inspect   -> string
  #
  # Describe the contents of this struct in a string.
  #
  # 15.2.18.4.10(x)
  #
  def inspect
    self._inspect({})
  end

  ##
  # 15.2.18.4.11(x)
  #
  alias to_s inspect

  ##
  # call-seq:
  #   hsh.dig(key,...)                 -> object
  #
  # Extracts the nested value specified by the sequence of <i>key</i>
  # objects by calling +dig+ at each step, returning +nil+ if any
  # intermediate step is +nil+.
  #
  def dig(idx,*args)
    n = self[idx]
    if args.size > 0
      n&.dig(*args)
    else
      n
    end
  end
end