2017-12-05 23:36:28 +02:00
|
|
|
package name
|
|
|
|
|
|
|
|
import (
|
|
|
|
"github.com/z7zmey/php-parser/node"
|
2018-01-17 18:58:45 +02:00
|
|
|
"github.com/z7zmey/php-parser/walker"
|
2017-12-05 23:36:28 +02:00
|
|
|
)
|
|
|
|
|
2018-01-11 19:33:25 +02:00
|
|
|
// Relative node
|
2017-12-05 23:36:28 +02:00
|
|
|
type Relative struct {
|
2018-01-12 09:14:11 +02:00
|
|
|
Parts []node.Node
|
2017-12-05 23:36:28 +02:00
|
|
|
}
|
|
|
|
|
2018-04-05 12:04:28 +03:00
|
|
|
// NewRelative node constructor
|
2018-01-08 21:18:09 +02:00
|
|
|
func NewRelative(Parts []node.Node) *Relative {
|
2018-01-04 20:42:44 +02:00
|
|
|
return &Relative{
|
2018-01-12 09:14:11 +02:00
|
|
|
Parts,
|
2017-12-05 23:36:28 +02:00
|
|
|
}
|
|
|
|
}
|
2018-01-12 09:14:11 +02: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 18:58:45 +02:00
|
|
|
func (n *Relative) Walk(v walker.Visitor) {
|
2018-01-12 09:14:11 +02:00
|
|
|
if v.EnterNode(n) == false {
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
if n.Parts != nil {
|
|
|
|
vv := v.GetChildrenVisitor("Parts")
|
|
|
|
for _, nn := range n.Parts {
|
|
|
|
if nn != nil {
|
|
|
|
nn.Walk(vv)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
v.LeaveNode(n)
|
|
|
|
}
|
2018-02-27 15:09:40 +02:00
|
|
|
|
|
|
|
// GetParts returns the name parts
|
|
|
|
func (n *Relative) GetParts() []node.Node {
|
|
|
|
return n.Parts
|
|
|
|
}
|