46 lines
776 B
Go
46 lines
776 B
Go
package binary_op
|
|
|
|
import (
|
|
"github.com/z7zmey/php-parser/node"
|
|
)
|
|
|
|
// LogicalAnd node
|
|
type LogicalAnd struct {
|
|
BinaryOp
|
|
}
|
|
|
|
// NewLogicalAnd node constuctor
|
|
func NewLogicalAnd(Variable node.Node, Expression node.Node) *LogicalAnd {
|
|
return &LogicalAnd{
|
|
BinaryOp{
|
|
Variable,
|
|
Expression,
|
|
},
|
|
}
|
|
}
|
|
|
|
// Attributes returns node attributes as map
|
|
func (n *LogicalAnd) Attributes() map[string]interface{} {
|
|
return nil
|
|
}
|
|
|
|
// Walk traverses nodes
|
|
// Walk is invoked recursively until v.EnterNode returns true
|
|
func (n *LogicalAnd) Walk(v node.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)
|
|
}
|