2017-12-16 19:31:47 +00:00
|
|
|
package expr
|
|
|
|
|
|
|
|
import (
|
|
|
|
"github.com/z7zmey/php-parser/node"
|
|
|
|
)
|
|
|
|
|
2018-01-11 17:33:25 +00:00
|
|
|
// BooleanNot node
|
2017-12-16 19:31:47 +00:00
|
|
|
type BooleanNot struct {
|
2018-01-09 13:51:32 +00:00
|
|
|
Expr node.Node
|
2017-12-16 19:31:47 +00:00
|
|
|
}
|
|
|
|
|
2018-01-11 17:33:25 +00:00
|
|
|
// NewBooleanNot node constuctor
|
2018-01-08 19:18:09 +00:00
|
|
|
func NewBooleanNot(Expression node.Node) *BooleanNot {
|
2018-01-04 18:42:44 +00:00
|
|
|
return &BooleanNot{
|
2018-01-04 21:26:04 +00:00
|
|
|
Expression,
|
2017-12-16 19:31:47 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2018-01-11 17:33:25 +00:00
|
|
|
// Attributes returns node attributes as map
|
2018-01-08 19:32:57 +00:00
|
|
|
func (n *BooleanNot) Attributes() map[string]interface{} {
|
2018-01-04 22:12:01 +00:00
|
|
|
return nil
|
2017-12-29 15:20:24 +00:00
|
|
|
}
|
|
|
|
|
2018-01-11 17:33:25 +00:00
|
|
|
// Walk traverses nodes
|
|
|
|
// Walk is invoked recursively until v.EnterNode returns true
|
2018-01-08 19:32:57 +00:00
|
|
|
func (n *BooleanNot) 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
|
|
|
|
}
|
2017-12-16 19:31:47 +00:00
|
|
|
|
2018-01-04 22:12:01 +00:00
|
|
|
if n.Expr != nil {
|
|
|
|
vv := v.GetChildrenVisitor("Expr")
|
|
|
|
n.Expr.Walk(vv)
|
2017-12-16 19:31:47 +00:00
|
|
|
}
|
2017-12-28 11:36:27 +00:00
|
|
|
|
|
|
|
v.LeaveNode(n)
|
2017-12-16 19:31:47 +00:00
|
|
|
}
|