patricia

Documentation

Index

• type Match
• type MatchFinder
  • func NewMatchFinder(pt *PatriciaTree) *MatchFinder
  • func (mf *MatchFinder) FindLongestMatches(data []byte) []Match
• type MatchFinder2
  • func NewMatchFinder2(pt *PatriciaTree) *MatchFinder2
  • func (mf2 *MatchFinder2) Current() ([]byte, int)
  • func (mf2 *MatchFinder2) FindLongestMatches(data []byte) []Match
• type Matches
  • func (m Matches) Len() int
  • func (m Matches) Less(i, j int) bool
  • func (m *Matches) Swap(i, j int)
• type PatriciaTree
  • func (pt *PatriciaTree) Get(key []byte) (interface{}, bool)
  • func (pt *PatriciaTree) Insert(key []byte, value interface{})

Types

type Match

type Match struct {
	Val   interface{}
	Start int
	End   int
}

type MatchFinder

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

func NewMatchFinder

func NewMatchFinder(pt *PatriciaTree) *MatchFinder

func (*MatchFinder) FindLongestMatches

func (mf *MatchFinder) FindLongestMatches(data []byte) []Match

type MatchFinder2

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

func NewMatchFinder2

func NewMatchFinder2(pt *PatriciaTree) *MatchFinder2

func (*MatchFinder2) Current

func (mf2 *MatchFinder2) Current() ([]byte, int)

func (*MatchFinder2) FindLongestMatches

func (mf2 *MatchFinder2) FindLongestMatches(data []byte) []Match

type Matches

type Matches []Match

func (Matches) Len

func (m Matches) Len() int

func (Matches) Less

func (m Matches) Less(i, j int) bool

func (*Matches) Swap

func (m *Matches) Swap(i, j int)

type PatriciaTree

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

func (*PatriciaTree) Get

func (pt *PatriciaTree) Get(key []byte) (interface{}, bool)

func (*PatriciaTree) Insert

func (pt *PatriciaTree) Insert(key []byte, value interface{})