tools

Documentation

Index

• func Filter(node *uast.Node, xpath string) ([]*uast.Node, error)
• func FilterBool(node *uast.Node, xpath string) (bool, error)
• func FilterNumber(node *uast.Node, xpath string) (float64, error)
• func FilterString(node *uast.Node, xpath string) (string, error)
• type Iterator
  • func NewIterator(node *uast.Node, order TreeOrder) (*Iterator, error)
  • func (i *Iterator) Dispose()
  • func (i *Iterator) Iterate() <-chan *uast.Node
  • func (i *Iterator) Next() (*uast.Node, error)
• type TreeOrder

Functions

func Filter

func Filter(node *uast.Node, xpath string) ([]*uast.Node, error)

Filter takes a `*uast.Node` and a xpath query and filters the tree, returning the list of nodes that satisfy the given query. Filter is thread-safe but not concurrent by an internal global lock.

func FilterBool

func FilterBool(node *uast.Node, xpath string) (bool, error)

FilterBool takes a `*uast.Node` and a xpath query with a boolean return type (e.g. when using XPath functions returning a boolean type). FilterBool is thread-safe but not concurrent by an internal global lock.

func FilterNumber

func FilterNumber(node *uast.Node, xpath string) (float64, error)

FilterBool takes a `*uast.Node` and a xpath query with a float return type (e.g. when using XPath functions returning a float type). FilterNumber is thread-safe but not concurrent by an internal global lock.

func FilterString

func FilterString(node *uast.Node, xpath string) (string, error)

FilterString takes a `*uast.Node` and a xpath query with a string return type (e.g. when using XPath functions returning a string type). FilterString is thread-safe but not concurrent by an internal global lock.

Types

type Iterator

type Iterator struct {
	// contains filtered or unexported fields
}

Iterator allows for traversal over a UAST tree.

func NewIterator

func NewIterator(node *uast.Node, order TreeOrder) (*Iterator, error)

NewIterator constructs a new Iterator starting from the given `Node` and iterating with the traversal strategy given by the `order` parameter. Once the iteration have finished or you don't need the iterator anymore you must dispose it with the Dispose() method (or call it with `defer`).

func (*Iterator) Dispose

func (i *Iterator) Dispose()

Dispose must be called once you've finished using the iterator or preventively with `defer` to free the iterator resources. Failing to do so would produce a memory leak.

func (*Iterator) Iterate

func (i *Iterator) Iterate() <-chan *uast.Node

Iterate function is similar to Next() but returns the `Node`s in a channel. It's mean to be used with the `for node := range myIter.Iterate() {}` loop.

func (*Iterator) Next

func (i *Iterator) Next() (*uast.Node, error)

Next retrieves the next `Node` in the tree's traversal or `nil` if there are no more nodes. Calling `Next()` on a finished iterator after the first `nil` will return an error.This is thread-safe but not concurrent by an internal global lock.

type TreeOrder

type TreeOrder int

TreeOrder represents the traversal strategy for UAST trees

const (
	// PreOrder traversal
	PreOrder TreeOrder = iota
	// PostOrder traversal
	PostOrder
	// LevelOrder (aka breadth-first) traversal
	LevelOrder
	// PositionOrder by node position in the source file
	PositionOrder
)