tree

Documentation

Index

• type Node
  • func Parse(shards []*dynamodbstreams.Shard) *Node
  • func (n *Node) DFS(fn func(shard *dynamodbstreams.Shard) bool)
  • func (n *Node) Find(shardID *string) (*Node, bool)

Types

type Node

type Node struct {
	Shard    *dynamodbstreams.Shard `json:"shard"`
	Parent   *Node                  `json:"-"`
	Children []*Node                `json:"children"`
}

Node contains a Shard and all its descendants

func Parse

func Parse(shards []*dynamodbstreams.Shard) *Node

Parse the complete shard list and reassemble it into a tree structure

func (*Node) DFS

func (n *Node) DFS(fn func(shard *dynamodbstreams.Shard) bool)

DFS depth first search; true indicates to descend to children

func (*Node) Find

func (n *Node) Find(shardID *string) (*Node, bool)

Find the shard with the specified id