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

fix poiner receiver at nodes

Browse Source
This commit is contained in:
z7zmey
2018-01-08 21:32:57 +02:00
parent 855665b565
commit 4ecb9edbd8
154 changed files with 1421 additions and 1416 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -20,29 +20,29 @@ func NewBitwiseAnd(Variable node.Node, Expression node.Node) *BitwiseAnd {
}
}
func (n BitwiseAnd) Attributes() map[string]interface{} {
func (n *BitwiseAnd) Attributes() map[string]interface{} {
return nil
}
func (n BitwiseAnd) Position() *node.Position {
func (n *BitwiseAnd) Position() *node.Position {
return n.position
}
func (n BitwiseAnd) SetPosition(p *node.Position) node.Node {
func (n *BitwiseAnd) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n BitwiseAnd) Comments() *[]comment.Comment {
func (n *BitwiseAnd) Comments() *[]comment.Comment {
return n.comments
}
func (n BitwiseAnd) SetComments(c *[]comment.Comment) node.Node {
func (n *BitwiseAnd) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n BitwiseAnd) Walk(v node.Visitor) {
func (n *BitwiseAnd) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewBitwiseOr(Variable node.Node, Expression node.Node) *BitwiseOr {
}
}
func (n BitwiseOr) Attributes() map[string]interface{} {
func (n *BitwiseOr) Attributes() map[string]interface{} {
return nil
}
func (n BitwiseOr) Position() *node.Position {
func (n *BitwiseOr) Position() *node.Position {
return n.position
}
func (n BitwiseOr) SetPosition(p *node.Position) node.Node {
func (n *BitwiseOr) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n BitwiseOr) Comments() *[]comment.Comment {
func (n *BitwiseOr) Comments() *[]comment.Comment {
return n.comments
}
func (n BitwiseOr) SetComments(c *[]comment.Comment) node.Node {
func (n *BitwiseOr) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n BitwiseOr) Walk(v node.Visitor) {
func (n *BitwiseOr) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewBitwiseXor(Variable node.Node, Expression node.Node) *BitwiseXor {
}
}
func (n BitwiseXor) Attributes() map[string]interface{} {
func (n *BitwiseXor) Attributes() map[string]interface{} {
return nil
}
func (n BitwiseXor) Position() *node.Position {
func (n *BitwiseXor) Position() *node.Position {
return n.position
}
func (n BitwiseXor) SetPosition(p *node.Position) node.Node {
func (n *BitwiseXor) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n BitwiseXor) Comments() *[]comment.Comment {
func (n *BitwiseXor) Comments() *[]comment.Comment {
return n.comments
}
func (n BitwiseXor) SetComments(c *[]comment.Comment) node.Node {
func (n *BitwiseXor) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n BitwiseXor) Walk(v node.Visitor) {
func (n *BitwiseXor) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewBooleanAnd(Variable node.Node, Expression node.Node) *BooleanAnd {
}
}
func (n BooleanAnd) Attributes() map[string]interface{} {
func (n *BooleanAnd) Attributes() map[string]interface{} {
return nil
}
func (n BooleanAnd) Position() *node.Position {
func (n *BooleanAnd) Position() *node.Position {
return n.position
}
func (n BooleanAnd) SetPosition(p *node.Position) node.Node {
func (n *BooleanAnd) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n BooleanAnd) Comments() *[]comment.Comment {
func (n *BooleanAnd) Comments() *[]comment.Comment {
return n.comments
}
func (n BooleanAnd) SetComments(c *[]comment.Comment) node.Node {
func (n *BooleanAnd) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n BooleanAnd) Walk(v node.Visitor) {
func (n *BooleanAnd) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewBooleanOr(Variable node.Node, Expression node.Node) *BooleanOr {
}
}
func (n BooleanOr) Attributes() map[string]interface{} {
func (n *BooleanOr) Attributes() map[string]interface{} {
return nil
}
func (n BooleanOr) Position() *node.Position {
func (n *BooleanOr) Position() *node.Position {
return n.position
}
func (n BooleanOr) SetPosition(p *node.Position) node.Node {
func (n *BooleanOr) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n BooleanOr) Comments() *[]comment.Comment {
func (n *BooleanOr) Comments() *[]comment.Comment {
return n.comments
}
func (n BooleanOr) SetComments(c *[]comment.Comment) node.Node {
func (n *BooleanOr) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n BooleanOr) Walk(v node.Visitor) {
func (n *BooleanOr) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewCoalesce(Variable node.Node, Expression node.Node) *Coalesce {
}
}
func (n Coalesce) Attributes() map[string]interface{} {
func (n *Coalesce) Attributes() map[string]interface{} {
return nil
}
func (n Coalesce) Position() *node.Position {
func (n *Coalesce) Position() *node.Position {
return n.position
}
func (n Coalesce) SetPosition(p *node.Position) node.Node {
func (n *Coalesce) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n Coalesce) Comments() *[]comment.Comment {
func (n *Coalesce) Comments() *[]comment.Comment {
return n.comments
}
func (n Coalesce) SetComments(c *[]comment.Comment) node.Node {
func (n *Coalesce) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n Coalesce) Walk(v node.Visitor) {
func (n *Coalesce) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewConcat(Variable node.Node, Expression node.Node) *Concat {
}
}
func (n Concat) Attributes() map[string]interface{} {
func (n *Concat) Attributes() map[string]interface{} {
return nil
}
func (n Concat) Position() *node.Position {
func (n *Concat) Position() *node.Position {
return n.position
}
func (n Concat) SetPosition(p *node.Position) node.Node {
func (n *Concat) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n Concat) Comments() *[]comment.Comment {
func (n *Concat) Comments() *[]comment.Comment {
return n.comments
}
func (n Concat) SetComments(c *[]comment.Comment) node.Node {
func (n *Concat) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n Concat) Walk(v node.Visitor) {
func (n *Concat) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewDiv(Variable node.Node, Expression node.Node) *Div {
}
}
func (n Div) Attributes() map[string]interface{} {
func (n *Div) Attributes() map[string]interface{} {
return nil
}
func (n Div) Position() *node.Position {
func (n *Div) Position() *node.Position {
return n.position
}
func (n Div) SetPosition(p *node.Position) node.Node {
func (n *Div) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n Div) Comments() *[]comment.Comment {
func (n *Div) Comments() *[]comment.Comment {
return n.comments
}
func (n Div) SetComments(c *[]comment.Comment) node.Node {
func (n *Div) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n Div) Walk(v node.Visitor) {
func (n *Div) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewEqual(Variable node.Node, Expression node.Node) *Equal {
}
}
func (n Equal) Attributes() map[string]interface{} {
func (n *Equal) Attributes() map[string]interface{} {
return nil
}
func (n Equal) Position() *node.Position {
func (n *Equal) Position() *node.Position {
return n.position
}
func (n Equal) SetPosition(p *node.Position) node.Node {
func (n *Equal) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n Equal) Comments() *[]comment.Comment {
func (n *Equal) Comments() *[]comment.Comment {
return n.comments
}
func (n Equal) SetComments(c *[]comment.Comment) node.Node {
func (n *Equal) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n Equal) Walk(v node.Visitor) {
func (n *Equal) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewGreater(Variable node.Node, Expression node.Node) *Greater {
}
}
func (n Greater) Attributes() map[string]interface{} {
func (n *Greater) Attributes() map[string]interface{} {
return nil
}
func (n Greater) Position() *node.Position {
func (n *Greater) Position() *node.Position {
return n.position
}
func (n Greater) SetPosition(p *node.Position) node.Node {
func (n *Greater) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n Greater) Comments() *[]comment.Comment {
func (n *Greater) Comments() *[]comment.Comment {
return n.comments
}
func (n Greater) SetComments(c *[]comment.Comment) node.Node {
func (n *Greater) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n Greater) Walk(v node.Visitor) {
func (n *Greater) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewGreaterOrEqual(Variable node.Node, Expression node.Node) *GreaterOrEqual
}
}
func (n GreaterOrEqual) Attributes() map[string]interface{} {
func (n *GreaterOrEqual) Attributes() map[string]interface{} {
return nil
}
func (n GreaterOrEqual) Position() *node.Position {
func (n *GreaterOrEqual) Position() *node.Position {
return n.position
}
func (n GreaterOrEqual) SetPosition(p *node.Position) node.Node {
func (n *GreaterOrEqual) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n GreaterOrEqual) Comments() *[]comment.Comment {
func (n *GreaterOrEqual) Comments() *[]comment.Comment {
return n.comments
}
func (n GreaterOrEqual) SetComments(c *[]comment.Comment) node.Node {
func (n *GreaterOrEqual) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n GreaterOrEqual) Walk(v node.Visitor) {
func (n *GreaterOrEqual) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewIdentical(Variable node.Node, Expression node.Node) *Identical {
}
}
func (n Identical) Attributes() map[string]interface{} {
func (n *Identical) Attributes() map[string]interface{} {
return nil
}
func (n Identical) Position() *node.Position {
func (n *Identical) Position() *node.Position {
return n.position
}
func (n Identical) SetPosition(p *node.Position) node.Node {
func (n *Identical) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n Identical) Comments() *[]comment.Comment {
func (n *Identical) Comments() *[]comment.Comment {
return n.comments
}
func (n Identical) SetComments(c *[]comment.Comment) node.Node {
func (n *Identical) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n Identical) Walk(v node.Visitor) {
func (n *Identical) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewLogicalAnd(Variable node.Node, Expression node.Node) *LogicalAnd {
}
}
func (n LogicalAnd) Attributes() map[string]interface{} {
func (n *LogicalAnd) Attributes() map[string]interface{} {
return nil
}
func (n LogicalAnd) Position() *node.Position {
func (n *LogicalAnd) Position() *node.Position {
return n.position
}
func (n LogicalAnd) SetPosition(p *node.Position) node.Node {
func (n *LogicalAnd) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n LogicalAnd) Comments() *[]comment.Comment {
func (n *LogicalAnd) Comments() *[]comment.Comment {
return n.comments
}
func (n LogicalAnd) SetComments(c *[]comment.Comment) node.Node {
func (n *LogicalAnd) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n LogicalAnd) Walk(v node.Visitor) {
func (n *LogicalAnd) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewLogicalOr(Variable node.Node, Expression node.Node) *LogicalOr {
}
}
func (n LogicalOr) Attributes() map[string]interface{} {
func (n *LogicalOr) Attributes() map[string]interface{} {
return nil
}
func (n LogicalOr) Position() *node.Position {
func (n *LogicalOr) Position() *node.Position {
return n.position
}
func (n LogicalOr) SetPosition(p *node.Position) node.Node {
func (n *LogicalOr) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n LogicalOr) Comments() *[]comment.Comment {
func (n *LogicalOr) Comments() *[]comment.Comment {
return n.comments
}
func (n LogicalOr) SetComments(c *[]comment.Comment) node.Node {
func (n *LogicalOr) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n LogicalOr) Walk(v node.Visitor) {
func (n *LogicalOr) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewLogicalXor(Variable node.Node, Expression node.Node) *LogicalXor {
}
}
func (n LogicalXor) Attributes() map[string]interface{} {
func (n *LogicalXor) Attributes() map[string]interface{} {
return nil
}
func (n LogicalXor) Position() *node.Position {
func (n *LogicalXor) Position() *node.Position {
return n.position
}
func (n LogicalXor) SetPosition(p *node.Position) node.Node {
func (n *LogicalXor) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n LogicalXor) Comments() *[]comment.Comment {
func (n *LogicalXor) Comments() *[]comment.Comment {
return n.comments
}
func (n LogicalXor) SetComments(c *[]comment.Comment) node.Node {
func (n *LogicalXor) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n LogicalXor) Walk(v node.Visitor) {
func (n *LogicalXor) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewMinus(Variable node.Node, Expression node.Node) *Minus {
}
}
func (n Minus) Attributes() map[string]interface{} {
func (n *Minus) Attributes() map[string]interface{} {
return nil
}
func (n Minus) Position() *node.Position {
func (n *Minus) Position() *node.Position {
return n.position
}
func (n Minus) SetPosition(p *node.Position) node.Node {
func (n *Minus) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n Minus) Comments() *[]comment.Comment {
func (n *Minus) Comments() *[]comment.Comment {
return n.comments
}
func (n Minus) SetComments(c *[]comment.Comment) node.Node {
func (n *Minus) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n Minus) Walk(v node.Visitor) {
func (n *Minus) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewMod(Variable node.Node, Expression node.Node) *Mod {
}
}
func (n Mod) Attributes() map[string]interface{} {
func (n *Mod) Attributes() map[string]interface{} {
return nil
}
func (n Mod) Position() *node.Position {
func (n *Mod) Position() *node.Position {
return n.position
}
func (n Mod) SetPosition(p *node.Position) node.Node {
func (n *Mod) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n Mod) Comments() *[]comment.Comment {
func (n *Mod) Comments() *[]comment.Comment {
return n.comments
}
func (n Mod) SetComments(c *[]comment.Comment) node.Node {
func (n *Mod) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n Mod) Walk(v node.Visitor) {
func (n *Mod) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewMul(Variable node.Node, Expression node.Node) *Mul {
}
}
func (n Mul) Attributes() map[string]interface{} {
func (n *Mul) Attributes() map[string]interface{} {
return nil
}
func (n Mul) Position() *node.Position {
func (n *Mul) Position() *node.Position {
return n.position
}
func (n Mul) SetPosition(p *node.Position) node.Node {
func (n *Mul) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n Mul) Comments() *[]comment.Comment {
func (n *Mul) Comments() *[]comment.Comment {
return n.comments
}
func (n Mul) SetComments(c *[]comment.Comment) node.Node {
func (n *Mul) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n Mul) Walk(v node.Visitor) {
func (n *Mul) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewNotEqual(Variable node.Node, Expression node.Node) *NotEqual {
}
}
func (n NotEqual) Attributes() map[string]interface{} {
func (n *NotEqual) Attributes() map[string]interface{} {
return nil
}
func (n NotEqual) Position() *node.Position {
func (n *NotEqual) Position() *node.Position {
return n.position
}
func (n NotEqual) SetPosition(p *node.Position) node.Node {
func (n *NotEqual) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n NotEqual) Comments() *[]comment.Comment {
func (n *NotEqual) Comments() *[]comment.Comment {
return n.comments
}
func (n NotEqual) SetComments(c *[]comment.Comment) node.Node {
func (n *NotEqual) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n NotEqual) Walk(v node.Visitor) {
func (n *NotEqual) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewNotIdentical(Variable node.Node, Expression node.Node) *NotIdentical {
}
}
func (n NotIdentical) Attributes() map[string]interface{} {
func (n *NotIdentical) Attributes() map[string]interface{} {
return nil
}
func (n NotIdentical) Position() *node.Position {
func (n *NotIdentical) Position() *node.Position {
return n.position
}
func (n NotIdentical) SetPosition(p *node.Position) node.Node {
func (n *NotIdentical) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n NotIdentical) Comments() *[]comment.Comment {
func (n *NotIdentical) Comments() *[]comment.Comment {
return n.comments
}
func (n NotIdentical) SetComments(c *[]comment.Comment) node.Node {
func (n *NotIdentical) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n NotIdentical) Walk(v node.Visitor) {
func (n *NotIdentical) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewPlus(Variable node.Node, Expression node.Node) *Plus {
}
}
func (n Plus) Attributes() map[string]interface{} {
func (n *Plus) Attributes() map[string]interface{} {
return nil
}
func (n Plus) Position() *node.Position {
func (n *Plus) Position() *node.Position {
return n.position
}
func (n Plus) SetPosition(p *node.Position) node.Node {
func (n *Plus) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n Plus) Comments() *[]comment.Comment {
func (n *Plus) Comments() *[]comment.Comment {
return n.comments
}
func (n Plus) SetComments(c *[]comment.Comment) node.Node {
func (n *Plus) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n Plus) Walk(v node.Visitor) {
func (n *Plus) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewPow(Variable node.Node, Expression node.Node) *Pow {
}
}
func (n Pow) Attributes() map[string]interface{} {
func (n *Pow) Attributes() map[string]interface{} {
return nil
}
func (n Pow) Position() *node.Position {
func (n *Pow) Position() *node.Position {
return n.position
}
func (n Pow) SetPosition(p *node.Position) node.Node {
func (n *Pow) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n Pow) Comments() *[]comment.Comment {
func (n *Pow) Comments() *[]comment.Comment {
return n.comments
}
func (n Pow) SetComments(c *[]comment.Comment) node.Node {
func (n *Pow) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n Pow) Walk(v node.Visitor) {
func (n *Pow) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewShiftLeft(Variable node.Node, Expression node.Node) *ShiftLeft {
}
}
func (n ShiftLeft) Attributes() map[string]interface{} {
func (n *ShiftLeft) Attributes() map[string]interface{} {
return nil
}
func (n ShiftLeft) Position() *node.Position {
func (n *ShiftLeft) Position() *node.Position {
return n.position
}
func (n ShiftLeft) SetPosition(p *node.Position) node.Node {
func (n *ShiftLeft) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n ShiftLeft) Comments() *[]comment.Comment {
func (n *ShiftLeft) Comments() *[]comment.Comment {
return n.comments
}
func (n ShiftLeft) SetComments(c *[]comment.Comment) node.Node {
func (n *ShiftLeft) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n ShiftLeft) Walk(v node.Visitor) {
func (n *ShiftLeft) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewShiftRight(Variable node.Node, Expression node.Node) *ShiftRight {
}
}
func (n ShiftRight) Attributes() map[string]interface{} {
func (n *ShiftRight) Attributes() map[string]interface{} {
return nil
}
func (n ShiftRight) Position() *node.Position {
func (n *ShiftRight) Position() *node.Position {
return n.position
}
func (n ShiftRight) SetPosition(p *node.Position) node.Node {
func (n *ShiftRight) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n ShiftRight) Comments() *[]comment.Comment {
func (n *ShiftRight) Comments() *[]comment.Comment {
return n.comments
}
func (n ShiftRight) SetComments(c *[]comment.Comment) node.Node {
func (n *ShiftRight) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n ShiftRight) Walk(v node.Visitor) {
func (n *ShiftRight) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewSmaller(Variable node.Node, Expression node.Node) *Smaller {
}
}
func (n Smaller) Attributes() map[string]interface{} {
func (n *Smaller) Attributes() map[string]interface{} {
return nil
}
func (n Smaller) Position() *node.Position {
func (n *Smaller) Position() *node.Position {
return n.position
}
func (n Smaller) SetPosition(p *node.Position) node.Node {
func (n *Smaller) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n Smaller) Comments() *[]comment.Comment {
func (n *Smaller) Comments() *[]comment.Comment {
return n.comments
}
func (n Smaller) SetComments(c *[]comment.Comment) node.Node {
func (n *Smaller) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n Smaller) Walk(v node.Visitor) {
func (n *Smaller) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewSmallerOrEqual(Variable node.Node, Expression node.Node) *SmallerOrEqual
}
}
func (n SmallerOrEqual) Attributes() map[string]interface{} {
func (n *SmallerOrEqual) Attributes() map[string]interface{} {
return nil
}
func (n SmallerOrEqual) Position() *node.Position {
func (n *SmallerOrEqual) Position() *node.Position {
return n.position
}
func (n SmallerOrEqual) SetPosition(p *node.Position) node.Node {
func (n *SmallerOrEqual) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n SmallerOrEqual) Comments() *[]comment.Comment {
func (n *SmallerOrEqual) Comments() *[]comment.Comment {
return n.comments
}
func (n SmallerOrEqual) SetComments(c *[]comment.Comment) node.Node {
func (n *SmallerOrEqual) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n SmallerOrEqual) Walk(v node.Visitor) {
func (n *SmallerOrEqual) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -20,29 +20,29 @@ func NewSpaceship(Variable node.Node, Expression node.Node) *Spaceship {
}
}
func (n Spaceship) Attributes() map[string]interface{} {
func (n *Spaceship) Attributes() map[string]interface{} {
return nil
}
func (n Spaceship) Position() *node.Position {
func (n *Spaceship) Position() *node.Position {
return n.position
}
func (n Spaceship) SetPosition(p *node.Position) node.Node {
func (n *Spaceship) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n Spaceship) Comments() *[]comment.Comment {
func (n *Spaceship) Comments() *[]comment.Comment {
return n.comments
}
func (n Spaceship) SetComments(c *[]comment.Comment) node.Node {
func (n *Spaceship) SetComments(c *[]comment.Comment) node.Node {
n.comments = c
return n
}
func (n Spaceship) Walk(v node.Visitor) {
func (n *Spaceship) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return
}