algorithm

Documentation

Overview

SPDX-License-Identifier: MIT

SPDX-License-Identifier: MIT

SPDX-License-Identifier: MIT

Index

• func Walk(v ast.Visitor, node ast.Node)
• type Node
• type RegexBuilder
  • func (v *RegexBuilder) Visit(node ast.Node) (w ast.Visitor)
• type RegexPrinter
  • func (v *RegexPrinter) Visit(node regex.Stmt) (w regex.Visitor)
• type Stack
  • func (s *Stack) IsEmpty() bool
  • func (s *Stack) Len() int
  • func (s *Stack) Peek() interface{}
  • func (s *Stack) Pop() (val interface{})
  • func (s *Stack) Push(val interface{})

Functions

func Walk

func Walk(v ast.Visitor, node ast.Node)

Types

type Node

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

type RegexBuilder

type RegexBuilder struct {
	Root       *regex.Root
	ActualNode regex.ExprStmt
	Stack      Stack
}

func (*RegexBuilder) Visit

func (v *RegexBuilder) Visit(node ast.Node) (w ast.Visitor)

type RegexPrinter

type RegexPrinter struct {
	Buffer bytes.Buffer
	Fset   *token.FileSet
}

func (*RegexPrinter) Visit

func (v *RegexPrinter) Visit(node regex.Stmt) (w regex.Visitor)

type Stack

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

func (*Stack) IsEmpty

func (s *Stack) IsEmpty() bool

func (*Stack) Len

func (s *Stack) Len() int

func (*Stack) Peek

func (s *Stack) Peek() interface{}

func (*Stack) Pop

func (s *Stack) Pop() (val interface{})

func (*Stack) Push

func (s *Stack) Push(val interface{})