55 lines
890 B
Go
55 lines
890 B
Go
package binary_op
|
|
|
|
import (
|
|
"github.com/z7zmey/php-parser/node"
|
|
)
|
|
|
|
type BooleanAnd struct {
|
|
BinaryOp
|
|
}
|
|
|
|
func NewBooleanAnd(variable node.Node, expression node.Node) node.Node {
|
|
return BooleanAnd{
|
|
BinaryOp{
|
|
"BinaryBooleanAnd",
|
|
map[string]interface{}{},
|
|
variable,
|
|
expression,
|
|
},
|
|
}
|
|
}
|
|
|
|
func (n BooleanAnd) Name() string {
|
|
return "BooleanAnd"
|
|
}
|
|
|
|
func (n BooleanAnd) Attributes() map[string]interface{} {
|
|
return n.attributes
|
|
}
|
|
|
|
func (n BooleanAnd) Attribute(key string) interface{} {
|
|
return n.attributes[key]
|
|
}
|
|
|
|
func (n BooleanAnd) SetAttribute(key string, value interface{}) {
|
|
n.attributes[key] = value
|
|
}
|
|
|
|
func (n BooleanAnd) 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)
|
|
}
|