fix poiner receiver at nodes

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

View File

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

View File

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

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
}

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
}

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
}

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
}

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
}

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
}

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
}

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
}

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
}

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
}

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
}

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
}