uint8_tree

package
v1.0.0 Latest Latest
Warning

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

 Go to latest Published: Mar 24, 2022 License: BSD-2-Clause Imports: 3 Imported by: 1

Documentation

Index

Constants

This section is empty.

Variables

This section is empty.

Functions

This section is empty.

Types

type FilterFunc 

type FilterFunc func(payload uint8) bool

FilterFunc is called on each result to see if it belongs in the resulting set

type MatchesFunc 

type MatchesFunc func(payload uint8, val uint8) bool

MatchesFunc is called to check if tag data matches the input value

type TreeV4 

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

TreeV4 is an IP Address patricia tree

func NewTreeV4 

func NewTreeV4() *TreeV4

NewTreeV4 returns a new Tree

func (*TreeV4) Add 

func (t *TreeV4) Add(address patricia.IPv4Address, tag uint8, matchFunc MatchesFunc) (bool, int)

Add adds a tag to the tree - if matchFunc is non-nil, it will be used to ensure uniqueness at this node - returns whether the tag count at this address was increased, and how many tags at this address

func (*TreeV4) Clone 

func (t *TreeV4) Clone() *TreeV4

Clone creates an identical copy of the tree - Note: the items in the tree are not deep copied

func (*TreeV4) CountTags 

func (t *TreeV4) CountTags() int

CountTags iterates through the tree, counting the number of tags - note: unused nodes will have TagCount==0

func (*TreeV4) Delete 

func (t *TreeV4) Delete(address patricia.IPv4Address, matchFunc MatchesFunc, matchVal uint8) int

Delete a tag from the tree if it matches matchVal, as determined by matchFunc. Returns how many tags are removed - use DeleteWithBuffer if you can reuse slices, to cut down on allocations

func (*TreeV4) DeleteWithBuffer 

func (t *TreeV4) DeleteWithBuffer(buf []uint8, address patricia.IPv4Address, matchFunc MatchesFunc, matchVal uint8) int

DeleteWithBuffer a tag from the tree if it matches matchVal, as determined by matchFunc. Returns how many tags are removed - uses input slice to reduce allocations

func (*TreeV4) FindDeepestTag 

func (t *TreeV4) FindDeepestTag(address patricia.IPv4Address) (bool, uint8)

FindDeepestTag finds a tag at the deepest level in the tree, representing the closest match. - if that target node has multiple tags, the first in the list is returned

func (*TreeV4) FindDeepestTags 

func (t *TreeV4) FindDeepestTags(address patricia.IPv4Address) (bool, []uint8)

FindDeepestTags finds all tags at the deepest level in the tree, representing the closest match - use FindDeepestTagsAppend if you can reuse slices, to cut down on allocations

func (*TreeV4) FindDeepestTagsAppend 

func (t *TreeV4) FindDeepestTagsAppend(ret []uint8, address patricia.IPv4Address) (bool, []uint8)

FindDeepestTagsAppend finds all tags at the deepest level in the tree, representing the closest match - appends results to the input slice

func (*TreeV4) FindTags 

func (t *TreeV4) FindTags(address patricia.IPv4Address) []uint8

FindTags finds all matching tags for given address - use FindTagsAppend if you can reuse slices, to cut down on allocations

func (*TreeV4) FindTagsAppend 

func (t *TreeV4) FindTagsAppend(ret []uint8, address patricia.IPv4Address) []uint8

FindTagsAppend finds all matching tags for given address and appends them to ret

func (*TreeV4) FindTagsWithFilter 

func (t *TreeV4) FindTagsWithFilter(address patricia.IPv4Address, filterFunc FilterFunc) []uint8

FindTagsWithFilter finds all matching tags that passes the filter function - use FindTagsWithFilterAppend if you can reuse slices, to cut down on allocations

func (*TreeV4) FindTagsWithFilterAppend 

func (t *TreeV4) FindTagsWithFilterAppend(ret []uint8, address patricia.IPv4Address, filterFunc FilterFunc) []uint8

FindTagsWithFilterAppend finds all matching tags that passes the filter function - results are appended to the input slice

func (*TreeV4) Set 

func (t *TreeV4) Set(address patricia.IPv4Address, tag uint8) (bool, int)

Set the single value for a node - overwrites what's there Returns whether the tag count at this address was increased, and how many tags at this address

type TreeV6 

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

TreeV6 is an IP Address patricia tree

func NewTreeV6 

func NewTreeV6() *TreeV6

NewTreeV6 returns a new Tree

func (*TreeV6) Add 

func (t *TreeV6) Add(address patricia.IPv6Address, tag uint8, matchFunc MatchesFunc) (bool, int)

Add adds a tag to the tree - if matchFunc is non-nil, it will be used to ensure uniqueness at this node - returns whether the tag count at this address was increased, and how many tags at this address

func (*TreeV6) Clone 

func (t *TreeV6) Clone() *TreeV6

Clone creates an identical copy of the tree - Note: the items in the tree are not deep copied

func (*TreeV6) CountTags 

func (t *TreeV6) CountTags() int

CountTags iterates through the tree, counting the number of tags - note: unused nodes will have TagCount==0

func (*TreeV6) Delete 

func (t *TreeV6) Delete(address patricia.IPv6Address, matchFunc MatchesFunc, matchVal uint8) int

Delete a tag from the tree if it matches matchVal, as determined by matchFunc. Returns how many tags are removed - use DeleteWithBuffer if you can reuse slices, to cut down on allocations

func (*TreeV6) DeleteWithBuffer 

func (t *TreeV6) DeleteWithBuffer(buf []uint8, address patricia.IPv6Address, matchFunc MatchesFunc, matchVal uint8) int

DeleteWithBuffer a tag from the tree if it matches matchVal, as determined by matchFunc. Returns how many tags are removed - uses input slice to reduce allocations

func (*TreeV6) FindDeepestTag 

func (t *TreeV6) FindDeepestTag(address patricia.IPv6Address) (bool, uint8)

FindDeepestTag finds a tag at the deepest level in the tree, representing the closest match. - if that target node has multiple tags, the first in the list is returned

func (*TreeV6) FindDeepestTags 

func (t *TreeV6) FindDeepestTags(address patricia.IPv6Address) (bool, []uint8)

FindDeepestTags finds all tags at the deepest level in the tree, representing the closest match - use FindDeepestTagsAppend if you can reuse slices, to cut down on allocations

func (*TreeV6) FindDeepestTagsAppend 

func (t *TreeV6) FindDeepestTagsAppend(ret []uint8, address patricia.IPv6Address) (bool, []uint8)

FindDeepestTagsAppend finds all tags at the deepest level in the tree, representing the closest match - appends results to the input slice

func (*TreeV6) FindTags 

func (t *TreeV6) FindTags(address patricia.IPv6Address) []uint8

FindTags finds all matching tags for given address - use FindTagsAppend if you can reuse slices, to cut down on allocations

func (*TreeV6) FindTagsAppend 

func (t *TreeV6) FindTagsAppend(ret []uint8, address patricia.IPv6Address) []uint8

FindTagsAppend finds all matching tags for given address and appends them to ret

func (*TreeV6) FindTagsWithFilter 

func (t *TreeV6) FindTagsWithFilter(address patricia.IPv6Address, filterFunc FilterFunc) []uint8

FindTagsWithFilter finds all matching tags that passes the filter function - use FindTagsWithFilterAppend if you can reuse slices, to cut down on allocations

func (*TreeV6) FindTagsWithFilterAppend 

func (t *TreeV6) FindTagsWithFilterAppend(ret []uint8, address patricia.IPv6Address, filterFunc FilterFunc) []uint8

FindTagsWithFilterAppend finds all matching tags that passes the filter function - results are appended to the input slice

func (*TreeV6) Set 

func (t *TreeV6) Set(address patricia.IPv6Address, tag uint8) (bool, int)

Set the single value for a node - overwrites what's there Returns whether the tag count at this address was increased, and how many tags at this address

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.