62 lines
1.2 KiB
Go
62 lines
1.2 KiB
Go
package node
|
|
|
|
import (
|
|
"github.com/z7zmey/php-parser/freefloating"
|
|
"github.com/z7zmey/php-parser/position"
|
|
"github.com/z7zmey/php-parser/walker"
|
|
)
|
|
|
|
// ArgumentList node
|
|
type ArgumentList struct {
|
|
FreeFloating freefloating.Collection
|
|
Position *position.Position
|
|
Arguments []Node
|
|
}
|
|
|
|
// NewArgumentList node constructor
|
|
func NewArgumentList(Arguments []Node) *ArgumentList {
|
|
return &ArgumentList{
|
|
FreeFloating: nil,
|
|
Arguments: Arguments,
|
|
}
|
|
}
|
|
|
|
// SetPosition sets node position
|
|
func (n *ArgumentList) SetPosition(p *position.Position) {
|
|
n.Position = p
|
|
}
|
|
|
|
// GetPosition returns node positions
|
|
func (n *ArgumentList) GetPosition() *position.Position {
|
|
return n.Position
|
|
}
|
|
|
|
func (n *ArgumentList) GetFreeFloating() *freefloating.Collection {
|
|
return &n.FreeFloating
|
|
}
|
|
|
|
// Attributes returns node attributes as map
|
|
func (n *ArgumentList) Attributes() map[string]interface{} {
|
|
return nil
|
|
}
|
|
|
|
// Walk traverses nodes
|
|
// Walk is invoked recursively until v.EnterNode returns true
|
|
func (n *ArgumentList) Walk(v walker.Visitor) {
|
|
if v.EnterNode(n) == false {
|
|
return
|
|
}
|
|
|
|
if n.Arguments != nil {
|
|
v.EnterChildList("Arguments", n)
|
|
for _, nn := range n.Arguments {
|
|
if nn != nil {
|
|
nn.Walk(v)
|
|
}
|
|
}
|
|
v.LeaveChildList("Arguments", n)
|
|
}
|
|
|
|
v.LeaveNode(n)
|
|
}
|