php-parser/node/stmt/n_for.go
2018-06-26 00:07:02 +03:00

101 lines
1.8 KiB
Go

package stmt
import (
"github.com/z7zmey/php-parser/comment"
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/position"
"github.com/z7zmey/php-parser/walker"
)
// For node
type For struct {
Comments []*comment.Comment
Position *position.Position
Init []node.Node
Cond []node.Node
Loop []node.Node
Stmt node.Node
}
// NewFor node constructor
func NewFor(Init []node.Node, Cond []node.Node, Loop []node.Node, Stmt node.Node) *For {
return &For{
Init: Init,
Cond: Cond,
Loop: Loop,
Stmt: Stmt,
}
}
// SetPosition sets node position
func (n *For) SetPosition(p *position.Position) {
n.Position = p
}
// GetPosition returns node positions
func (n *For) GetPosition() *position.Position {
return n.Position
}
func (n *For) AddComments(cc []*comment.Comment, tn comment.TokenName) {
for _, c := range cc {
c.SetTokenName(tn)
}
n.Comments = append(n.Comments, cc...)
}
func (n *For) GetComments() []*comment.Comment {
return n.Comments
}
// Attributes returns node attributes as map
func (n *For) Attributes() map[string]interface{} {
return nil
}
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *For) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}
if n.Init != nil {
v.EnterChildList("Init", n)
for _, nn := range n.Init {
if nn != nil {
nn.Walk(v)
}
}
v.LeaveChildList("Init", n)
}
if n.Cond != nil {
v.EnterChildList("Cond", n)
for _, nn := range n.Cond {
if nn != nil {
nn.Walk(v)
}
}
v.LeaveChildList("Cond", n)
}
if n.Loop != nil {
v.EnterChildList("Loop", n)
for _, nn := range n.Loop {
if nn != nil {
nn.Walk(v)
}
}
v.LeaveChildList("Loop", n)
}
if n.Stmt != nil {
v.EnterChildNode("Stmt", n)
n.Stmt.Walk(v)
v.LeaveChildNode("Stmt", n)
}
v.LeaveNode(n)
}