2018-02-19 13:12:09 +02:00
|
|
|
package binary
|
2017-12-12 23:26:00 +02:00
|
|
|
|
|
|
|
import (
|
|
|
|
"github.com/z7zmey/php-parser/node"
|
2018-01-17 18:58:45 +02:00
|
|
|
"github.com/z7zmey/php-parser/walker"
|
2017-12-12 23:26:00 +02:00
|
|
|
)
|
|
|
|
|
2018-01-11 19:33:25 +02:00
|
|
|
// BitwiseOr node
|
2017-12-12 23:26:00 +02:00
|
|
|
type BitwiseOr struct {
|
2018-02-10 01:02:50 +02:00
|
|
|
Left node.Node
|
|
|
|
Right node.Node
|
2017-12-12 23:26:00 +02:00
|
|
|
}
|
|
|
|
|
2018-01-11 19:33:25 +02:00
|
|
|
// NewBitwiseOr node constuctor
|
2018-01-08 21:18:09 +02:00
|
|
|
func NewBitwiseOr(Variable node.Node, Expression node.Node) *BitwiseOr {
|
2018-01-04 20:42:44 +02:00
|
|
|
return &BitwiseOr{
|
2018-02-10 01:02:50 +02:00
|
|
|
Variable,
|
|
|
|
Expression,
|
2017-12-12 23:26:00 +02:00
|
|
|
}
|
|
|
|
}
|
2017-12-27 19:55:58 +02:00
|
|
|
|
2018-01-11 19:33:25 +02:00
|
|
|
// Attributes returns node attributes as map
|
2018-01-08 21:32:57 +02:00
|
|
|
func (n *BitwiseOr) Attributes() map[string]interface{} {
|
2018-01-05 00:12:01 +02:00
|
|
|
return nil
|
2017-12-29 17:20:24 +02:00
|
|
|
}
|
|
|
|
|
2018-01-11 19:33:25 +02:00
|
|
|
// Walk traverses nodes
|
|
|
|
// Walk is invoked recursively until v.EnterNode returns true
|
2018-01-17 18:58:45 +02:00
|
|
|
func (n *BitwiseOr) Walk(v walker.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
|
|
|
}
|