62 lines
1.2 KiB
Go
62 lines
1.2 KiB
Go
package expr
|
|
|
|
import (
|
|
"github.com/z7zmey/php-parser/meta"
|
|
"github.com/z7zmey/php-parser/node"
|
|
"github.com/z7zmey/php-parser/position"
|
|
"github.com/z7zmey/php-parser/walker"
|
|
)
|
|
|
|
// ShortArray node
|
|
type ShortArray struct {
|
|
Meta meta.Collection
|
|
Position *position.Position
|
|
Items []node.Node
|
|
}
|
|
|
|
// NewShortArray node constructor
|
|
func NewShortArray(Items []node.Node) *ShortArray {
|
|
return &ShortArray{
|
|
Items: Items,
|
|
}
|
|
}
|
|
|
|
// SetPosition sets node position
|
|
func (n *ShortArray) SetPosition(p *position.Position) {
|
|
n.Position = p
|
|
}
|
|
|
|
// GetPosition returns node positions
|
|
func (n *ShortArray) GetPosition() *position.Position {
|
|
return n.Position
|
|
}
|
|
|
|
func (n *ShortArray) GetMeta() *meta.Collection {
|
|
return &n.Meta
|
|
}
|
|
|
|
// Attributes returns node attributes as map
|
|
func (n *ShortArray) Attributes() map[string]interface{} {
|
|
return nil
|
|
}
|
|
|
|
// Walk traverses nodes
|
|
// Walk is invoked recursively until v.EnterNode returns true
|
|
func (n *ShortArray) Walk(v walker.Visitor) {
|
|
if v.EnterNode(n) == false {
|
|
return
|
|
}
|
|
|
|
if n.Items != nil {
|
|
v.EnterChildList("Items", n)
|
|
for _, nn := range n.Items {
|
|
if nn != nil {
|
|
nn.Walk(v)
|
|
}
|
|
}
|
|
v.LeaveChildList("Items", n)
|
|
}
|
|
|
|
v.LeaveNode(n)
|
|
}
|