64 lines
1.1 KiB
Go
64 lines
1.1 KiB
Go
package stmt
|
|
|
|
import (
|
|
"github.com/z7zmey/php-parser/node"
|
|
"github.com/z7zmey/php-parser/walker"
|
|
)
|
|
|
|
// AltForeach node
|
|
type AltForeach struct {
|
|
ByRef bool
|
|
Expr node.Node
|
|
Key node.Node
|
|
Variable node.Node
|
|
Stmt node.Node
|
|
}
|
|
|
|
// NewAltForeach node constuctor
|
|
func NewAltForeach(Expr node.Node, Key node.Node, Variable node.Node, Stmt node.Node, ByRef bool) *AltForeach {
|
|
return &AltForeach{
|
|
ByRef,
|
|
Expr,
|
|
Key,
|
|
Variable,
|
|
Stmt,
|
|
}
|
|
}
|
|
|
|
// Attributes returns node attributes as map
|
|
func (n *AltForeach) Attributes() map[string]interface{} {
|
|
return map[string]interface{}{
|
|
"ByRef": n.ByRef,
|
|
}
|
|
}
|
|
|
|
// Walk traverses nodes
|
|
// Walk is invoked recursively until v.EnterNode returns true
|
|
func (n *AltForeach) Walk(v walker.Visitor) {
|
|
if v.EnterNode(n) == false {
|
|
return
|
|
}
|
|
|
|
if n.Expr != nil {
|
|
vv := v.GetChildrenVisitor("Expr")
|
|
n.Expr.Walk(vv)
|
|
}
|
|
|
|
if n.Key != nil {
|
|
vv := v.GetChildrenVisitor("Key")
|
|
n.Key.Walk(vv)
|
|
}
|
|
|
|
if n.Variable != nil {
|
|
vv := v.GetChildrenVisitor("Variable")
|
|
n.Variable.Walk(vv)
|
|
}
|
|
|
|
if n.Stmt != nil {
|
|
vv := v.GetChildrenVisitor("Stmt")
|
|
n.Stmt.Walk(vv)
|
|
}
|
|
|
|
v.LeaveNode(n)
|
|
}
|