php-parser/node/stmt/n_case_list.go

62 lines
1.2 KiB
Go
Raw Normal View History

2018-04-29 20:10:56 +00:00
package stmt
import (
"github.com/z7zmey/php-parser/meta"
2018-04-29 20:10:56 +00:00
"github.com/z7zmey/php-parser/node"
2018-06-24 07:19:44 +00:00
"github.com/z7zmey/php-parser/position"
2018-04-29 20:10:56 +00:00
"github.com/z7zmey/php-parser/walker"
)
// CaseList node
type CaseList struct {
Meta meta.Collection
2018-06-24 07:19:44 +00:00
Position *position.Position
Cases []node.Node
2018-04-29 20:10:56 +00:00
}
// NewCaseList node constructor
func NewCaseList(Cases []node.Node) *CaseList {
return &CaseList{
2018-06-24 07:19:44 +00:00
Cases: Cases,
2018-04-29 20:10:56 +00:00
}
}
2018-06-24 07:19:44 +00:00
// SetPosition sets node position
func (n *CaseList) SetPosition(p *position.Position) {
n.Position = p
}
// GetPosition returns node positions
func (n *CaseList) GetPosition() *position.Position {
return n.Position
}
func (n *CaseList) GetMeta() *meta.Collection {
return &n.Meta
2018-06-25 12:38:31 +00:00
}
2018-04-29 20:10:56 +00:00
// Attributes returns node attributes as map
func (n *CaseList) Attributes() map[string]interface{} {
return nil
}
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *CaseList) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}
if n.Cases != nil {
2018-06-18 20:29:52 +00:00
v.EnterChildList("Cases", n)
2018-04-29 20:10:56 +00:00
for _, nn := range n.Cases {
if nn != nil {
2018-06-18 20:29:52 +00:00
nn.Walk(v)
2018-04-29 20:10:56 +00:00
}
}
2018-06-18 20:29:52 +00:00
v.LeaveChildList("Cases", n)
2018-04-29 20:10:56 +00:00
}
v.LeaveNode(n)
}