2017-12-17 22:49:25 +00:00
|
|
|
package expr
|
|
|
|
|
|
|
|
import (
|
|
|
|
"github.com/z7zmey/php-parser/node"
|
2018-01-17 16:58:45 +00:00
|
|
|
"github.com/z7zmey/php-parser/walker"
|
2017-12-17 22:49:25 +00:00
|
|
|
)
|
|
|
|
|
2018-01-11 17:33:25 +00:00
|
|
|
// ShortArray node
|
2017-12-17 22:49:25 +00:00
|
|
|
type ShortArray struct {
|
2018-01-09 13:51:32 +00:00
|
|
|
Items []node.Node
|
2017-12-17 22:49:25 +00:00
|
|
|
}
|
|
|
|
|
2018-01-11 17:33:25 +00:00
|
|
|
// NewShortArray node constuctor
|
2018-01-08 19:18:09 +00:00
|
|
|
func NewShortArray(Items []node.Node) *ShortArray {
|
2018-01-04 18:42:44 +00:00
|
|
|
return &ShortArray{
|
2018-01-04 21:26:04 +00:00
|
|
|
Items,
|
2017-12-17 22:49:25 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-01-11 17:33:25 +00:00
|
|
|
// Attributes returns node attributes as map
|
2018-01-08 19:32:57 +00:00
|
|
|
func (n *ShortArray) Attributes() map[string]interface{} {
|
2018-01-04 22:12:01 +00:00
|
|
|
return nil
|
2017-12-29 15:20:24 +00:00
|
|
|
}
|
|
|
|
|
2018-01-11 17:33:25 +00:00
|
|
|
// Walk traverses nodes
|
|
|
|
// Walk is invoked recursively until v.EnterNode returns true
|
2018-01-17 16:58:45 +00:00
|
|
|
func (n *ShortArray) Walk(v walker.Visitor) {
|
2017-12-28 11:36:27 +00:00
|
|
|
if v.EnterNode(n) == false {
|
2017-12-27 23:23:32 +00:00
|
|
|
return
|
|
|
|
}
|
2017-12-17 22:49:25 +00:00
|
|
|
|
2018-01-04 21:26:04 +00:00
|
|
|
if n.Items != nil {
|
|
|
|
vv := v.GetChildrenVisitor("Items")
|
|
|
|
for _, nn := range n.Items {
|
2018-01-10 12:35:08 +00:00
|
|
|
if nn != nil {
|
|
|
|
nn.Walk(vv)
|
|
|
|
}
|
2017-12-17 22:49:25 +00:00
|
|
|
}
|
|
|
|
}
|
2017-12-28 11:36:27 +00:00
|
|
|
|
|
|
|
v.LeaveNode(n)
|
2017-12-17 22:49:25 +00:00
|
|
|
}
|