Class: Stupidedi::Schema::LoopDef

Inherits:
AbstractDef show all
Includes:
Inspect
Defined in:
lib/stupidedi/schema/loop_def.rb

Overview

See Also:

  • 2.2.2 Loops
  • B.1.3.12.4 Loops of Data Segments

Instance Attribute Summary collapse

Constructors collapse

Instance Method Summary collapse

Methods included from Inspect

#inspect

Methods inherited from AbstractDef

#component?, #composite?, #definition?, #element?, #functional_group?, #interchange?, #repeated?, #segment?, #simple?, #table?, #transaction_set?, #usage?

Constructor Details

#initialize(id, repeat_count, header_segment_uses, loop_defs, trailer_segment_uses, parent) ⇒ LoopDef

Returns a new instance of LoopDef.



35
36
37
38
39
40
41
42
43
44
45
46
 
# File 'lib/stupidedi/schema/loop_def.rb', line 35

def initialize(id, repeat_count, header_segment_uses, loop_defs, trailer_segment_uses, parent)
  @id, @repeat_count, @header_segment_uses, @loop_defs, @trailer_segment_uses, @parent =
    id, repeat_count, header_segment_uses, loop_defs, trailer_segment_uses, parent

  # Delay re-parenting until the entire definition tree has a root
  # to prevent unnecessarily copying objects
  unless parent.nil?
    @header_segment_uses  = @header_segment_uses.map{|x| x.copy(:parent => self) }
    @loop_defs            = @loop_defs.map{|x| x.copy(:parent => self) }
    @trailer_segment_uses = @trailer_segment_uses.map{|x| x.copy(:parent => self) }
  end
end

Instance Attribute Details

#header_segment_uses ⇒ Array<SegmentUse> (readonly)

Returns:



20
21
22
 
# File 'lib/stupidedi/schema/loop_def.rb', line 20

def header_segment_uses
  @header_segment_uses
end

#id ⇒ String (readonly)

Returns:

  • (String) 


14
15
16
 
# File 'lib/stupidedi/schema/loop_def.rb', line 14

def id
  @id
end

#loop_defs ⇒ Array<LoopDef> (readonly)

Returns:



26
27
28
 
# File 'lib/stupidedi/schema/loop_def.rb', line 26

def loop_defs
  @loop_defs
end

#parent ⇒ LoopDef, TableDef (readonly)

Returns:



29
30
31
 
# File 'lib/stupidedi/schema/loop_def.rb', line 29

def parent
  @parent
end

#repeat_count ⇒ RepeatCount (readonly)

Returns:



17
18
19
 
# File 'lib/stupidedi/schema/loop_def.rb', line 17

def repeat_count
  @repeat_count
end

#trailer_segment_uses ⇒ Array<SegmentUse> (readonly)

Returns:



23
24
25
 
# File 'lib/stupidedi/schema/loop_def.rb', line 23

def trailer_segment_uses
  @trailer_segment_uses
end

Class Method Details

.build(id, repeat_count, *children) ⇒ LoopDef

Returns:



134
135
136
137
138
139
140
141
142
143
144
145
146
147
 
# File 'lib/stupidedi/schema/loop_def.rb', line 134

def build(id, repeat_count, *children)
  header, children   = children.split_when{|x| x.is_a?(LoopDef) }
  loop_defs, trailer = children.split_when{|x| x.is_a?(SegmentUse) }

  # @todo: Ensure there is at least one SegmentUse in header
  if header.empty?
    raise Exceptions::InvalidSchemaError,
      "first child must be a SegmentUse"
  elsif header.head.repeat_count.include?(2)
    "first child must have RepeatCount.bounded(1)"
  end

  new(id, repeat_count, header, loop_defs, trailer, nil)
end

Instance Method Details

#bounded? ⇒ Boolean

Returns:

  • (Boolean)

See Also:

  • B.1.1.3.11.1 Loop Control Segments
  • B.1.1.3.12.4 Loops of Data Segments Bounded Loops


65
66
67
68
 
# File 'lib/stupidedi/schema/loop_def.rb', line 65

def bounded?
  @header_segment_uses.head.definition.id == :LS and
  @trailer_segment_uses.last.definition.id == :LE
end

#children ⇒ Array<SegmentUse, LoopDef>

Returns:



81
82
83
 
# File 'lib/stupidedi/schema/loop_def.rb', line 81

def children
  @header_segment_uses + @loop_defs + @trailer_segment_uses
end

#code_lists ⇒ AbstractSet<CodeList>

Returns:



95
96
97
 
# File 'lib/stupidedi/schema/loop_def.rb', line 95

def code_lists
  children.map(&:code_lists).inject(&:|)
end

#copy(changes = {}) ⇒ LoopDef

Returns:



49
50
51
52
53
54
55
56
57
 
# File 'lib/stupidedi/schema/loop_def.rb', line 49

def copy(changes = {})
  LoopDef.new \
    changes.fetch(:id, @id),
    changes.fetch(:repeat_count, @repeat_count),
    changes.fetch(:header_segment_uses, @header_segment_uses),
    changes.fetch(:loop_defs, @loop_defs),
    changes.fetch(:trailer_segment_uses, @trailer_segment_uses),
    changes.fetch(:parent, @parent)
end

#empty ⇒ LoopVal

Returns:

  • (LoopVal) 


86
87
88
 
# File 'lib/stupidedi/schema/loop_def.rb', line 86

def empty
  Values::LoopVal.new(self, [])
end

#entry_segment_use ⇒ SegmentUse

Returns:



76
77
78
 
# File 'lib/stupidedi/schema/loop_def.rb', line 76

def entry_segment_use
  @header_segment_uses.head
end

#hierarchical? ⇒ Boolean

Returns:

  • (Boolean)

See Also:

  • 5.6 HL-initiated Loop


71
72
73
 
# File 'lib/stupidedi/schema/loop_def.rb', line 71

def hierarchical?
  @header_segment_uses.head.definition.id == :HL
end

#loop? ⇒ Boolean

Returns:

  • (Boolean) 


90
91
92
 
# File 'lib/stupidedi/schema/loop_def.rb', line 90

def loop?
  true
end

#pretty_print(q) ⇒ void

This method returns an undefined value.



100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
 
# File 'lib/stupidedi/schema/loop_def.rb', line 100

def pretty_print(q)
  q.text("LoopDef[#{@id}]")
  q.group(2, "(", ")") do
    q.breakable ""
    @header_segment_uses.each do |e|
      unless q.current_group.first?
        q.text ","
        q.breakable
      end
      q.pp e
    end
    @loop_defs.each do |e|
      unless q.current_group.first?
        q.text ","
        q.breakable
      end
      q.pp e
    end
    @trailer_segment_uses.each do |e|
      unless q.current_group.first?
        q.text ","
        q.breakable
      end
      q.pp e
    end
  end
end

#repeatable? ⇒ Boolean

Returns:

  • (Boolean) 


59
60
61
 
# File 'lib/stupidedi/schema/loop_def.rb', line 59

def repeatable?
  @repeat_count.try{|r| r.include?(2) }
end