2018-02-19 11:12:09 +00:00
|
|
|
package assign
|
2017-12-12 21:26:00 +00:00
|
|
|
|
|
|
|
import (
|
2019-02-13 20:18:07 +00:00
|
|
|
"github.com/z7zmey/php-parser/freefloating"
|
2017-12-12 21:26:00 +00:00
|
|
|
"github.com/z7zmey/php-parser/node"
|
2018-06-24 07:19:44 +00:00
|
|
|
"github.com/z7zmey/php-parser/position"
|
2018-01-17 16:58:45 +00:00
|
|
|
"github.com/z7zmey/php-parser/walker"
|
2017-12-12 21:26:00 +00:00
|
|
|
)
|
|
|
|
|
2018-01-11 17:33:25 +00:00
|
|
|
// BitwiseAnd node
|
2017-12-12 21:26:00 +00:00
|
|
|
type BitwiseAnd struct {
|
2019-02-13 20:18:07 +00:00
|
|
|
FreeFloating freefloating.Collection
|
|
|
|
Position *position.Position
|
|
|
|
Variable node.Node
|
|
|
|
Expression node.Node
|
2017-12-12 21:26:00 +00:00
|
|
|
}
|
|
|
|
|
2018-04-05 09:04:28 +00:00
|
|
|
// NewBitwiseAnd node constructor
|
2018-01-08 19:18:09 +00:00
|
|
|
func NewBitwiseAnd(Variable node.Node, Expression node.Node) *BitwiseAnd {
|
2018-01-04 18:42:44 +00:00
|
|
|
return &BitwiseAnd{
|
2019-02-13 20:18:07 +00:00
|
|
|
FreeFloating: nil,
|
|
|
|
Variable: Variable,
|
|
|
|
Expression: Expression,
|
2017-12-12 21:26:00 +00:00
|
|
|
}
|
|
|
|
}
|
2017-12-27 23:23:32 +00:00
|
|
|
|
2018-06-24 07:19:44 +00:00
|
|
|
// SetPosition sets node position
|
|
|
|
func (n *BitwiseAnd) SetPosition(p *position.Position) {
|
|
|
|
n.Position = p
|
|
|
|
}
|
|
|
|
|
|
|
|
// GetPosition returns node positions
|
|
|
|
func (n *BitwiseAnd) GetPosition() *position.Position {
|
|
|
|
return n.Position
|
|
|
|
}
|
|
|
|
|
2019-02-13 20:18:07 +00:00
|
|
|
func (n *BitwiseAnd) GetFreeFloating() *freefloating.Collection {
|
|
|
|
return &n.FreeFloating
|
2018-06-25 12:38:31 +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 *BitwiseAnd) 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-17 16:58:45 +00:00
|
|
|
func (n *BitwiseAnd) Walk(v walker.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.Variable != nil {
|
2018-06-18 20:29:52 +00:00
|
|
|
v.EnterChildNode("Variable", n)
|
|
|
|
n.Variable.Walk(v)
|
|
|
|
v.LeaveChildNode("Variable", n)
|
2017-12-27 23:23:32 +00:00
|
|
|
}
|
|
|
|
|
2018-01-04 21:26:04 +00:00
|
|
|
if n.Expression != nil {
|
2018-06-18 20:29:52 +00:00
|
|
|
v.EnterChildNode("Expression", n)
|
|
|
|
n.Expression.Walk(v)
|
|
|
|
v.LeaveChildNode("Expression", n)
|
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
|
|
|
}
|