46 lines
822 B
Go
46 lines
822 B
Go
package binary_op
|
|
|
|
import (
|
|
"github.com/z7zmey/php-parser/node"
|
|
"github.com/z7zmey/php-parser/walker"
|
|
)
|
|
|
|
// BitwiseAnd node
|
|
type BitwiseAnd struct {
|
|
Left node.Node
|
|
Right node.Node
|
|
}
|
|
|
|
// NewBitwiseAnd node constuctor
|
|
func NewBitwiseAnd(Variable node.Node, Expression node.Node) *BitwiseAnd {
|
|
return &BitwiseAnd{
|
|
Variable,
|
|
Expression,
|
|
}
|
|
}
|
|
|
|
// Attributes returns node attributes as map
|
|
func (n *BitwiseAnd) Attributes() map[string]interface{} {
|
|
return nil
|
|
}
|
|
|
|
// Walk traverses nodes
|
|
// Walk is invoked recursively until v.EnterNode returns true
|
|
func (n *BitwiseAnd) Walk(v walker.Visitor) {
|
|
if v.EnterNode(n) == false {
|
|
return
|
|
}
|
|
|
|
if n.Left != nil {
|
|
vv := v.GetChildrenVisitor("Left")
|
|
n.Left.Walk(vv)
|
|
}
|
|
|
|
if n.Right != nil {
|
|
vv := v.GetChildrenVisitor("Right")
|
|
n.Right.Walk(vv)
|
|
}
|
|
|
|
v.LeaveNode(n)
|
|
}
|