2017-12-12 21:26:00 +00:00
|
|
|
package binary_op
|
|
|
|
|
|
|
|
import (
|
|
|
|
"github.com/z7zmey/php-parser/node"
|
|
|
|
)
|
|
|
|
|
|
|
|
type LogicalAnd struct {
|
|
|
|
BinaryOp
|
|
|
|
}
|
|
|
|
|
2018-01-08 19:18:09 +00:00
|
|
|
func NewLogicalAnd(Variable node.Node, Expression node.Node) *LogicalAnd {
|
2018-01-04 18:42:44 +00:00
|
|
|
return &LogicalAnd{
|
2017-12-12 21:26:00 +00:00
|
|
|
BinaryOp{
|
2018-01-04 21:26:04 +00:00
|
|
|
Variable,
|
|
|
|
Expression,
|
2017-12-12 21:26:00 +00:00
|
|
|
},
|
|
|
|
}
|
|
|
|
}
|
2017-12-27 23:23:32 +00:00
|
|
|
|
2018-01-08 19:32:57 +00:00
|
|
|
func (n *LogicalAnd) Attributes() map[string]interface{} {
|
2018-01-04 22:12:01 +00:00
|
|
|
return nil
|
2017-12-29 15:20:24 +00:00
|
|
|
}
|
|
|
|
|
2018-01-08 19:32:57 +00:00
|
|
|
func (n *LogicalAnd) Walk(v node.Visitor) {
|
2017-12-28 11:36:27 +00:00
|
|
|
if v.EnterNode(n) == false {
|
2017-12-27 23:23:32 +00:00
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2018-01-04 21:26:04 +00:00
|
|
|
if n.Left != nil {
|
|
|
|
vv := v.GetChildrenVisitor("Left")
|
|
|
|
n.Left.Walk(vv)
|
2017-12-27 23:23:32 +00:00
|
|
|
}
|
|
|
|
|
2018-01-04 21:26:04 +00:00
|
|
|
if n.Right != nil {
|
|
|
|
vv := v.GetChildrenVisitor("Right")
|
|
|
|
n.Right.Walk(vv)
|
2017-12-27 23:23:32 +00:00
|
|
|
}
|
2017-12-28 11:36:27 +00:00
|
|
|
|
|
|
|
v.LeaveNode(n)
|
2017-12-27 23:23:32 +00:00
|
|
|
}
|