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

extract positions package

Browse Source
This commit is contained in:
z7zmey
2018-01-09 15:51:32 +02:00
parent 23d938df99
commit 2078a6cde6
166 changed files with 2060 additions and 3030 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -5,7 +5,6 @@ import (
)
type BinaryOp struct {
position *node.Position
Left node.Node
Right node.Node
Left node.Node
Right node.Node
}

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

@@ -11,7 +11,6 @@ type BitwiseAnd struct {
func NewBitwiseAnd(Variable node.Node, Expression node.Node) *BitwiseAnd {
return &BitwiseAnd{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *BitwiseAnd) Attributes() map[string]interface{} {
return nil
}
func (n *BitwiseAnd) Position() *node.Position {
return n.position
}
func (n *BitwiseAnd) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *BitwiseAnd) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type BitwiseOr struct {
func NewBitwiseOr(Variable node.Node, Expression node.Node) *BitwiseOr {
return &BitwiseOr{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *BitwiseOr) Attributes() map[string]interface{} {
return nil
}
func (n *BitwiseOr) Position() *node.Position {
return n.position
}
func (n *BitwiseOr) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *BitwiseOr) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type BitwiseXor struct {
func NewBitwiseXor(Variable node.Node, Expression node.Node) *BitwiseXor {
return &BitwiseXor{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *BitwiseXor) Attributes() map[string]interface{} {
return nil
}
func (n *BitwiseXor) Position() *node.Position {
return n.position
}
func (n *BitwiseXor) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *BitwiseXor) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type BooleanAnd struct {
func NewBooleanAnd(Variable node.Node, Expression node.Node) *BooleanAnd {
return &BooleanAnd{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *BooleanAnd) Attributes() map[string]interface{} {
return nil
}
func (n *BooleanAnd) Position() *node.Position {
return n.position
}
func (n *BooleanAnd) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *BooleanAnd) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type BooleanOr struct {
func NewBooleanOr(Variable node.Node, Expression node.Node) *BooleanOr {
return &BooleanOr{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *BooleanOr) Attributes() map[string]interface{} {
return nil
}
func (n *BooleanOr) Position() *node.Position {
return n.position
}
func (n *BooleanOr) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *BooleanOr) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type Coalesce struct {
func NewCoalesce(Variable node.Node, Expression node.Node) *Coalesce {
return &Coalesce{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *Coalesce) Attributes() map[string]interface{} {
return nil
}
func (n *Coalesce) Position() *node.Position {
return n.position
}
func (n *Coalesce) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *Coalesce) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type Concat struct {
func NewConcat(Variable node.Node, Expression node.Node) *Concat {
return &Concat{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *Concat) Attributes() map[string]interface{} {
return nil
}
func (n *Concat) Position() *node.Position {
return n.position
}
func (n *Concat) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *Concat) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type Div struct {
func NewDiv(Variable node.Node, Expression node.Node) *Div {
return &Div{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *Div) Attributes() map[string]interface{} {
return nil
}
func (n *Div) Position() *node.Position {
return n.position
}
func (n *Div) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *Div) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type Equal struct {
func NewEqual(Variable node.Node, Expression node.Node) *Equal {
return &Equal{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *Equal) Attributes() map[string]interface{} {
return nil
}
func (n *Equal) Position() *node.Position {
return n.position
}
func (n *Equal) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *Equal) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type Greater struct {
func NewGreater(Variable node.Node, Expression node.Node) *Greater {
return &Greater{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *Greater) Attributes() map[string]interface{} {
return nil
}
func (n *Greater) Position() *node.Position {
return n.position
}
func (n *Greater) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *Greater) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type GreaterOrEqual struct {
func NewGreaterOrEqual(Variable node.Node, Expression node.Node) *GreaterOrEqual {
return &GreaterOrEqual{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *GreaterOrEqual) Attributes() map[string]interface{} {
return nil
}
func (n *GreaterOrEqual) Position() *node.Position {
return n.position
}
func (n *GreaterOrEqual) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *GreaterOrEqual) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type Identical struct {
func NewIdentical(Variable node.Node, Expression node.Node) *Identical {
return &Identical{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *Identical) Attributes() map[string]interface{} {
return nil
}
func (n *Identical) Position() *node.Position {
return n.position
}
func (n *Identical) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *Identical) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type LogicalAnd struct {
func NewLogicalAnd(Variable node.Node, Expression node.Node) *LogicalAnd {
return &LogicalAnd{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *LogicalAnd) Attributes() map[string]interface{} {
return nil
}
func (n *LogicalAnd) Position() *node.Position {
return n.position
}
func (n *LogicalAnd) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *LogicalAnd) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type LogicalOr struct {
func NewLogicalOr(Variable node.Node, Expression node.Node) *LogicalOr {
return &LogicalOr{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *LogicalOr) Attributes() map[string]interface{} {
return nil
}
func (n *LogicalOr) Position() *node.Position {
return n.position
}
func (n *LogicalOr) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *LogicalOr) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type LogicalXor struct {
func NewLogicalXor(Variable node.Node, Expression node.Node) *LogicalXor {
return &LogicalXor{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *LogicalXor) Attributes() map[string]interface{} {
return nil
}
func (n *LogicalXor) Position() *node.Position {
return n.position
}
func (n *LogicalXor) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *LogicalXor) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type Minus struct {
func NewMinus(Variable node.Node, Expression node.Node) *Minus {
return &Minus{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *Minus) Attributes() map[string]interface{} {
return nil
}
func (n *Minus) Position() *node.Position {
return n.position
}
func (n *Minus) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *Minus) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type Mod struct {
func NewMod(Variable node.Node, Expression node.Node) *Mod {
return &Mod{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *Mod) Attributes() map[string]interface{} {
return nil
}
func (n *Mod) Position() *node.Position {
return n.position
}
func (n *Mod) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *Mod) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type Mul struct {
func NewMul(Variable node.Node, Expression node.Node) *Mul {
return &Mul{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *Mul) Attributes() map[string]interface{} {
return nil
}
func (n *Mul) Position() *node.Position {
return n.position
}
func (n *Mul) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *Mul) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type NotEqual struct {
func NewNotEqual(Variable node.Node, Expression node.Node) *NotEqual {
return &NotEqual{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *NotEqual) Attributes() map[string]interface{} {
return nil
}
func (n *NotEqual) Position() *node.Position {
return n.position
}
func (n *NotEqual) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *NotEqual) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type NotIdentical struct {
func NewNotIdentical(Variable node.Node, Expression node.Node) *NotIdentical {
return &NotIdentical{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *NotIdentical) Attributes() map[string]interface{} {
return nil
}
func (n *NotIdentical) Position() *node.Position {
return n.position
}
func (n *NotIdentical) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *NotIdentical) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type Plus struct {
func NewPlus(Variable node.Node, Expression node.Node) *Plus {
return &Plus{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *Plus) Attributes() map[string]interface{} {
return nil
}
func (n *Plus) Position() *node.Position {
return n.position
}
func (n *Plus) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *Plus) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type Pow struct {
func NewPow(Variable node.Node, Expression node.Node) *Pow {
return &Pow{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *Pow) Attributes() map[string]interface{} {
return nil
}
func (n *Pow) Position() *node.Position {
return n.position
}
func (n *Pow) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *Pow) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type ShiftLeft struct {
func NewShiftLeft(Variable node.Node, Expression node.Node) *ShiftLeft {
return &ShiftLeft{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *ShiftLeft) Attributes() map[string]interface{} {
return nil
}
func (n *ShiftLeft) Position() *node.Position {
return n.position
}
func (n *ShiftLeft) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *ShiftLeft) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type ShiftRight struct {
func NewShiftRight(Variable node.Node, Expression node.Node) *ShiftRight {
return &ShiftRight{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *ShiftRight) Attributes() map[string]interface{} {
return nil
}
func (n *ShiftRight) Position() *node.Position {
return n.position
}
func (n *ShiftRight) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *ShiftRight) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type Smaller struct {
func NewSmaller(Variable node.Node, Expression node.Node) *Smaller {
return &Smaller{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *Smaller) Attributes() map[string]interface{} {
return nil
}
func (n *Smaller) Position() *node.Position {
return n.position
}
func (n *Smaller) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *Smaller) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type SmallerOrEqual struct {
func NewSmallerOrEqual(Variable node.Node, Expression node.Node) *SmallerOrEqual {
return &SmallerOrEqual{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *SmallerOrEqual) Attributes() map[string]interface{} {
return nil
}
func (n *SmallerOrEqual) Position() *node.Position {
return n.position
}
func (n *SmallerOrEqual) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *SmallerOrEqual) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return

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

@@ -11,7 +11,6 @@ type Spaceship struct {
func NewSpaceship(Variable node.Node, Expression node.Node) *Spaceship {
return &Spaceship{
BinaryOp{
nil,
Variable,
Expression,
},
@@ -22,15 +21,6 @@ func (n *Spaceship) Attributes() map[string]interface{} {
return nil
}
func (n *Spaceship) Position() *node.Position {
return n.position
}
func (n *Spaceship) SetPosition(p *node.Position) node.Node {
n.position = p
return n
}
func (n *Spaceship) Walk(v node.Visitor) {
if v.EnterNode(n) == false {
return