2017-04-01 21:28:57 +03:00
|
|
|
module Vool
|
|
|
|
class Statements < Statement
|
2018-03-15 20:40:21 +05:30
|
|
|
attr_reader :statements
|
|
|
|
def initialize(statements)
|
|
|
|
@statements = statements
|
|
|
|
end
|
|
|
|
|
|
|
|
def empty?
|
|
|
|
@statements.empty?
|
|
|
|
end
|
|
|
|
def single?
|
|
|
|
@statements.length == 1
|
|
|
|
end
|
|
|
|
def first
|
|
|
|
@statements.first
|
|
|
|
end
|
|
|
|
def last
|
|
|
|
@statements.last
|
|
|
|
end
|
|
|
|
def length
|
|
|
|
@statements.length
|
|
|
|
end
|
|
|
|
def [](i)
|
|
|
|
@statements[i]
|
|
|
|
end
|
|
|
|
def <<(o)
|
|
|
|
@statements << o
|
|
|
|
self
|
|
|
|
end
|
2018-07-20 20:06:14 +03:00
|
|
|
def prepend(o)
|
|
|
|
@statements = [o] + @statements
|
|
|
|
end
|
2017-04-12 11:52:23 +03:00
|
|
|
|
2018-11-02 17:27:46 -07:00
|
|
|
# to_mom all the statements. Append subsequent ones to the first, and return the
|
|
|
|
# first.
|
|
|
|
#
|
|
|
|
# For ClassStatements this creates and returns a MomCompiler
|
|
|
|
#
|
2018-07-05 14:02:38 +03:00
|
|
|
def to_mom( compiler )
|
2018-06-29 23:29:10 +03:00
|
|
|
raise "Empty list ? #{statements.length}" if empty?
|
2018-06-30 19:20:17 +03:00
|
|
|
stats = @statements.dup
|
2018-11-02 17:27:46 -07:00
|
|
|
first = stats.shift.to_mom(compiler)
|
2018-06-30 19:20:17 +03:00
|
|
|
while( nekst = stats.shift )
|
2018-11-02 17:27:46 -07:00
|
|
|
first.append nekst.to_mom(compiler)
|
2018-03-15 20:33:38 +05:30
|
|
|
end
|
2018-11-02 17:27:46 -07:00
|
|
|
first
|
2017-04-08 12:10:42 +03:00
|
|
|
end
|
2017-04-09 10:14:28 +03:00
|
|
|
|
2018-03-15 17:22:56 +05:30
|
|
|
def each(&block)
|
|
|
|
block.call(self)
|
2018-03-15 20:40:21 +05:30
|
|
|
@statements.each{|a| a.each(&block)}
|
2018-03-15 17:22:56 +05:30
|
|
|
end
|
|
|
|
|
2018-07-03 22:18:19 +03:00
|
|
|
def to_s(depth = 0)
|
|
|
|
at_depth(depth , *@statements.collect{|st| st.to_s(depth)})
|
|
|
|
end
|
|
|
|
|
2017-04-02 13:24:09 +03:00
|
|
|
end
|
|
|
|
|
|
|
|
class ScopeStatement < Statements
|
2017-04-01 21:28:57 +03:00
|
|
|
end
|
|
|
|
end
|