php-parser/node/name/n_fully_qualified.go

67 lines
1.3 KiB
Go
Raw Normal View History

2017-12-05 23:36:28 +02:00
package name
import (
"github.com/z7zmey/php-parser/meta"
2017-12-05 23:36:28 +02:00
"github.com/z7zmey/php-parser/node"
2018-06-24 10:19:44 +03:00
"github.com/z7zmey/php-parser/position"
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
// FullyQualified node
2017-12-05 23:36:28 +02:00
type FullyQualified struct {
Meta meta.Collection
2018-06-24 10:19:44 +03:00
Position *position.Position
Parts []node.Node
2017-12-05 23:36:28 +02:00
}
2018-04-05 12:04:28 +03:00
// NewFullyQualified node constructor
2018-01-08 21:18:09 +02:00
func NewFullyQualified(Parts []node.Node) *FullyQualified {
2018-01-04 20:42:44 +02:00
return &FullyQualified{
2018-06-24 10:19:44 +03:00
Parts: Parts,
2017-12-05 23:36:28 +02:00
}
}
2018-01-12 09:14:11 +02:00
2018-06-24 10:19:44 +03:00
// SetPosition sets node position
func (n *FullyQualified) SetPosition(p *position.Position) {
n.Position = p
}
// GetPosition returns node positions
func (n *FullyQualified) GetPosition() *position.Position {
return n.Position
}
func (n *FullyQualified) GetMeta() *meta.Collection {
return &n.Meta
2018-06-25 15:38:31 +03:00
}
2018-01-12 09:14:11 +02:00
// Attributes returns node attributes as map
func (n *FullyQualified) 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 *FullyQualified) Walk(v walker.Visitor) {
2018-01-12 09:14:11 +02:00
if v.EnterNode(n) == false {
return
}
if n.Parts != nil {
2018-06-18 23:29:52 +03:00
v.EnterChildList("Parts", n)
2018-01-12 09:14:11 +02:00
for _, nn := range n.Parts {
if nn != nil {
2018-06-18 23:29:52 +03:00
nn.Walk(v)
2018-01-12 09:14:11 +02:00
}
}
2018-06-18 23:29:52 +03:00
v.LeaveChildList("Parts", n)
2018-01-12 09:14:11 +02:00
}
v.LeaveNode(n)
}
2018-02-27 15:09:40 +02:00
// GetParts returns the name parts
func (n *FullyQualified) GetParts() []node.Node {
return n.Parts
}