internal

package
v0.2.0 Latest Latest
Warning

This package is not in the latest version of its module.

 Go to latest Published: Jan 16, 2024 License: MIT Imports: 7 Imported by: 0

Documentation

Index

Constants

View Source 
const PayloadHistoryMax = 16

Variables

This section is empty.

Functions

This section is empty.

Types

type MessageNode 

type MessageNode struct {
	Children     OrderedMap[*MessageNode]
	Payloads     [][]byte
	ReceivedAt   time.Time
	MessageCount int
	Topic        string
	Segment      string
	Depth        uint
	Parent       *MessageNode
}

func (MessageNode) CreateChildrenIterator 

func (n MessageNode) CreateChildrenIterator() OrderedMapIterator[*MessageNode]

func (*MessageNode) CreateCursor 

func (n *MessageNode) CreateCursor() MessageNodeCursor

func (*MessageNode) CreateIterator 

func (n *MessageNode) CreateIterator(method TreeSearchMethod, depth uint) MessageNodeIterator

func (MessageNode) CreateSiblingIterator 

func (n MessageNode) CreateSiblingIterator() OrderedMapIterator[*MessageNode]

func (MessageNode) GetAllDescendants 

func (n MessageNode) GetAllDescendants(method TreeSearchMethod) []MessageNode

func (MessageNode) GetAllDescendantsBFS 

func (n MessageNode) GetAllDescendantsBFS() []MessageNode

func (MessageNode) GetAllDescendantsDFS 

func (n MessageNode) GetAllDescendantsDFS() []MessageNode

func (MessageNode) GetDetailsString 

func (n MessageNode) GetDetailsString() string

func (MessageNode) GetLatestPayload added in v0.2.0 

func (n MessageNode) GetLatestPayload() []byte

func (MessageNode) GetPayload added in v0.2.0 

func (n MessageNode) GetPayload(offset int) []byte

func (MessageNode) GetSiblings 

func (n MessageNode) GetSiblings() []*MessageNode

func (MessageNode) Length 

func (n MessageNode) Length() int

type MessageNodeCursor 

type MessageNodeCursor struct {
	Root         *MessageNode
	SelectedNode *MessageNode
	// contains filtered or unexported fields
}

func (*MessageNodeCursor) Bottom 

func (n *MessageNodeCursor) Bottom()

func (*MessageNodeCursor) Down 

func (n *MessageNodeCursor) Down() bool

func (*MessageNodeCursor) GetParents 

func (n *MessageNodeCursor) GetParents() []*MessageNode

func (*MessageNodeCursor) GetSelectedNodeSiblings 

func (n *MessageNodeCursor) GetSelectedNodeSiblings() []*MessageNode

func (*MessageNodeCursor) Next 

func (n *MessageNodeCursor) Next() bool

func (*MessageNodeCursor) Previous 

func (n *MessageNodeCursor) Previous() bool

func (*MessageNodeCursor) Top 

func (n *MessageNodeCursor) Top()

func (*MessageNodeCursor) Up 

func (n *MessageNodeCursor) Up() bool

type MessageNodeIterator 

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

func (*MessageNodeIterator) Next 

func (i *MessageNodeIterator) Next() bool

func (*MessageNodeIterator) Value 

func (i *MessageNodeIterator) Value() *MessageNode

type MessageTree 

type MessageTree struct {
	Root *MessageNode
}

func CreateMessageTree 

func CreateMessageTree(rootNode string) MessageTree

func (*MessageTree) AddMessage 

func (t *MessageTree) AddMessage(message mqtt.Message)

func (*MessageTree) GetNode 

func (t *MessageTree) GetNode(path string) (*MessageNode, error)

func (*MessageTree) Render 

func (t *MessageTree) Render() string

type OrderedMap 

type OrderedMap[V any] struct {
	// contains filtered or unexported fields
}

func CreateOrderedMap 

func CreateOrderedMap[V any]() OrderedMap[V]

func (*OrderedMap[V]) CreateIterator 

func (m *OrderedMap[V]) CreateIterator() OrderedMapIterator[V]

func (*OrderedMap[V]) First 

func (m *OrderedMap[V]) First() V

func (*OrderedMap[V]) Get 

func (m *OrderedMap[V]) Get(key string) (V, bool)

func (*OrderedMap[V]) Length 

func (m *OrderedMap[V]) Length() int

func (*OrderedMap[V]) Set 

func (m *OrderedMap[V]) Set(key string, value V)

type OrderedMapIterator 

type OrderedMapIterator[V any] struct {
	// contains filtered or unexported fields
}

func (*OrderedMapIterator[V]) End 

func (i *OrderedMapIterator[V]) End()

func (*OrderedMapIterator[V]) HasNext 

func (i *OrderedMapIterator[V]) HasNext() bool

func (*OrderedMapIterator[V]) HasPrevious 

func (i *OrderedMapIterator[V]) HasPrevious() bool

func (*OrderedMapIterator[V]) Key 

func (i *OrderedMapIterator[V]) Key() (string, bool)

func (*OrderedMapIterator[V]) Next 

func (i *OrderedMapIterator[V]) Next() bool

func (*OrderedMapIterator[V]) Pair 

func (i *OrderedMapIterator[V]) Pair() (string, V, bool)

func (*OrderedMapIterator[V]) Previous 

func (i *OrderedMapIterator[V]) Previous() bool

func (*OrderedMapIterator[V]) Remaining 

func (i *OrderedMapIterator[V]) Remaining() int

func (*OrderedMapIterator[V]) Reset 

func (i *OrderedMapIterator[V]) Reset()

func (*OrderedMapIterator[V]) Rewind 

func (i *OrderedMapIterator[V]) Rewind(count int) bool

func (*OrderedMapIterator[V]) Set 

func (i *OrderedMapIterator[V]) Set(index int) error

func (*OrderedMapIterator[V]) Skip 

func (i *OrderedMapIterator[V]) Skip(count int) bool

func (*OrderedMapIterator[V]) SkipUntil 

func (i *OrderedMapIterator[V]) SkipUntil(searchKey string) bool

func (*OrderedMapIterator[V]) Take 

func (i *OrderedMapIterator[V]) Take(count int) []V

func (*OrderedMapIterator[V]) Value 

func (i *OrderedMapIterator[V]) Value() (V, bool)

type TreeSearchMethod 

type TreeSearchMethod = byte
const (
	BFS TreeSearchMethod = iota
	DFS
)

Source Files

View all Source files

Jump to

Keyboard shortcuts

? : This menu
/ : Search site
f or F : Jump to
y or Y : Canonical URL
go.dev uses cookies from Google to deliver and enhance the quality of its services and to analyze traffic. Learn more.