2017-12-12 23:26:00 +02:00
|
|
|
package binary_op
|
|
|
|
|
|
|
|
import (
|
|
|
|
"github.com/z7zmey/php-parser/node"
|
|
|
|
)
|
|
|
|
|
|
|
|
type NotEqual struct {
|
|
|
|
BinaryOp
|
|
|
|
}
|
|
|
|
|
2018-01-04 23:26:04 +02:00
|
|
|
func NewNotEqual(Variable node.Node, Expression node.Node) node.Node {
|
2018-01-04 20:42:44 +02:00
|
|
|
return &NotEqual{
|
2017-12-12 23:26:00 +02:00
|
|
|
BinaryOp{
|
2017-12-31 12:59:22 +02:00
|
|
|
nil,
|
2018-01-04 23:26:04 +02:00
|
|
|
Variable,
|
|
|
|
Expression,
|
2017-12-12 23:26:00 +02:00
|
|
|
},
|
|
|
|
}
|
|
|
|
}
|
2017-12-28 01:23:32 +02:00
|
|
|
|
2017-12-29 17:20:24 +02:00
|
|
|
func (n NotEqual) Attributes() map[string]interface{} {
|
2018-01-05 00:12:01 +02:00
|
|
|
return nil
|
2017-12-29 17:20:24 +02:00
|
|
|
}
|
|
|
|
|
2017-12-31 12:59:22 +02:00
|
|
|
func (n NotEqual) Position() *node.Position {
|
|
|
|
return n.position
|
|
|
|
}
|
|
|
|
|
|
|
|
func (n NotEqual) SetPosition(p *node.Position) node.Node {
|
|
|
|
n.position = p
|
|
|
|
return n
|
|
|
|
}
|
|
|
|
|
2017-12-28 01:23:32 +02:00
|
|
|
func (n NotEqual) Walk(v node.Visitor) {
|
2017-12-28 13:36:27 +02:00
|
|
|
if v.EnterNode(n) == false {
|
2017-12-28 01:23:32 +02:00
|
|
|
return
|
|
|
|
}
|
|
|
|
|
2018-01-04 23:26:04 +02:00
|
|
|
if n.Left != nil {
|
|
|
|
vv := v.GetChildrenVisitor("Left")
|
|
|
|
n.Left.Walk(vv)
|
2017-12-28 01:23:32 +02:00
|
|
|
}
|
|
|
|
|
2018-01-04 23:26:04 +02:00
|
|
|
if n.Right != nil {
|
|
|
|
vv := v.GetChildrenVisitor("Right")
|
|
|
|
n.Right.Walk(vv)
|
2017-12-28 01:23:32 +02:00
|
|
|
}
|
2017-12-28 13:36:27 +02:00
|
|
|
|
|
|
|
v.LeaveNode(n)
|
2017-12-28 01:23:32 +02:00
|
|
|
}
|