60 lines
1.2 KiB
Go
60 lines
1.2 KiB
Go
package binary
|
|
|
|
import (
|
|
"github.com/z7zmey/php-parser/node"
|
|
"github.com/z7zmey/php-parser/position"
|
|
"github.com/z7zmey/php-parser/walker"
|
|
)
|
|
|
|
// LogicalAnd node
|
|
type LogicalAnd struct {
|
|
Position *position.Position
|
|
Left node.Node
|
|
Right node.Node
|
|
}
|
|
|
|
// NewLogicalAnd node constructor
|
|
func NewLogicalAnd(Variable node.Node, Expression node.Node) *LogicalAnd {
|
|
return &LogicalAnd{
|
|
Left: Variable,
|
|
Right: Expression,
|
|
}
|
|
}
|
|
|
|
// SetPosition sets node position
|
|
func (n *LogicalAnd) SetPosition(p *position.Position) {
|
|
n.Position = p
|
|
}
|
|
|
|
// GetPosition returns node positions
|
|
func (n *LogicalAnd) GetPosition() *position.Position {
|
|
return n.Position
|
|
}
|
|
|
|
// Attributes returns node attributes as map
|
|
func (n *LogicalAnd) Attributes() map[string]interface{} {
|
|
return nil
|
|
}
|
|
|
|
// Walk traverses nodes
|
|
// Walk is invoked recursively until v.EnterNode returns true
|
|
func (n *LogicalAnd) Walk(v walker.Visitor) {
|
|
if v.EnterNode(n) == false {
|
|
return
|
|
}
|
|
|
|
if n.Left != nil {
|
|
v.EnterChildNode("Left", n)
|
|
n.Left.Walk(v)
|
|
v.LeaveChildNode("Left", n)
|
|
}
|
|
|
|
if n.Right != nil {
|
|
v.EnterChildNode("Right", n)
|
|
n.Right.Walk(v)
|
|
v.LeaveChildNode("Right", n)
|
|
}
|
|
|
|
v.LeaveNode(n)
|
|
}
|