php-parser/node/expr/binary/n_greater_or_equal.go

66 lines
1.3 KiB
Go
Raw Normal View History

2018-02-19 11:12:09 +00:00
package binary
2017-12-12 21:26:00 +00:00
import (
"github.com/z7zmey/php-parser/meta"
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
// GreaterOrEqual node
2017-12-12 21:26:00 +00:00
type GreaterOrEqual struct {
Meta meta.Collection
2018-06-24 07:19:44 +00:00
Position *position.Position
Left node.Node
Right node.Node
2017-12-12 21:26:00 +00:00
}
2018-04-05 09:04:28 +00:00
// NewGreaterOrEqual node constructor
2018-01-08 19:18:09 +00:00
func NewGreaterOrEqual(Variable node.Node, Expression node.Node) *GreaterOrEqual {
2018-01-04 18:42:44 +00:00
return &GreaterOrEqual{
2018-06-24 07:19:44 +00:00
Left: Variable,
Right: 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 *GreaterOrEqual) SetPosition(p *position.Position) {
n.Position = p
}
// GetPosition returns node positions
func (n *GreaterOrEqual) GetPosition() *position.Position {
return n.Position
}
func (n *GreaterOrEqual) GetMeta() *meta.Collection {
return &n.Meta
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 *GreaterOrEqual) 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 *GreaterOrEqual) 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.Left != nil {
2018-06-18 20:29:52 +00:00
v.EnterChildNode("Left", n)
n.Left.Walk(v)
v.LeaveChildNode("Left", n)
2017-12-27 23:23:32 +00:00
}
2018-01-04 21:26:04 +00:00
if n.Right != nil {
2018-06-18 20:29:52 +00:00
v.EnterChildNode("Right", n)
n.Right.Walk(v)
v.LeaveChildNode("Right", 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
}