php-parser/node/name/n_relative.go

67 lines
1.2 KiB
Go
Raw Normal View History

2017-12-05 21:36:28 +00:00
package name
import (
"github.com/z7zmey/php-parser/meta"
2017-12-05 21:36:28 +00:00
"github.com/z7zmey/php-parser/node"
2018-06-24 07:19:44 +00:00
"github.com/z7zmey/php-parser/position"
2018-01-17 16:58:45 +00:00
"github.com/z7zmey/php-parser/walker"
2017-12-05 21:36:28 +00:00
)
2018-01-11 17:33:25 +00:00
// Relative node
2017-12-05 21:36:28 +00:00
type Relative struct {
Meta meta.Collection
2018-06-24 07:19:44 +00:00
Position *position.Position
Parts []node.Node
2017-12-05 21:36:28 +00:00
}
2018-04-05 09:04:28 +00:00
// NewRelative node constructor
2018-01-08 19:18:09 +00:00
func NewRelative(Parts []node.Node) *Relative {
2018-01-04 18:42:44 +00:00
return &Relative{
2018-06-24 07:19:44 +00:00
Parts: Parts,
2017-12-05 21:36:28 +00:00
}
}
2018-01-12 07:14:11 +00:00
2018-06-24 07:19:44 +00:00
// SetPosition sets node position
func (n *Relative) SetPosition(p *position.Position) {
n.Position = p
}
// GetPosition returns node positions
func (n *Relative) GetPosition() *position.Position {
return n.Position
}
func (n *Relative) GetMeta() *meta.Collection {
return &n.Meta
2018-06-25 12:38:31 +00:00
}
2018-01-12 07:14:11 +00:00
// Attributes returns node attributes as map
func (n *Relative) Attributes() map[string]interface{} {
return nil
}
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
2018-01-17 16:58:45 +00:00
func (n *Relative) Walk(v walker.Visitor) {
2018-01-12 07:14:11 +00:00
if v.EnterNode(n) == false {
return
}
if n.Parts != nil {
2018-06-18 20:29:52 +00:00
v.EnterChildList("Parts", n)
2018-01-12 07:14:11 +00:00
for _, nn := range n.Parts {
if nn != nil {
2018-06-18 20:29:52 +00:00
nn.Walk(v)
2018-01-12 07:14:11 +00:00
}
}
2018-06-18 20:29:52 +00:00
v.LeaveChildList("Parts", n)
2018-01-12 07:14:11 +00:00
}
v.LeaveNode(n)
}
2018-02-27 13:09:40 +00:00
// GetParts returns the name parts
func (n *Relative) GetParts() []node.Node {
return n.Parts
}