2017-12-06 14:15:32 +02:00
|
|
|
package stmt
|
|
|
|
|
|
|
|
import (
|
|
|
|
"github.com/z7zmey/php-parser/node"
|
2018-01-17 18:58:45 +02:00
|
|
|
"github.com/z7zmey/php-parser/walker"
|
2017-12-06 14:15:32 +02:00
|
|
|
)
|
|
|
|
|
2018-01-11 19:33:25 +02:00
|
|
|
// Case node
|
2017-12-06 14:15:32 +02:00
|
|
|
type Case struct {
|
2018-01-09 15:51:32 +02:00
|
|
|
Cond node.Node
|
|
|
|
Stmts []node.Node
|
2017-12-06 14:15:32 +02:00
|
|
|
}
|
|
|
|
|
2018-01-11 19:33:25 +02:00
|
|
|
// NewCase node constuctor
|
2018-01-08 21:18:09 +02:00
|
|
|
func NewCase(Cond node.Node, Stmts []node.Node) *Case {
|
2018-01-04 20:42:44 +02:00
|
|
|
return &Case{
|
2018-01-04 23:26:04 +02:00
|
|
|
Cond,
|
|
|
|
Stmts,
|
2017-12-06 14:15:32 +02:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-01-11 19:33:25 +02:00
|
|
|
// Attributes returns node attributes as map
|
2018-01-08 21:32:57 +02:00
|
|
|
func (n *Case) Attributes() map[string]interface{} {
|
2018-01-05 00:12:01 +02:00
|
|
|
return nil
|
2017-12-29 17:20:24 +02:00
|
|
|
}
|
|
|
|
|
2018-01-11 19:33:25 +02:00
|
|
|
// Walk traverses nodes
|
|
|
|
// Walk is invoked recursively until v.EnterNode returns true
|
2018-01-17 18:58:45 +02:00
|
|
|
func (n *Case) Walk(v walker.Visitor) {
|
2017-12-28 13:36:27 +02:00
|
|
|
if v.EnterNode(n) == false {
|
2017-12-28 01:23:32 +02:00
|
|
|
return
|
|
|
|
}
|
2017-12-06 16:25:20 +02:00
|
|
|
|
2018-01-04 23:26:04 +02:00
|
|
|
if n.Cond != nil {
|
|
|
|
vv := v.GetChildrenVisitor("Cond")
|
|
|
|
n.Cond.Walk(vv)
|
2017-12-28 01:23:32 +02:00
|
|
|
}
|
2017-12-06 16:25:20 +02:00
|
|
|
|
2018-01-04 23:26:04 +02:00
|
|
|
if n.Stmts != nil {
|
|
|
|
vv := v.GetChildrenVisitor("Stmts")
|
|
|
|
for _, nn := range n.Stmts {
|
2018-01-10 14:35:08 +02:00
|
|
|
if nn != nil {
|
|
|
|
nn.Walk(vv)
|
|
|
|
}
|
2017-12-06 16:25:20 +02:00
|
|
|
}
|
|
|
|
}
|
2017-12-28 13:36:27 +02:00
|
|
|
|
|
|
|
v.LeaveNode(n)
|
2017-12-06 14:15:32 +02:00
|
|
|
}
|