Documentation ¶
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
This section is empty.
Types ¶
type Assign ¶
Assign node
func (*Assign) Attributes ¶
Attributes returns node attributes as map
type AssignRef ¶
AssignRef node
func NewAssignRef ¶
NewAssignRef node constuctor
func (*AssignRef) Attributes ¶
Attributes returns node attributes as map
type BitwiseAnd ¶
BitwiseAnd node
func NewBitwiseAnd ¶
func NewBitwiseAnd(Variable node.Node, Expression node.Node) *BitwiseAnd
NewBitwiseAnd node constuctor
func (*BitwiseAnd) Attributes ¶
func (n *BitwiseAnd) Attributes() map[string]interface{}
Attributes returns node attributes as map
func (*BitwiseAnd) Walk ¶
func (n *BitwiseAnd) Walk(v walker.Visitor)
Walk traverses nodes Walk is invoked recursively until v.EnterNode returns true
type BitwiseOr ¶
BitwiseOr node
func NewBitwiseOr ¶
NewBitwiseOr node constuctor
func (*BitwiseOr) Attributes ¶
Attributes returns node attributes as map
type BitwiseXor ¶
BitwiseXor node
func NewBitwiseXor ¶
func NewBitwiseXor(Variable node.Node, Expression node.Node) *BitwiseXor
NewBitwiseXor node constuctor
func (*BitwiseXor) Attributes ¶
func (n *BitwiseXor) Attributes() map[string]interface{}
Attributes returns node attributes as map
func (*BitwiseXor) Walk ¶
func (n *BitwiseXor) Walk(v walker.Visitor)
Walk traverses nodes Walk is invoked recursively until v.EnterNode returns true
type Concat ¶
Concat node
func (*Concat) Attributes ¶
Attributes returns node attributes as map
type Minus ¶
Minus node
func (*Minus) Attributes ¶
Attributes returns node attributes as map
type ShiftLeft ¶
ShiftLeft node
func NewShiftLeft ¶
NewShiftLeft node constuctor
func (*ShiftLeft) Attributes ¶
Attributes returns node attributes as map
type ShiftRight ¶
ShiftRight node
func NewShiftRight ¶
func NewShiftRight(Variable node.Node, Expression node.Node) *ShiftRight
NewShiftRight node constuctor
func (*ShiftRight) Attributes ¶
func (n *ShiftRight) Attributes() map[string]interface{}
Attributes returns node attributes as map
func (*ShiftRight) Walk ¶
func (n *ShiftRight) Walk(v walker.Visitor)
Walk traverses nodes Walk is invoked recursively until v.EnterNode returns true