50 lines
853 B
Go
50 lines
853 B
Go
package expr
|
|
|
|
import (
|
|
"github.com/z7zmey/php-parser/node"
|
|
"github.com/z7zmey/php-parser/walker"
|
|
)
|
|
|
|
// ArrayItem node
|
|
type ArrayItem struct {
|
|
ByRef bool
|
|
Key node.Node
|
|
Val node.Node
|
|
}
|
|
|
|
// NewArrayItem node constructor
|
|
func NewArrayItem(Key node.Node, Val node.Node, ByRef bool) *ArrayItem {
|
|
return &ArrayItem{
|
|
ByRef,
|
|
Key,
|
|
Val,
|
|
}
|
|
}
|
|
|
|
// Attributes returns node attributes as map
|
|
func (n *ArrayItem) 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 *ArrayItem) Walk(v walker.Visitor) {
|
|
if v.EnterNode(n) == false {
|
|
return
|
|
}
|
|
|
|
if n.Key != nil {
|
|
vv := v.GetChildrenVisitor("Key")
|
|
n.Key.Walk(vv)
|
|
}
|
|
|
|
if n.Val != nil {
|
|
vv := v.GetChildrenVisitor("Val")
|
|
n.Val.Walk(vv)
|
|
}
|
|
|
|
v.LeaveNode(n)
|
|
}
|