maride/php-parser
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

make nodes fields public

Browse Source
This commit is contained in:
z7zmey 2018-01-04 23:26:04 +02:00
parent 02807502d3
commit 469db8f9e2
141 changed files with 1192 additions and 1198 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

12
node/argument.go
View File

@ -7,13 +7,13 @@ type Argument struct {
variadic bool
}
func NewArgument(expression Node, variadic bool) Node {
func NewArgument(Expression Node, variadic bool) Node {
return &Argument{
map[string]interface{}{
"variadic": variadic,
},
nil,
expression,
Expression,
variadic,
}
}
@ -22,12 +22,12 @@ func (n Argument) Attributes() map[string]interface{} {
return n.attributes
}
func (n Argument) Attribute(key string) interface{} {
return n.attributes[key]
func (n Argument) Attribute(Key string) interface{} {
return n.attributes[Key]
}
func (n Argument) SetAttribute(key string, value interface{}) Node {
n.attributes[key] = value
func (n Argument) SetAttribute(Key string, Value interface{}) Node {
n.attributes[Key] = Value
return n
}

12
node/expr/array.go
View File

@ -7,14 +7,14 @@ import (
type Array struct {
attributes map[string]interface{}
position *node.Position
items []node.Node
Items []node.Node
}
func NewArray(items []node.Node) node.Node {
func NewArray(Items []node.Node) node.Node {
return &Array{
map[string]interface{}{},
nil,
items,
Items,
}
}
@ -36,9 +36,9 @@ func (n Array) Walk(v node.Visitor) {
return
}
if n.items != nil {
vv := v.GetChildrenVisitor("items")
for _, nn := range n.items {
if n.Items != nil {
vv := v.GetChildrenVisitor("Items")
for _, nn := range n.Items {
nn.Walk(vv)
}
}

22
node/expr/array_dim_fetch.go
View File

@ -7,16 +7,16 @@ import (
type ArrayDimFetch struct {
attributes map[string]interface{}
position *node.Position
variable node.Node
dim node.Node
Variable node.Node
Dim node.Node
}
func NewArrayDimFetch(variable node.Node, dim node.Node) node.Node {
func NewArrayDimFetch(Variable node.Node, Dim node.Node) node.Node {
return &ArrayDimFetch{
map[string]interface{}{},
nil,
variable,
dim,
Variable,
Dim,
}
}
@ -38,14 +38,14 @@ func (n ArrayDimFetch) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.dim != nil {
vv := v.GetChildrenVisitor("dim")
n.dim.Walk(vv)
if n.Dim != nil {
vv := v.GetChildrenVisitor("Dim")
n.Dim.Walk(vv)
}
v.LeaveNode(n)

22
node/expr/array_item.go
View File

@ -7,18 +7,18 @@ import (
type ArrayItem struct {
attributes map[string]interface{}
position *node.Position
key node.Node
val node.Node
Key node.Node
Val node.Node
}
func NewArrayItem(key node.Node, val node.Node, byRef bool) node.Node {
func NewArrayItem(Key node.Node, Val node.Node, byRef bool) node.Node {
return &ArrayItem{
map[string]interface{}{
"byRef": byRef,
},
nil,
key,
val,
Key,
Val,
}
}
@ -40,14 +40,14 @@ func (n ArrayItem) Walk(v node.Visitor) {
return
}
if n.key != nil {
vv := v.GetChildrenVisitor("key")
n.key.Walk(vv)
if n.Key != nil {
vv := v.GetChildrenVisitor("Key")
n.Key.Walk(vv)
}
if n.val != nil {
vv := v.GetChildrenVisitor("val")
n.val.Walk(vv)
if n.Val != nil {
vv := v.GetChildrenVisitor("Val")
n.Val.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/assign_op/assign.go
View File

@ -8,13 +8,13 @@ type Assign struct {
AssignOp
}
func NewAssign(variable node.Node, expression node.Node) node.Node {
func NewAssign(Variable node.Node, Expression node.Node) node.Node {
return &Assign{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Assign) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

4
node/expr/assign_op/assign_op.go
View File

@ -7,6 +7,6 @@ import (
type AssignOp struct {
attributes map[string]interface{}
position *node.Position
variable node.Node
expression node.Node
Variable node.Node
Expression node.Node
}

18
node/expr/assign_op/assign_ref.go
View File

@ -8,13 +8,13 @@ type AssignRef struct {
AssignOp
}
func NewAssignRef(variable node.Node, expression node.Node) node.Node {
func NewAssignRef(Variable node.Node, Expression node.Node) node.Node {
return &AssignRef{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n AssignRef) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/assign_op/bitwise_and.go
View File

@ -8,13 +8,13 @@ type BitwiseAnd struct {
AssignOp
}
func NewBitwiseAnd(variable node.Node, expression node.Node) node.Node {
func NewBitwiseAnd(Variable node.Node, Expression node.Node) node.Node {
return &BitwiseAnd{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n BitwiseAnd) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/assign_op/bitwise_or.go
View File

@ -8,13 +8,13 @@ type BitwiseOr struct {
AssignOp
}
func NewBitwiseOr(variable node.Node, expression node.Node) node.Node {
func NewBitwiseOr(Variable node.Node, Expression node.Node) node.Node {
return &BitwiseOr{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n BitwiseOr) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/assign_op/bitwise_xor.go
View File

@ -8,13 +8,13 @@ type BitwiseXor struct {
AssignOp
}
func NewBitwiseXor(variable node.Node, expression node.Node) node.Node {
func NewBitwiseXor(Variable node.Node, Expression node.Node) node.Node {
return &BitwiseXor{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n BitwiseXor) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/assign_op/concat.go
View File

@ -8,13 +8,13 @@ type Concat struct {
AssignOp
}
func NewConcat(variable node.Node, expression node.Node) node.Node {
func NewConcat(Variable node.Node, Expression node.Node) node.Node {
return &Concat{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Concat) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/assign_op/div.go
View File

@ -8,13 +8,13 @@ type Div struct {
AssignOp
}
func NewDiv(variable node.Node, expression node.Node) node.Node {
func NewDiv(Variable node.Node, Expression node.Node) node.Node {
return &Div{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Div) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/assign_op/minus.go
View File

@ -8,13 +8,13 @@ type Minus struct {
AssignOp
}
func NewMinus(variable node.Node, expression node.Node) node.Node {
func NewMinus(Variable node.Node, Expression node.Node) node.Node {
return &Minus{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Minus) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/assign_op/mod.go
View File

@ -8,13 +8,13 @@ type Mod struct {
AssignOp
}
func NewMod(variable node.Node, expression node.Node) node.Node {
func NewMod(Variable node.Node, Expression node.Node) node.Node {
return &Mod{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Mod) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/assign_op/mul.go
View File

@ -8,13 +8,13 @@ type Mul struct {
AssignOp
}
func NewMul(variable node.Node, expression node.Node) node.Node {
func NewMul(Variable node.Node, Expression node.Node) node.Node {
return &Mul{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Mul) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/assign_op/plus.go
View File

@ -8,13 +8,13 @@ type Plus struct {
AssignOp
}
func NewPlus(variable node.Node, expression node.Node) node.Node {
func NewPlus(Variable node.Node, Expression node.Node) node.Node {
return &Plus{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Plus) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/assign_op/pow.go
View File

@ -8,13 +8,13 @@ type Pow struct {
AssignOp
}
func NewPow(variable node.Node, expression node.Node) node.Node {
func NewPow(Variable node.Node, Expression node.Node) node.Node {
return &Pow{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Pow) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/assign_op/shift_left.go
View File

@ -8,13 +8,13 @@ type ShiftLeft struct {
AssignOp
}
func NewShiftLeft(variable node.Node, expression node.Node) node.Node {
func NewShiftLeft(Variable node.Node, Expression node.Node) node.Node {
return &ShiftLeft{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n ShiftLeft) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/assign_op/shift_right.go
View File

@ -8,13 +8,13 @@ type ShiftRight struct {
AssignOp
}
func NewShiftRight(variable node.Node, expression node.Node) node.Node {
func NewShiftRight(Variable node.Node, Expression node.Node) node.Node {
return &ShiftRight{
AssignOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n ShiftRight) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.expression != nil {
vv := v.GetChildrenVisitor("expression")
n.expression.Walk(vv)
if n.Expression != nil {
vv := v.GetChildrenVisitor("Expression")
n.Expression.Walk(vv)
}
v.LeaveNode(n)

4
node/expr/binary_op/binary_op.go
View File

@ -7,6 +7,6 @@ import (
type BinaryOp struct {
attributes map[string]interface{}
position *node.Position
left node.Node
right node.Node
Left node.Node
Right node.Node
}

18
node/expr/binary_op/bitwise_and.go
View File

@ -8,13 +8,13 @@ type BitwiseAnd struct {
BinaryOp
}
func NewBitwiseAnd(variable node.Node, expression node.Node) node.Node {
func NewBitwiseAnd(Variable node.Node, Expression node.Node) node.Node {
return &BitwiseAnd{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n BitwiseAnd) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/bitwise_or.go
View File

@ -8,13 +8,13 @@ type BitwiseOr struct {
BinaryOp
}
func NewBitwiseOr(variable node.Node, expression node.Node) node.Node {
func NewBitwiseOr(Variable node.Node, Expression node.Node) node.Node {
return &BitwiseOr{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n BitwiseOr) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/bitwise_xor.go
View File

@ -8,13 +8,13 @@ type BitwiseXor struct {
BinaryOp
}
func NewBitwiseXor(variable node.Node, expression node.Node) node.Node {
func NewBitwiseXor(Variable node.Node, Expression node.Node) node.Node {
return &BitwiseXor{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n BitwiseXor) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/boolean_and.go
View File

@ -8,13 +8,13 @@ type BooleanAnd struct {
BinaryOp
}
func NewBooleanAnd(variable node.Node, expression node.Node) node.Node {
func NewBooleanAnd(Variable node.Node, Expression node.Node) node.Node {
return &BooleanAnd{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n BooleanAnd) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/boolean_or.go
View File

@ -8,13 +8,13 @@ type BooleanOr struct {
BinaryOp
}
func NewBooleanOr(variable node.Node, expression node.Node) node.Node {
func NewBooleanOr(Variable node.Node, Expression node.Node) node.Node {
return &BooleanOr{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n BooleanOr) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/coalesce.go
View File

@ -8,13 +8,13 @@ type Coalesce struct {
BinaryOp
}
func NewCoalesce(variable node.Node, expression node.Node) node.Node {
func NewCoalesce(Variable node.Node, Expression node.Node) node.Node {
return &Coalesce{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Coalesce) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/concat.go
View File

@ -8,13 +8,13 @@ type Concat struct {
BinaryOp
}
func NewConcat(variable node.Node, expression node.Node) node.Node {
func NewConcat(Variable node.Node, Expression node.Node) node.Node {
return &Concat{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Concat) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/div.go
View File

@ -8,13 +8,13 @@ type Div struct {
BinaryOp
}
func NewDiv(variable node.Node, expression node.Node) node.Node {
func NewDiv(Variable node.Node, Expression node.Node) node.Node {
return &Div{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Div) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/equal.go
View File

@ -8,13 +8,13 @@ type Equal struct {
BinaryOp
}
func NewEqual(variable node.Node, expression node.Node) node.Node {
func NewEqual(Variable node.Node, Expression node.Node) node.Node {
return &Equal{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Equal) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/greater.go
View File

@ -8,13 +8,13 @@ type Greater struct {
BinaryOp
}
func NewGreater(variable node.Node, expression node.Node) node.Node {
func NewGreater(Variable node.Node, Expression node.Node) node.Node {
return &Greater{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Greater) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/greater_or_equal.go
View File

@ -8,13 +8,13 @@ type GreaterOrEqual struct {
BinaryOp
}
func NewGreaterOrEqual(variable node.Node, expression node.Node) node.Node {
func NewGreaterOrEqual(Variable node.Node, Expression node.Node) node.Node {
return &GreaterOrEqual{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n GreaterOrEqual) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/identical.go
View File

@ -8,13 +8,13 @@ type Identical struct {
BinaryOp
}
func NewIdentical(variable node.Node, expression node.Node) node.Node {
func NewIdentical(Variable node.Node, Expression node.Node) node.Node {
return &Identical{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Identical) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/logical_and.go
View File

@ -8,13 +8,13 @@ type LogicalAnd struct {
BinaryOp
}
func NewLogicalAnd(variable node.Node, expression node.Node) node.Node {
func NewLogicalAnd(Variable node.Node, Expression node.Node) node.Node {
return &LogicalAnd{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n LogicalAnd) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/logical_or.go
View File

@ -8,13 +8,13 @@ type LogicalOr struct {
BinaryOp
}
func NewLogicalOr(variable node.Node, expression node.Node) node.Node {
func NewLogicalOr(Variable node.Node, Expression node.Node) node.Node {
return &LogicalOr{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n LogicalOr) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/logical_xor.go
View File

@ -8,13 +8,13 @@ type LogicalXor struct {
BinaryOp
}
func NewLogicalXor(variable node.Node, expression node.Node) node.Node {
func NewLogicalXor(Variable node.Node, Expression node.Node) node.Node {
return &LogicalXor{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n LogicalXor) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/minus.go
View File

@ -8,13 +8,13 @@ type Minus struct {
BinaryOp
}
func NewMinus(variable node.Node, expression node.Node) node.Node {
func NewMinus(Variable node.Node, Expression node.Node) node.Node {
return &Minus{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Minus) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/mod.go
View File

@ -8,13 +8,13 @@ type Mod struct {
BinaryOp
}
func NewMod(variable node.Node, expression node.Node) node.Node {
func NewMod(Variable node.Node, Expression node.Node) node.Node {
return &Mod{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Mod) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/mul.go
View File

@ -8,13 +8,13 @@ type Mul struct {
BinaryOp
}
func NewMul(variable node.Node, expression node.Node) node.Node {
func NewMul(Variable node.Node, Expression node.Node) node.Node {
return &Mul{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Mul) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/not_equal.go
View File

@ -8,13 +8,13 @@ type NotEqual struct {
BinaryOp
}
func NewNotEqual(variable node.Node, expression node.Node) node.Node {
func NewNotEqual(Variable node.Node, Expression node.Node) node.Node {
return &NotEqual{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n NotEqual) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/not_identical.go
View File

@ -8,13 +8,13 @@ type NotIdentical struct {
BinaryOp
}
func NewNotIdentical(variable node.Node, expression node.Node) node.Node {
func NewNotIdentical(Variable node.Node, Expression node.Node) node.Node {
return &NotIdentical{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n NotIdentical) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/plus.go
View File

@ -8,13 +8,13 @@ type Plus struct {
BinaryOp
}
func NewPlus(variable node.Node, expression node.Node) node.Node {
func NewPlus(Variable node.Node, Expression node.Node) node.Node {
return &Plus{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Plus) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/pow.go
View File

@ -8,13 +8,13 @@ type Pow struct {
BinaryOp
}
func NewPow(variable node.Node, expression node.Node) node.Node {
func NewPow(Variable node.Node, Expression node.Node) node.Node {
return &Pow{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Pow) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/shift_left.go
View File

@ -8,13 +8,13 @@ type ShiftLeft struct {
BinaryOp
}
func NewShiftLeft(variable node.Node, expression node.Node) node.Node {
func NewShiftLeft(Variable node.Node, Expression node.Node) node.Node {
return &ShiftLeft{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n ShiftLeft) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/shift_right.go
View File

@ -8,13 +8,13 @@ type ShiftRight struct {
BinaryOp
}
func NewShiftRight(variable node.Node, expression node.Node) node.Node {
func NewShiftRight(Variable node.Node, Expression node.Node) node.Node {
return &ShiftRight{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n ShiftRight) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/smaller.go
View File

@ -8,13 +8,13 @@ type Smaller struct {
BinaryOp
}
func NewSmaller(variable node.Node, expression node.Node) node.Node {
func NewSmaller(Variable node.Node, Expression node.Node) node.Node {
return &Smaller{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Smaller) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/smaller_or_equal.go
View File

@ -8,13 +8,13 @@ type SmallerOrEqual struct {
BinaryOp
}
func NewSmallerOrEqual(variable node.Node, expression node.Node) node.Node {
func NewSmallerOrEqual(Variable node.Node, Expression node.Node) node.Node {
return &SmallerOrEqual{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n SmallerOrEqual) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

18
node/expr/binary_op/spaceship.go
View File

@ -8,13 +8,13 @@ type Spaceship struct {
BinaryOp
}
func NewSpaceship(variable node.Node, expression node.Node) node.Node {
func NewSpaceship(Variable node.Node, Expression node.Node) node.Node {
return &Spaceship{
BinaryOp{
map[string]interface{}{},
nil,
variable,
expression,
Variable,
Expression,
},
}
}
@ -37,14 +37,14 @@ func (n Spaceship) Walk(v node.Visitor) {
return
}
if n.left != nil {
vv := v.GetChildrenVisitor("left")
n.left.Walk(vv)
if n.Left != nil {
vv := v.GetChildrenVisitor("Left")
n.Left.Walk(vv)
}
if n.right != nil {
vv := v.GetChildrenVisitor("right")
n.right.Walk(vv)
if n.Right != nil {
vv := v.GetChildrenVisitor("Right")
n.Right.Walk(vv)
}
v.LeaveNode(n)

4
node/expr/bitwise_not.go
View File

@ -10,11 +10,11 @@ type BitwiseNot struct {
expr node.Node
}
func NewBitwiseNot(expression node.Node) node.Node {
func NewBitwiseNot(Expression node.Node) node.Node {
return &BitwiseNot{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

4
node/expr/boolean_not.go
View File

@ -10,11 +10,11 @@ type BooleanNot struct {
expr node.Node
}
func NewBooleanNot(expression node.Node) node.Node {
func NewBooleanNot(Expression node.Node) node.Node {
return &BooleanNot{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

22
node/expr/class_const_fetch.go
View File

@ -7,16 +7,16 @@ import (
type ClassConstFetch struct {
attributes map[string]interface{}
position *node.Position
class node.Node
constantName node.Node
Class node.Node
ConstantName node.Node
}
func NewClassConstFetch(class node.Node, constantName node.Node) node.Node {
func NewClassConstFetch(Class node.Node, ConstantName node.Node) node.Node {
return &ClassConstFetch{
map[string]interface{}{},
nil,
class,
constantName,
Class,
ConstantName,
}
}
@ -38,14 +38,14 @@ func (n ClassConstFetch) Walk(v node.Visitor) {
return
}
if n.constantName != nil {
vv := v.GetChildrenVisitor("constantName")
n.constantName.Walk(vv)
if n.ConstantName != nil {
vv := v.GetChildrenVisitor("ConstantName")
n.ConstantName.Walk(vv)
}
if n.class != nil {
vv := v.GetChildrenVisitor("class")
n.class.Walk(vv)
if n.Class != nil {
vv := v.GetChildrenVisitor("Class")
n.Class.Walk(vv)
}
v.LeaveNode(n)

4
node/expr/clone.go
View File

@ -10,11 +10,11 @@ type Clone struct {
expr node.Node
}
func NewClone(expression node.Node) node.Node {
func NewClone(Expression node.Node) node.Node {
return &Clone{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

42
node/expr/closure.go
View File

@ -7,13 +7,13 @@ import (
type Closure struct {
attributes map[string]interface{}
position *node.Position
params []node.Node
uses []node.Node
returnType node.Node
stmts []node.Node
Params []node.Node
Uses []node.Node
ReturnType node.Node
Stmts []node.Node
}
func NewClosure(params []node.Node, uses []node.Node, returnType node.Node, stmts []node.Node, isStatic bool, isReturnRef bool, phpDocComment string) node.Node {
func NewClosure(Params []node.Node, Uses []node.Node, ReturnType node.Node, Stmts []node.Node, isStatic bool, isReturnRef bool, phpDocComment string) node.Node {
return &Closure{
map[string]interface{}{
"isReturnRef": isReturnRef,
@ -21,10 +21,10 @@ func NewClosure(params []node.Node, uses []node.Node, returnType node.Node, stmt
"phpDocComment": phpDocComment,
},
nil,
params,
uses,
returnType,
stmts,
Params,
Uses,
ReturnType,
Stmts,
}
}
@ -46,28 +46,28 @@ func (n Closure) Walk(v node.Visitor) {
return
}
if n.params != nil {
vv := v.GetChildrenVisitor("params")
for _, nn := range n.params {
if n.Params != nil {
vv := v.GetChildrenVisitor("Params")
for _, nn := range n.Params {
nn.Walk(vv)
}
}
if n.uses != nil {
vv := v.GetChildrenVisitor("uses")
for _, nn := range n.uses {
if n.Uses != nil {
vv := v.GetChildrenVisitor("Uses")
for _, nn := range n.Uses {
nn.Walk(vv)
}
}
if n.returnType != nil {
vv := v.GetChildrenVisitor("returnType")
n.returnType.Walk(vv)
if n.ReturnType != nil {
vv := v.GetChildrenVisitor("ReturnType")
n.ReturnType.Walk(vv)
}
if n.stmts != nil {
vv := v.GetChildrenVisitor("stmts")
for _, nn := range n.stmts {
if n.Stmts != nil {
vv := v.GetChildrenVisitor("Stmts")
for _, nn := range n.Stmts {
nn.Walk(vv)
}
}

12
node/expr/closure_use.go
View File

@ -7,16 +7,16 @@ import (
type ClusureUse struct {
attributes map[string]interface{}
position *node.Position
variable node.Node
Variable node.Node
}
func NewClusureUse(variable node.Node, byRef bool) node.Node {
func NewClusureUse(Variable node.Node, byRef bool) node.Node {
return &ClusureUse{
map[string]interface{}{
"byRef": byRef,
},
nil,
variable,
Variable,
}
}
@ -38,9 +38,9 @@ func (n ClusureUse) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
v.LeaveNode(n)

12
node/expr/const_fetch.go
View File

@ -7,14 +7,14 @@ import (
type ConstFetch struct {
attributes map[string]interface{}
position *node.Position
constant node.Node
Constant node.Node
}
func NewConstFetch(constant node.Node) node.Node {
func NewConstFetch(Constant node.Node) node.Node {
return &ConstFetch{
map[string]interface{}{},
nil,
constant,
Constant,
}
}
@ -36,9 +36,9 @@ func (n ConstFetch) Walk(v node.Visitor) {
return
}
if n.constant != nil {
vv := v.GetChildrenVisitor("constant")
n.constant.Walk(vv)
if n.Constant != nil {
vv := v.GetChildrenVisitor("Constant")
n.Constant.Walk(vv)
}
v.LeaveNode(n)

4
node/expr/empty.go
View File

@ -10,11 +10,11 @@ type Empty struct {
expr node.Node
}
func NewEmpty(expression node.Node) node.Node {
func NewEmpty(Expression node.Node) node.Node {
return &Empty{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

4
node/expr/error_suppress.go
View File

@ -10,11 +10,11 @@ type ErrorSuppress struct {
expr node.Node
}
func NewErrorSuppress(expression node.Node) node.Node {
func NewErrorSuppress(Expression node.Node) node.Node {
return &ErrorSuppress{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

4
node/expr/eval.go
View File

@ -10,11 +10,11 @@ type Eval struct {
expr node.Node
}
func NewEval(expression node.Node) node.Node {
func NewEval(Expression node.Node) node.Node {
return &Eval{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

22
node/expr/function_call.go
View File

@ -7,16 +7,16 @@ import (
type FunctionCall struct {
attributes map[string]interface{}
position *node.Position
function node.Node
arguments []node.Node
Function node.Node
Arguments []node.Node
}
func NewFunctionCall(function node.Node, arguments []node.Node) node.Node {
func NewFunctionCall(Function node.Node, Arguments []node.Node) node.Node {
return &FunctionCall{
map[string]interface{}{},
nil,
function,
arguments,
Function,
Arguments,
}
}
@ -38,14 +38,14 @@ func (n FunctionCall) Walk(v node.Visitor) {
return
}
if n.function != nil {
vv := v.GetChildrenVisitor("function")
n.function.Walk(vv)
if n.Function != nil {
vv := v.GetChildrenVisitor("Function")
n.Function.Walk(vv)
}
if n.arguments != nil {
vv := v.GetChildrenVisitor("arguments")
for _, nn := range n.arguments {
if n.Arguments != nil {
vv := v.GetChildrenVisitor("Arguments")
for _, nn := range n.Arguments {
nn.Walk(vv)
}
}

4
node/expr/include.go
View File

@ -10,11 +10,11 @@ type Include struct {
expr node.Node
}
func NewInclude(expression node.Node) node.Node {
func NewInclude(Expression node.Node) node.Node {
return &Include{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

4
node/expr/include_once.go
View File

@ -10,11 +10,11 @@ type IncludeOnce struct {
expr node.Node
}
func NewIncludeOnce(expression node.Node) node.Node {
func NewIncludeOnce(Expression node.Node) node.Node {
return &IncludeOnce{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

12
node/expr/instance_of.go
View File

@ -8,15 +8,15 @@ type InstanceOf struct {
attributes map[string]interface{}
position *node.Position
expr node.Node
class node.Node
Class node.Node
}
func NewInstanceOf(expr node.Node, class node.Node) node.Node {
func NewInstanceOf(expr node.Node, Class node.Node) node.Node {
return &InstanceOf{
map[string]interface{}{},
nil,
expr,
class,
Class,
}
}
@ -43,9 +43,9 @@ func (n InstanceOf) Walk(v node.Visitor) {
n.expr.Walk(vv)
}
if n.class != nil {
vv := v.GetChildrenVisitor("class")
n.class.Walk(vv)
if n.Class != nil {
vv := v.GetChildrenVisitor("Class")
n.Class.Walk(vv)
}
v.LeaveNode(n)

12
node/expr/isset.go
View File

@ -7,14 +7,14 @@ import (
type Isset struct {
attributes map[string]interface{}
position *node.Position
variables []node.Node
Variables []node.Node
}
func NewIsset(variables []node.Node) node.Node {
func NewIsset(Variables []node.Node) node.Node {
return &Isset{
map[string]interface{}{},
nil,
variables,
Variables,
}
}
@ -36,9 +36,9 @@ func (n Isset) Walk(v node.Visitor) {
return
}
if n.variables != nil {
vv := v.GetChildrenVisitor("variables")
for _, nn := range n.variables {
if n.Variables != nil {
vv := v.GetChildrenVisitor("Variables")
for _, nn := range n.Variables {
nn.Walk(vv)
}
}

12
node/expr/list.go
View File

@ -7,14 +7,14 @@ import (
type List struct {
attributes map[string]interface{}
position *node.Position
items []node.Node
Items []node.Node
}
func NewList(items []node.Node) node.Node {
func NewList(Items []node.Node) node.Node {
return &List{
map[string]interface{}{},
nil,
items,
Items,
}
}
@ -36,9 +36,9 @@ func (n List) Walk(v node.Visitor) {
return
}
if n.items != nil {
vv := v.GetChildrenVisitor("items")
for _, nn := range n.items {
if n.Items != nil {
vv := v.GetChildrenVisitor("Items")
for _, nn := range n.Items {
nn.Walk(vv)
}
}

32
node/expr/method_call.go
View File

@ -7,18 +7,18 @@ import (
type MethodCall struct {
attributes map[string]interface{}
position *node.Position
variable node.Node
method node.Node
arguments []node.Node
Variable node.Node
Method node.Node
Arguments []node.Node
}
func NewMethodCall(variable node.Node, method node.Node, arguments []node.Node) node.Node {
func NewMethodCall(Variable node.Node, Method node.Node, Arguments []node.Node) node.Node {
return &MethodCall{
map[string]interface{}{},
nil,
variable,
method,
arguments,
Variable,
Method,
Arguments,
}
}
@ -40,19 +40,19 @@ func (n MethodCall) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.method != nil {
vv := v.GetChildrenVisitor("method")
n.method.Walk(vv)
if n.Method != nil {
vv := v.GetChildrenVisitor("Method")
n.Method.Walk(vv)
}
if n.arguments != nil {
vv := v.GetChildrenVisitor("arguments")
for _, nn := range n.arguments {
if n.Arguments != nil {
vv := v.GetChildrenVisitor("Arguments")
for _, nn := range n.Arguments {
nn.Walk(vv)
}
}

22
node/expr/new.go
View File

@ -7,16 +7,16 @@ import (
type New struct {
attributes map[string]interface{}
position *node.Position
class node.Node
arguments []node.Node
Class node.Node
Arguments []node.Node
}
func NewNew(class node.Node, arguments []node.Node) node.Node {
func NewNew(Class node.Node, Arguments []node.Node) node.Node {
return &New{
map[string]interface{}{},
nil,
class,
arguments,
Class,
Arguments,
}
}
@ -38,14 +38,14 @@ func (n New) Walk(v node.Visitor) {
return
}
if n.class != nil {
vv := v.GetChildrenVisitor("class")
n.class.Walk(vv)
if n.Class != nil {
vv := v.GetChildrenVisitor("Class")
n.Class.Walk(vv)
}
if n.arguments != nil {
vv := v.GetChildrenVisitor("arguments")
for _, nn := range n.arguments {
if n.Arguments != nil {
vv := v.GetChildrenVisitor("Arguments")
for _, nn := range n.Arguments {
nn.Walk(vv)
}
}

12
node/expr/post_dec.go
View File

@ -7,14 +7,14 @@ import (
type PostDec struct {
attributes map[string]interface{}
position *node.Position
variable node.Node
Variable node.Node
}
func NewPostDec(variable node.Node) node.Node {
func NewPostDec(Variable node.Node) node.Node {
return &PostDec{
map[string]interface{}{},
nil,
variable,
Variable,
}
}
@ -36,9 +36,9 @@ func (n PostDec) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
v.LeaveNode(n)

12
node/expr/post_inc.go
View File

@ -7,14 +7,14 @@ import (
type PostInc struct {
attributes map[string]interface{}
position *node.Position
variable node.Node
Variable node.Node
}
func NewPostInc(variable node.Node) node.Node {
func NewPostInc(Variable node.Node) node.Node {
return &PostInc{
map[string]interface{}{},
nil,
variable,
Variable,
}
}
@ -36,9 +36,9 @@ func (n PostInc) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
v.LeaveNode(n)

12
node/expr/pre_dec.go
View File

@ -7,14 +7,14 @@ import (
type PreDec struct {
attributes map[string]interface{}
position *node.Position
variable node.Node
Variable node.Node
}
func NewPreDec(variable node.Node) node.Node {
func NewPreDec(Variable node.Node) node.Node {
return &PreDec{
map[string]interface{}{},
nil,
variable,
Variable,
}
}
@ -36,9 +36,9 @@ func (n PreDec) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
v.LeaveNode(n)

12
node/expr/pre_inc.go
View File

@ -7,14 +7,14 @@ import (
type PreInc struct {
attributes map[string]interface{}
position *node.Position
variable node.Node
Variable node.Node
}
func NewPreInc(variable node.Node) node.Node {
func NewPreInc(Variable node.Node) node.Node {
return &PreInc{
map[string]interface{}{},
nil,
variable,
Variable,
}
}
@ -36,9 +36,9 @@ func (n PreInc) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
v.LeaveNode(n)

4
node/expr/print.go
View File

@ -10,11 +10,11 @@ type Print struct {
expr node.Node
}
func NewPrint(expression node.Node) node.Node {
func NewPrint(Expression node.Node) node.Node {
return &Print{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

22
node/expr/property_fetch.go
View File

@ -7,16 +7,16 @@ import (
type PropertyFetch struct {
attributes map[string]interface{}
position *node.Position
variable node.Node
property node.Node
Variable node.Node
Property node.Node
}
func NewPropertyFetch(variable node.Node, property node.Node) node.Node {
func NewPropertyFetch(Variable node.Node, Property node.Node) node.Node {
return &PropertyFetch{
map[string]interface{}{},
nil,
variable,
property,
Variable,
Property,
}
}
@ -38,14 +38,14 @@ func (n PropertyFetch) Walk(v node.Visitor) {
return
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.property != nil {
vv := v.GetChildrenVisitor("property")
n.property.Walk(vv)
if n.Property != nil {
vv := v.GetChildrenVisitor("Property")
n.Property.Walk(vv)
}
v.LeaveNode(n)

4
node/expr/require.go
View File

@ -10,11 +10,11 @@ type Require struct {
expr node.Node
}
func NewRequire(expression node.Node) node.Node {
func NewRequire(Expression node.Node) node.Node {
return &Require{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

4
node/expr/require_once.go
View File

@ -10,11 +10,11 @@ type RequireOnce struct {
expr node.Node
}
func NewRequireOnce(expression node.Node) node.Node {
func NewRequireOnce(Expression node.Node) node.Node {
return &RequireOnce{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

12
node/expr/shell_exec.go
View File

@ -7,14 +7,14 @@ import (
type ShellExec struct {
attributes map[string]interface{}
position *node.Position
parts []node.Node
Parts []node.Node
}
func NewShellExec(parts []node.Node) node.Node {
func NewShellExec(Parts []node.Node) node.Node {
return &ShellExec{
map[string]interface{}{},
nil,
parts,
Parts,
}
}
@ -36,9 +36,9 @@ func (n ShellExec) Walk(v node.Visitor) {
return
}
if n.parts != nil {
vv := v.GetChildrenVisitor("parts")
for _, nn := range n.parts {
if n.Parts != nil {
vv := v.GetChildrenVisitor("Parts")
for _, nn := range n.Parts {
nn.Walk(vv)
}
}

12
node/expr/short_array.go
View File

@ -7,14 +7,14 @@ import (
type ShortArray struct {
attributes map[string]interface{}
position *node.Position
items []node.Node
Items []node.Node
}
func NewShortArray(items []node.Node) node.Node {
func NewShortArray(Items []node.Node) node.Node {
return &ShortArray{
map[string]interface{}{},
nil,
items,
Items,
}
}
@ -36,9 +36,9 @@ func (n ShortArray) Walk(v node.Visitor) {
return
}
if n.items != nil {
vv := v.GetChildrenVisitor("items")
for _, nn := range n.items {
if n.Items != nil {
vv := v.GetChildrenVisitor("Items")
for _, nn := range n.Items {
nn.Walk(vv)
}
}

12
node/expr/short_list.go
View File

@ -7,14 +7,14 @@ import (
type ShortList struct {
attributes map[string]interface{}
position *node.Position
items []node.Node
Items []node.Node
}
func NewShortList(items []node.Node) node.Node {
func NewShortList(Items []node.Node) node.Node {
return &ShortList{
map[string]interface{}{},
nil,
items,
Items,
}
}
@ -36,9 +36,9 @@ func (n ShortList) Walk(v node.Visitor) {
return
}
if n.items != nil {
vv := v.GetChildrenVisitor("items")
for _, nn := range n.items {
if n.Items != nil {
vv := v.GetChildrenVisitor("Items")
for _, nn := range n.Items {
nn.Walk(vv)
}
}

32
node/expr/static_call.go
View File

@ -7,18 +7,18 @@ import (
type StaticCall struct {
attributes map[string]interface{}
position *node.Position
class node.Node
call node.Node
arguments []node.Node
Class node.Node
Call node.Node
Arguments []node.Node
}
func NewStaticCall(class node.Node, call node.Node, arguments []node.Node) node.Node {
func NewStaticCall(Class node.Node, Call node.Node, Arguments []node.Node) node.Node {
return &StaticCall{
map[string]interface{}{},
nil,
class,
call,
arguments,
Class,
Call,
Arguments,
}
}
@ -40,19 +40,19 @@ func (n StaticCall) Walk(v node.Visitor) {
return
}
if n.class != nil {
vv := v.GetChildrenVisitor("class")
n.class.Walk(vv)
if n.Class != nil {
vv := v.GetChildrenVisitor("Class")
n.Class.Walk(vv)
}
if n.call != nil {
vv := v.GetChildrenVisitor("call")
n.call.Walk(vv)
if n.Call != nil {
vv := v.GetChildrenVisitor("Call")
n.Call.Walk(vv)
}
if n.arguments != nil {
vv := v.GetChildrenVisitor("arguments")
for _, nn := range n.arguments {
if n.Arguments != nil {
vv := v.GetChildrenVisitor("Arguments")
for _, nn := range n.Arguments {
nn.Walk(vv)
}
}

22
node/expr/static_property_fetch.go
View File

@ -7,16 +7,16 @@ import (
type StaticPropertyFetch struct {
attributes map[string]interface{}
position *node.Position
class node.Node
property node.Node
Class node.Node
Property node.Node
}
func NewStaticPropertyFetch(class node.Node, property node.Node) node.Node {
func NewStaticPropertyFetch(Class node.Node, Property node.Node) node.Node {
return &StaticPropertyFetch{
map[string]interface{}{},
nil,
class,
property,
Class,
Property,
}
}
@ -38,14 +38,14 @@ func (n StaticPropertyFetch) Walk(v node.Visitor) {
return
}
if n.class != nil {
vv := v.GetChildrenVisitor("class")
n.class.Walk(vv)
if n.Class != nil {
vv := v.GetChildrenVisitor("Class")
n.Class.Walk(vv)
}
if n.property != nil {
vv := v.GetChildrenVisitor("property")
n.property.Walk(vv)
if n.Property != nil {
vv := v.GetChildrenVisitor("Property")
n.Property.Walk(vv)
}
v.LeaveNode(n)

32
node/expr/ternary.go
View File

@ -7,18 +7,18 @@ import (
type Ternary struct {
attributes map[string]interface{}
position *node.Position
condition node.Node
ifTrue node.Node
ifFalse node.Node
Condition node.Node
IfTrue node.Node
IfFalse node.Node
}
func NewTernary(condition node.Node, ifTrue node.Node, ifFalse node.Node) node.Node {
func NewTernary(Condition node.Node, IfTrue node.Node, IfFalse node.Node) node.Node {
return &Ternary{
map[string]interface{}{},
nil,
condition,
ifTrue,
ifFalse,
Condition,
IfTrue,
IfFalse,
}
}
@ -40,19 +40,19 @@ func (n Ternary) Walk(v node.Visitor) {
return
}
if n.condition != nil {
vv := v.GetChildrenVisitor("condition")
n.condition.Walk(vv)
if n.Condition != nil {
vv := v.GetChildrenVisitor("Condition")
n.Condition.Walk(vv)
}
if n.ifTrue != nil {
vv := v.GetChildrenVisitor("ifTrue")
n.ifTrue.Walk(vv)
if n.IfTrue != nil {
vv := v.GetChildrenVisitor("IfTrue")
n.IfTrue.Walk(vv)
}
if n.ifFalse != nil {
vv := v.GetChildrenVisitor("ifFalse")
n.ifFalse.Walk(vv)
if n.IfFalse != nil {
vv := v.GetChildrenVisitor("IfFalse")
n.IfFalse.Walk(vv)
}
v.LeaveNode(n)

4
node/expr/unary_minus.go
View File

@ -10,11 +10,11 @@ type UnaryMinus struct {
expr node.Node
}
func NewUnaryMinus(expression node.Node) node.Node {
func NewUnaryMinus(Expression node.Node) node.Node {
return &UnaryMinus{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

4
node/expr/unary_plus.go
View File

@ -10,11 +10,11 @@ type UnaryPlus struct {
expr node.Node
}
func NewUnaryPlus(expression node.Node) node.Node {
func NewUnaryPlus(Expression node.Node) node.Node {
return &UnaryPlus{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

12
node/expr/variable.go
View File

@ -7,14 +7,14 @@ import (
type Variable struct {
attributes map[string]interface{}
position *node.Position
varName node.Node
VarName node.Node
}
func NewVariable(varName node.Node) node.Node {
func NewVariable(VarName node.Node) node.Node {
return &Variable{
map[string]interface{}{},
nil,
varName,
VarName,
}
}
@ -36,9 +36,9 @@ func (n Variable) Walk(v node.Visitor) {
return
}
if n.varName != nil {
vv := v.GetChildrenVisitor("varName")
n.varName.Walk(vv)
if n.VarName != nil {
vv := v.GetChildrenVisitor("VarName")
n.VarName.Walk(vv)
}
v.LeaveNode(n)

22
node/expr/yield.go
View File

@ -7,16 +7,16 @@ import (
type Yield struct {
attributes map[string]interface{}
position *node.Position
key node.Node
value node.Node
Key node.Node
Value node.Node
}
func NewYield(key node.Node, value node.Node) node.Node {
func NewYield(Key node.Node, Value node.Node) node.Node {
return &Yield{
map[string]interface{}{},
nil,
key,
value,
Key,
Value,
}
}
@ -38,14 +38,14 @@ func (n Yield) Walk(v node.Visitor) {
return
}
if n.key != nil {
vv := v.GetChildrenVisitor("key")
n.key.Walk(vv)
if n.Key != nil {
vv := v.GetChildrenVisitor("Key")
n.Key.Walk(vv)
}
if n.value != nil {
vv := v.GetChildrenVisitor("value")
n.value.Walk(vv)
if n.Value != nil {
vv := v.GetChildrenVisitor("Value")
n.Value.Walk(vv)
}
v.LeaveNode(n)

4
node/expr/yield_from.go
View File

@ -10,11 +10,11 @@ type YieldFrom struct {
expr node.Node
}
func NewYieldFrom(expression node.Node) node.Node {
func NewYieldFrom(Expression node.Node) node.Node {
return &YieldFrom{
map[string]interface{}{},
nil,
expression,
Expression,
}
}

10
node/identifier.go
View File

@ -12,7 +12,7 @@ type Identifier struct {
func NewIdentifier(token token.Token) Node {
return &Identifier{
map[string]interface{}{
"value": token.Value,
"Value": token.Value,
},
nil,
}
@ -22,12 +22,12 @@ func (n Identifier) Attributes() map[string]interface{} {
return n.attributes
}
func (n Identifier) Attribute(key string) interface{} {
return n.attributes[key]
func (n Identifier) Attribute(Key string) interface{} {
return n.attributes[Key]
}
func (n Identifier) SetAttribute(key string, value interface{}) Node {
n.attributes[key] = value
func (n Identifier) SetAttribute(Key string, Value interface{}) Node {
n.attributes[Key] = Value
return n
}

4
node/name/fully_qualified.go
View File

@ -8,12 +8,12 @@ type FullyQualified struct {
Name
}
func NewFullyQualified(parts []node.Node) node.Node {
func NewFullyQualified(Parts []node.Node) node.Node {
return &FullyQualified{
Name{
map[string]interface{}{},
nil,
parts,
Parts,
},
}
}

12
node/name/name.go
View File

@ -7,14 +7,14 @@ import (
type Name struct {
attributes map[string]interface{}
position *node.Position
parts []node.Node
Parts []node.Node
}
func NewName(parts []node.Node) node.Node {
func NewName(Parts []node.Node) node.Node {
return &Name{
map[string]interface{}{},
nil,
parts,
Parts,
}
}
@ -36,9 +36,9 @@ func (n Name) Walk(v node.Visitor) {
return
}
if n.parts != nil {
vv := v.GetChildrenVisitor("parts")
for _, nn := range n.parts {
if n.Parts != nil {
vv := v.GetChildrenVisitor("Parts")
for _, nn := range n.Parts {
nn.Walk(vv)
}
}

4
node/name/name_part.go
View File

@ -9,10 +9,10 @@ type NamePart struct {
position *node.Position
}
func NewNamePart(value string) node.Node {
func NewNamePart(Value string) node.Node {
return &NamePart{
map[string]interface{}{
"value": value,
"Value": Value,
},
nil,
}

4
node/name/relative.go
View File

@ -8,12 +8,12 @@ type Relative struct {
Name
}
func NewRelative(parts []node.Node) node.Node {
func NewRelative(Parts []node.Node) node.Node {
return &Relative{
Name{
map[string]interface{}{},
nil,
parts,
Parts,
},
}
}

12
node/nullable.go
View File

@ -6,11 +6,11 @@ type Nullable struct {
expr Node
}
func NewNullable(expression Node) Node {
func NewNullable(Expression Node) Node {
return &Nullable{
map[string]interface{}{},
nil,
expression,
Expression,
}
}
@ -18,12 +18,12 @@ func (n Nullable) Attributes() map[string]interface{} {
return n.attributes
}
func (n Nullable) Attribute(key string) interface{} {
return n.attributes[key]
func (n Nullable) Attribute(Key string) interface{} {
return n.attributes[Key]
}
func (n Nullable) SetAttribute(key string, value interface{}) Node {
n.attributes[key] = value
func (n Nullable) SetAttribute(Key string, Value interface{}) Node {
n.attributes[Key] = Value
return n
}

40
node/parameter.go
View File

@ -3,21 +3,21 @@ package node
type Parameter struct {
attributes map[string]interface{}
position *Position
variableType Node
variable Node
defaultValue Node
VariableType Node
Variable Node
DefaultValue Node
}
func NewParameter(variableType Node, variable Node, defaultValue Node, byRef bool, variadic bool) Node {
func NewParameter(VariableType Node, Variable Node, DefaultValue Node, byRef bool, variadic bool) Node {
return &Parameter{
map[string]interface{}{
"byRef": byRef,
"variadic": variadic,
},
nil,
variableType,
variable,
defaultValue,
VariableType,
Variable,
DefaultValue,
}
}
@ -25,12 +25,12 @@ func (n Parameter) Attributes() map[string]interface{} {
return n.attributes
}
func (n Parameter) Attribute(key string) interface{} {
return n.attributes[key]
func (n Parameter) Attribute(Key string) interface{} {
return n.attributes[Key]
}
func (n Parameter) SetAttribute(key string, value interface{}) Node {
n.attributes[key] = value
func (n Parameter) SetAttribute(Key string, Value interface{}) Node {
n.attributes[Key] = Value
return n
}
@ -48,19 +48,19 @@ func (n Parameter) Walk(v Visitor) {
return
}
if n.variableType != nil {
vv := v.GetChildrenVisitor("variableType")
n.variableType.Walk(vv)
if n.VariableType != nil {
vv := v.GetChildrenVisitor("VariableType")
n.VariableType.Walk(vv)
}
if n.variable != nil {
vv := v.GetChildrenVisitor("variable")
n.variable.Walk(vv)
if n.Variable != nil {
vv := v.GetChildrenVisitor("Variable")
n.Variable.Walk(vv)
}
if n.defaultValue != nil {
vv := v.GetChildrenVisitor("defaultValue")
n.defaultValue.Walk(vv)
if n.DefaultValue != nil {
vv := v.GetChildrenVisitor("DefaultValue")
n.DefaultValue.Walk(vv)
}
v.LeaveNode(n)

4
node/scalar/dnumber.go
View File

@ -9,10 +9,10 @@ type Dnumber struct {
position *node.Position
}
func NewDnumber(value string) node.Node {
func NewDnumber(Value string) node.Node {
return &Dnumber{
map[string]interface{}{
"value": value,
"Value": Value,
},
nil,
}

12
node/scalar/encapsed.go
View File

@ -7,14 +7,14 @@ import (
type Encapsed struct {
attributes map[string]interface{}
position *node.Position
parts []node.Node
Parts []node.Node
}
func NewEncapsed(parts []node.Node) node.Node {
func NewEncapsed(Parts []node.Node) node.Node {
return &Encapsed{
map[string]interface{}{},
nil,
parts,
Parts,
}
}
@ -36,9 +36,9 @@ func (n Encapsed) Walk(v node.Visitor) {
return
}
if n.parts != nil {
vv := v.GetChildrenVisitor("parts")
for _, nn := range n.parts {
if n.Parts != nil {
vv := v.GetChildrenVisitor("Parts")
for _, nn := range n.Parts {
nn.Walk(vv)
}
}

4
node/scalar/encapsed_string_part.go
View File

@ -9,10 +9,10 @@ type EncapsedStringPart struct {
position *node.Position
}
func NewEncapsedStringPart(value string) node.Node {
func NewEncapsedStringPart(Value string) node.Node {
return &EncapsedStringPart{
map[string]interface{}{
"value": value,
"Value": Value,
},
nil,
}

4
node/scalar/lnumber.go
View File

@ -9,10 +9,10 @@ type Lnumber struct {
position *node.Position
}
func NewLnumber(value string) node.Node {
func NewLnumber(Value string) node.Node {
return &Lnumber{
map[string]interface{}{
"value": value,
"Value": Value,
},
nil,
}

4
node/scalar/magic_constant.go
View File

@ -9,10 +9,10 @@ type MagicConstant struct {
position *node.Position
}
func NewMagicConstant(value string) node.Node {
func NewMagicConstant(Value string) node.Node {
return &MagicConstant{
map[string]interface{}{
"value": value,
"Value": Value,
},
nil,
}

4
node/scalar/string.go
View File

@ -9,10 +9,10 @@ type String struct {
position *node.Position
}
func NewString(value string) node.Node {
func NewString(Value string) node.Node {
return &String{
map[string]interface{}{
"value": value,
"Value": Value,
},
nil,
}

12
node/stmt/alt_else.go
View File

@ -7,14 +7,14 @@ import (
type AltElse struct {
attributes map[string]interface{}
position *node.Position
stmt node.Node
Stmt node.Node
}
func NewAltElse(stmt node.Node) node.Node {
func NewAltElse(Stmt node.Node) node.Node {
return &AltElse{
map[string]interface{}{},
nil,
stmt,
Stmt,
}
}
@ -36,9 +36,9 @@ func (n AltElse) Walk(v node.Visitor) {
return
}
if n.stmt != nil {
vv := v.GetChildrenVisitor("stmt")
n.stmt.Walk(vv)
if n.Stmt != nil {
vv := v.GetChildrenVisitor("Stmt")
n.Stmt.Walk(vv)
}
v.LeaveNode(n)

22
node/stmt/alt_else_if.go
View File

@ -7,16 +7,16 @@ import (
type AltElseIf struct {
attributes map[string]interface{}
position *node.Position
cond node.Node
stmt node.Node
Cond node.Node
Stmt node.Node
}
func NewAltElseIf(cond node.Node, stmt node.Node) node.Node {
func NewAltElseIf(Cond node.Node, Stmt node.Node) node.Node {
return &AltElseIf{
map[string]interface{}{},
nil,
cond,
stmt,
Cond,
Stmt,
}
}
@ -38,14 +38,14 @@ func (n AltElseIf) Walk(v node.Visitor) {
return
}
if n.cond != nil {
vv := v.GetChildrenVisitor("cond")
n.cond.Walk(vv)
if n.Cond != nil {
vv := v.GetChildrenVisitor("Cond")
n.Cond.Walk(vv)
}
if n.stmt != nil {
vv := v.GetChildrenVisitor("stmt")
n.stmt.Walk(vv)
if n.Stmt != nil {
vv := v.GetChildrenVisitor("Stmt")
n.Stmt.Walk(vv)
}
v.LeaveNode(n)

38
node/stmt/alt_if.go
View File

@ -7,18 +7,18 @@ import (
type AltIf struct {
attributes map[string]interface{}
position *node.Position
cond node.Node
stmt node.Node
elseIf []node.Node
Cond node.Node
Stmt node.Node
ElseIf []node.Node
_else node.Node
}
func NewAltIf(cond node.Node, stmt node.Node) node.Node {
func NewAltIf(Cond node.Node, Stmt node.Node) node.Node {
return &AltIf{
map[string]interface{}{},
nil,
cond,
stmt,
Cond,
Stmt,
nil,
nil,
}
@ -37,12 +37,12 @@ func (n AltIf) SetPosition(p *node.Position) node.Node {
return n
}
func (n AltIf) AddElseIf(elseIf node.Node) node.Node {
if n.elseIf == nil {
n.elseIf = make([]node.Node, 0)
func (n AltIf) AddElseIf(ElseIf node.Node) node.Node {
if n.ElseIf == nil {
n.ElseIf = make([]node.Node, 0)
}
n.elseIf = append(n.elseIf, elseIf)
n.ElseIf = append(n.ElseIf, ElseIf)
return n
}
@ -58,19 +58,19 @@ func (n AltIf) Walk(v node.Visitor) {
return
}
if n.cond != nil {
vv := v.GetChildrenVisitor("cond")
n.cond.Walk(vv)
if n.Cond != nil {
vv := v.GetChildrenVisitor("Cond")
n.Cond.Walk(vv)
}
if n.stmt != nil {
vv := v.GetChildrenVisitor("stmt")
n.stmt.Walk(vv)
if n.Stmt != nil {
vv := v.GetChildrenVisitor("Stmt")
n.Stmt.Walk(vv)
}
if n.elseIf != nil {
vv := v.GetChildrenVisitor("elseIf")
for _, nn := range n.elseIf {
if n.ElseIf != nil {
vv := v.GetChildrenVisitor("ElseIf")
for _, nn := range n.ElseIf {
nn.Walk(vv)
}
}

Some files were not shown because too many files have changed in this diff Show More