2017-12-07 18:15:48 +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-07 18:15:48 +02:00
|
|
|
)
|
|
|
|
|
2018-01-11 19:33:25 +02:00
|
|
|
// For node
|
2017-12-07 18:15:48 +02:00
|
|
|
type For struct {
|
2018-01-09 15:51:32 +02:00
|
|
|
Init []node.Node
|
|
|
|
Cond []node.Node
|
|
|
|
Loop []node.Node
|
|
|
|
Stmt node.Node
|
2017-12-07 18:15:48 +02:00
|
|
|
}
|
|
|
|
|
2018-04-05 12:04:28 +03:00
|
|
|
// NewFor node constructor
|
2018-01-08 21:18:09 +02:00
|
|
|
func NewFor(Init []node.Node, Cond []node.Node, Loop []node.Node, Stmt node.Node) *For {
|
2018-01-04 20:42:44 +02:00
|
|
|
return &For{
|
2018-01-04 23:26:04 +02:00
|
|
|
Init,
|
|
|
|
Cond,
|
|
|
|
Loop,
|
|
|
|
Stmt,
|
2017-12-07 18:15:48 +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 *For) 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 *For) 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-07 18:15:48 +02:00
|
|
|
|
2018-01-04 23:26:04 +02:00
|
|
|
if n.Init != nil {
|
2018-06-18 23:29:52 +03:00
|
|
|
v.EnterChildList("Init", n)
|
2018-01-04 23:26:04 +02:00
|
|
|
for _, nn := range n.Init {
|
2018-01-10 14:35:08 +02:00
|
|
|
if nn != nil {
|
2018-06-18 23:29:52 +03:00
|
|
|
nn.Walk(v)
|
2018-01-10 14:35:08 +02:00
|
|
|
}
|
2017-12-07 18:15:48 +02:00
|
|
|
}
|
2018-06-18 23:29:52 +03:00
|
|
|
v.LeaveChildList("Init", n)
|
2017-12-07 18:15:48 +02:00
|
|
|
}
|
|
|
|
|
2018-01-04 23:26:04 +02:00
|
|
|
if n.Cond != nil {
|
2018-06-18 23:29:52 +03:00
|
|
|
v.EnterChildList("Cond", n)
|
2018-01-04 23:26:04 +02:00
|
|
|
for _, nn := range n.Cond {
|
2018-01-10 14:35:08 +02:00
|
|
|
if nn != nil {
|
2018-06-18 23:29:52 +03:00
|
|
|
nn.Walk(v)
|
2018-01-10 14:35:08 +02:00
|
|
|
}
|
2017-12-07 18:15:48 +02:00
|
|
|
}
|
2018-06-18 23:29:52 +03:00
|
|
|
v.LeaveChildList("Cond", n)
|
2017-12-07 18:15:48 +02:00
|
|
|
}
|
|
|
|
|
2018-01-04 23:26:04 +02:00
|
|
|
if n.Loop != nil {
|
2018-06-18 23:29:52 +03:00
|
|
|
v.EnterChildList("Loop", n)
|
2018-01-04 23:26:04 +02:00
|
|
|
for _, nn := range n.Loop {
|
2018-01-10 14:35:08 +02:00
|
|
|
if nn != nil {
|
2018-06-18 23:29:52 +03:00
|
|
|
nn.Walk(v)
|
2018-01-10 14:35:08 +02:00
|
|
|
}
|
2017-12-07 18:15:48 +02:00
|
|
|
}
|
2018-06-18 23:29:52 +03:00
|
|
|
v.LeaveChildList("Loop", n)
|
2017-12-07 18:15:48 +02:00
|
|
|
}
|
|
|
|
|
2018-01-04 23:26:04 +02:00
|
|
|
if n.Stmt != nil {
|
2018-06-18 23:29:52 +03:00
|
|
|
v.EnterChildNode("Stmt", n)
|
|
|
|
n.Stmt.Walk(v)
|
|
|
|
v.LeaveChildNode("Stmt", n)
|
2017-12-07 18:15:48 +02:00
|
|
|
}
|
2017-12-28 13:36:27 +02:00
|
|
|
|
|
|
|
v.LeaveNode(n)
|
2017-12-07 18:15:48 +02:00
|
|
|
}
|