node

package

v0.1.1 Latest Latest Go to latest Published: Jan 31, 2022 License: MIT Imports: 7 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Repository

github.com/ajiyoshi-vg/hairetsu

Links

Open Source Insights

Documentation ¶

Index ¶

Constants
func Label(offset, child Index) word.Code
type Index
type Interface
type Node
- func New(i int) Node
- func Root() Node

Constants ¶

View Source

const MaxIndex = 1<<29 - 1

Variables ¶

This section is empty.

Functions ¶

func Label ¶

func Label(offset, child Index) word.Code

Label : returns c such that offset.Forward(c) == child

Types ¶

type Index ¶

type Index uint32

func (Index) Backward ¶

func (x Index) Backward(c word.Code) Index

Backword : returns x such that x == offset.Forward(c)

func (Index) Forward ¶

func (x Index) Forward(c word.Code) Index

func (Index) Generate ¶

func (x Index) Generate(r *rand.Rand, size int) reflect.Value

type Interface ¶

type Interface interface {
	GetOffset() Index
	SetOffset(Index)

	Terminate()
	IsTerminal() bool

	SetParent(Index)
	IsChildOf(Index) bool

	GetChild(word.Code) Index

	IsUsed() bool

	GetNextEmptyNode() (Index, error)
	GetPrevEmptyNode() (Index, error)
	SetNextEmptyNode(Index) error
	SetPrevEmptyNode(Index) error

	Reset(int)
	String() string
}

type Node ¶

type Node uint64

func New ¶

func New(i int) Node

func Root ¶

func Root() Node

func (Node) Generate ¶

func (x Node) Generate(r *rand.Rand, size int) reflect.Value

func (Node) GetChild ¶

func (x Node) GetChild(label word.Code) Index

func (Node) GetNextEmptyNode ¶

func (x Node) GetNextEmptyNode() (Index, error)

func (Node) GetOffset ¶

func (x Node) GetOffset() Index

func (Node) GetParent ¶

func (x Node) GetParent() Index

func (Node) GetPrevEmptyNode ¶

func (x Node) GetPrevEmptyNode() (Index, error)

func (Node) HasOffset ¶

func (x Node) HasOffset() bool

func (Node) HasParent ¶

func (x Node) HasParent() bool

func (Node) IsChildOf ¶

func (x Node) IsChildOf(parent Index) bool

func (Node) IsTerminal ¶

func (x Node) IsTerminal() bool

func (Node) IsUsed ¶

func (x Node) IsUsed() bool

func (Node) MarshalBinary ¶

func (x Node) MarshalBinary() ([]byte, error)

func (*Node) Reset ¶

func (x *Node) Reset(i int)

func (*Node) SetNextEmptyNode ¶

func (x *Node) SetNextEmptyNode(i Index) error

func (*Node) SetOffset ¶

func (x *Node) SetOffset(i Index)

func (*Node) SetParent ¶

func (x *Node) SetParent(i Index)

func (*Node) SetPrevEmptyNode ¶

func (x *Node) SetPrevEmptyNode(i Index) error

func (Node) String ¶

func (x Node) String() string

func (*Node) Terminate ¶

func (x *Node) Terminate()

func (*Node) UnmarshalBinary ¶

func (x *Node) UnmarshalBinary(data []byte) error

Source Files ¶

View all Source files

?	: This menu
/	: Search site
f or F	: Jump to
y or Y	: Canonical URL