56 lines
1.0 KiB
Go
56 lines
1.0 KiB
Go
package stmt
|
|
|
|
import (
|
|
"github.com/z7zmey/php-parser/node"
|
|
"github.com/z7zmey/php-parser/position"
|
|
"github.com/z7zmey/php-parser/walker"
|
|
)
|
|
|
|
// CaseList node
|
|
type CaseList struct {
|
|
Position *position.Position
|
|
Cases []node.Node
|
|
}
|
|
|
|
// NewCaseList node constructor
|
|
func NewCaseList(Cases []node.Node) *CaseList {
|
|
return &CaseList{
|
|
Cases: Cases,
|
|
}
|
|
}
|
|
|
|
// 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
|
|
}
|
|
|
|
// 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 {
|
|
v.EnterChildList("Cases", n)
|
|
for _, nn := range n.Cases {
|
|
if nn != nil {
|
|
nn.Walk(v)
|
|
}
|
|
}
|
|
v.LeaveChildList("Cases", n)
|
|
}
|
|
|
|
v.LeaveNode(n)
|
|
}
|