php-parser/node/n_argument_list.go

65 lines
1.2 KiB
Go
Raw Normal View History

2018-04-29 16:58:49 +00:00
package node
import (
"github.com/z7zmey/php-parser/meta"
2018-06-24 07:19:44 +00:00
"github.com/z7zmey/php-parser/position"
2018-04-29 16:58:49 +00:00
"github.com/z7zmey/php-parser/walker"
)
// ArgumentList node
type ArgumentList struct {
Meta []meta.Meta
2018-06-24 07:19:44 +00:00
Position *position.Position
2018-04-29 16:58:49 +00:00
Arguments []Node
}
// NewArgumentList node constructor
func NewArgumentList(Arguments []Node) *ArgumentList {
return &ArgumentList{
2018-06-24 07:19:44 +00:00
Arguments: Arguments,
2018-04-29 16:58:49 +00:00
}
}
2018-06-24 07:19:44 +00:00
// 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) AddMeta(m []meta.Meta) {
n.Meta = append(n.Meta, m...)
2018-06-25 12:38:31 +00:00
}
func (n *ArgumentList) GetMeta() []meta.Meta {
return n.Meta
2018-06-25 12:38:31 +00:00
}
2018-04-29 16:58:49 +00:00
// 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 {
2018-06-18 20:29:52 +00:00
v.EnterChildList("Arguments", n)
2018-04-29 16:58:49 +00:00
for _, nn := range n.Arguments {
if nn != nil {
2018-06-18 20:29:52 +00:00
nn.Walk(v)
2018-04-29 16:58:49 +00:00
}
}
2018-06-18 20:29:52 +00:00
v.LeaveChildList("Arguments", n)
2018-04-29 16:58:49 +00:00
}
v.LeaveNode(n)
}