php2go/vendor/github.com/z7zmey/php-parser/node/stmt/n_class.go

111 lines
2.4 KiB
Go
Raw Normal View History

package stmt
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"
)
// Class node
type Class struct {
FreeFloating freefloating.Collection
Position *position.Position
PhpDocComment string
ClassName node.Node
Modifiers []node.Node
ArgumentList *node.ArgumentList
Extends *ClassExtends
Implements *ClassImplements
Stmts []node.Node
}
// NewClass node constructor
func NewClass(ClassName node.Node, Modifiers []node.Node, ArgumentList *node.ArgumentList, Extends *ClassExtends, Implements *ClassImplements, Stmts []node.Node, PhpDocComment string) *Class {
return &Class{
FreeFloating: nil,
PhpDocComment: PhpDocComment,
ClassName: ClassName,
Modifiers: Modifiers,
ArgumentList: ArgumentList,
Extends: Extends,
Implements: Implements,
Stmts: Stmts,
}
}
// SetPosition sets node position
func (n *Class) SetPosition(p *position.Position) {
n.Position = p
}
// GetPosition returns node positions
func (n *Class) GetPosition() *position.Position {
return n.Position
}
func (n *Class) GetFreeFloating() *freefloating.Collection {
return &n.FreeFloating
}
// Attributes returns node attributes as map
func (n *Class) Attributes() map[string]interface{} {
return map[string]interface{}{
"PhpDocComment": n.PhpDocComment,
}
}
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Class) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}
if n.ClassName != nil {
v.EnterChildNode("ClassName", n)
n.ClassName.Walk(v)
v.LeaveChildNode("ClassName", n)
}
if n.Modifiers != nil {
v.EnterChildList("Modifiers", n)
for _, nn := range n.Modifiers {
if nn != nil {
nn.Walk(v)
}
}
v.LeaveChildList("Modifiers", n)
}
if n.ArgumentList != nil {
v.EnterChildNode("ArgumentList", n)
n.ArgumentList.Walk(v)
v.LeaveChildNode("ArgumentList", n)
}
if n.Extends != nil {
v.EnterChildNode("Extends", n)
n.Extends.Walk(v)
v.LeaveChildNode("Extends", n)
}
if n.Implements != nil {
v.EnterChildNode("Implements", n)
n.Implements.Walk(v)
v.LeaveChildNode("Implements", n)
}
if n.Stmts != nil {
v.EnterChildList("Stmts", n)
for _, nn := range n.Stmts {
if nn != nil {
nn.Walk(v)
}
}
v.LeaveChildList("Stmts", n)
}
v.LeaveNode(n)
}