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