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

walker pakage

Browse Source
This commit is contained in:
z7zmey
2018-01-17 18:58:45 +02:00
parent 6d90e1258f
commit 76df2ba69b
164 changed files with 368 additions and 210 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// BitwiseAnd node
@@ -26,7 +27,7 @@ func (n *BitwiseAnd) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *BitwiseAnd) Walk(v node.Visitor) {
func (n *BitwiseAnd) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// BitwiseOr node
@@ -26,7 +27,7 @@ func (n *BitwiseOr) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *BitwiseOr) Walk(v node.Visitor) {
func (n *BitwiseOr) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// BitwiseXor node
@@ -26,7 +27,7 @@ func (n *BitwiseXor) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *BitwiseXor) Walk(v node.Visitor) {
func (n *BitwiseXor) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// BooleanAnd node
@@ -26,7 +27,7 @@ func (n *BooleanAnd) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *BooleanAnd) Walk(v node.Visitor) {
func (n *BooleanAnd) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// BooleanOr node
@@ -26,7 +27,7 @@ func (n *BooleanOr) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *BooleanOr) Walk(v node.Visitor) {
func (n *BooleanOr) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// Coalesce node
@@ -26,7 +27,7 @@ func (n *Coalesce) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Coalesce) Walk(v node.Visitor) {
func (n *Coalesce) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// Concat node
@@ -26,7 +27,7 @@ func (n *Concat) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Concat) Walk(v node.Visitor) {
func (n *Concat) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// Div node
@@ -26,7 +27,7 @@ func (n *Div) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Div) Walk(v node.Visitor) {
func (n *Div) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// Equal node
@@ -26,7 +27,7 @@ func (n *Equal) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Equal) Walk(v node.Visitor) {
func (n *Equal) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// Greater node
@@ -26,7 +27,7 @@ func (n *Greater) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Greater) Walk(v node.Visitor) {
func (n *Greater) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// GreaterOrEqual node
@@ -26,7 +27,7 @@ func (n *GreaterOrEqual) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *GreaterOrEqual) Walk(v node.Visitor) {
func (n *GreaterOrEqual) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// Identical node
@@ -26,7 +27,7 @@ func (n *Identical) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Identical) Walk(v node.Visitor) {
func (n *Identical) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// LogicalAnd node
@@ -26,7 +27,7 @@ func (n *LogicalAnd) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *LogicalAnd) Walk(v node.Visitor) {
func (n *LogicalAnd) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// LogicalOr node
@@ -26,7 +27,7 @@ func (n *LogicalOr) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *LogicalOr) Walk(v node.Visitor) {
func (n *LogicalOr) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// LogicalXor node
@@ -26,7 +27,7 @@ func (n *LogicalXor) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *LogicalXor) Walk(v node.Visitor) {
func (n *LogicalXor) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// Minus node
@@ -26,7 +27,7 @@ func (n *Minus) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Minus) Walk(v node.Visitor) {
func (n *Minus) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// Mod node
@@ -26,7 +27,7 @@ func (n *Mod) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Mod) Walk(v node.Visitor) {
func (n *Mod) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// Mul node
@@ -26,7 +27,7 @@ func (n *Mul) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Mul) Walk(v node.Visitor) {
func (n *Mul) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// NotEqual node
@@ -26,7 +27,7 @@ func (n *NotEqual) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *NotEqual) Walk(v node.Visitor) {
func (n *NotEqual) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// NotIdentical node
@@ -26,7 +27,7 @@ func (n *NotIdentical) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *NotIdentical) Walk(v node.Visitor) {
func (n *NotIdentical) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// Plus node
@@ -26,7 +27,7 @@ func (n *Plus) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Plus) Walk(v node.Visitor) {
func (n *Plus) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// Pow node
@@ -26,7 +27,7 @@ func (n *Pow) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Pow) Walk(v node.Visitor) {
func (n *Pow) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// ShiftLeft node
@@ -26,7 +27,7 @@ func (n *ShiftLeft) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *ShiftLeft) Walk(v node.Visitor) {
func (n *ShiftLeft) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// ShiftRight node
@@ -26,7 +27,7 @@ func (n *ShiftRight) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *ShiftRight) Walk(v node.Visitor) {
func (n *ShiftRight) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// Smaller node
@@ -26,7 +27,7 @@ func (n *Smaller) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Smaller) Walk(v node.Visitor) {
func (n *Smaller) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// SmallerOrEqual node
@@ -26,7 +27,7 @@ func (n *SmallerOrEqual) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *SmallerOrEqual) Walk(v node.Visitor) {
func (n *SmallerOrEqual) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}

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

@@ -2,6 +2,7 @@ package binary_op
import (
"github.com/z7zmey/php-parser/node"
"github.com/z7zmey/php-parser/walker"
)
// Spaceship node
@@ -26,7 +27,7 @@ func (n *Spaceship) Attributes() map[string]interface{} {
// Walk traverses nodes
// Walk is invoked recursively until v.EnterNode returns true
func (n *Spaceship) Walk(v node.Visitor) {
func (n *Spaceship) Walk(v walker.Visitor) {
if v.EnterNode(n) == false {
return
}