algoutils

package

v1.65.2 Latest Latest Go to latest Published: Apr 28, 2025 License: MIT Imports: 0 Imported by: 0

Details

Valid go.mod file
Redistributable license
Tagged version
Stable version
Learn more about best practices

Repository

github.com/rusriver/nutz

Links

Open Source Insights

Documentation ¶

Index ¶

func HasPrefixSequence_Comparables[T comparable](s1, s2 []T) bool
func HasPrefixSequence_Fibers[T IFiber](s1, s2 []T) bool
func HasSubSequence_Comparables[T comparable](s1, s2 []T) bool
func HasSubSequence_Fibers[T IFiber](s1, s2 []T) bool
type FMTTF
- func (table FMTTF[Tv, Tk1]) FastMatch(sample_seq []Tk1) (v Tv, ok bool)
type FMTTF_Node
type FMTTV
- func (table FMTTV[Tv, Tk1]) FastMatch(sample_seq []Tk1) (v Tv, ok bool)
type FMTTV_Node
type IFiber

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

func HasPrefixSequence_Comparables ¶

func HasPrefixSequence_Comparables[T comparable](s1, s2 []T) bool

func HasPrefixSequence_Fibers ¶

func HasPrefixSequence_Fibers[T IFiber](s1, s2 []T) bool

func HasSubSequence_Comparables ¶

func HasSubSequence_Comparables[T comparable](s1, s2 []T) bool

func HasSubSequence_Fibers ¶

func HasSubSequence_Fibers[T IFiber](s1, s2 []T) bool

Types ¶

type FMTTF ¶

type FMTTF[Tv any, Tk1 comparable] map[Tk1]FMTTF_Node[Tv, Tk1]

Fast-Match Table Tree

func (FMTTF[Tv, Tk1]) FastMatch ¶

func (table FMTTF[Tv, Tk1]) FastMatch(sample_seq []Tk1) (v Tv, ok bool)

Matches the provided sample sequence against the table tree. It is fast compared to multiple subsequences search. Look at examples in tests, and also at the c59145cfdde048f5a3ef.

type FMTTF_Node ¶

type FMTTF_Node[Tv any, Tk1 comparable] struct {
	F           func(kk []Tk1) Tv
	FmttfNested FMTTF[Tv, Tk1]
}

Fast-Match Table Tree Node

type FMTTV ¶

type FMTTV[Tv any, Tk1 comparable] map[Tk1]FMTTV_Node[Tv, Tk1]

Fast-Match Table Tree

func (FMTTV[Tv, Tk1]) FastMatch ¶

func (table FMTTV[Tv, Tk1]) FastMatch(sample_seq []Tk1) (v Tv, ok bool)

Matches the provided sample sequence against the table tree. It is fast compared to multiple subsequences search.

type FMTTV_Node ¶

type FMTTV_Node[Tv any, Tk1 comparable] struct {
	UseV        bool
	V           Tv
	FmttvNested FMTTV[Tv, Tk1]
}

Fast-Match Table Tree Node

type IFiber ¶

type IFiber interface {
	string | []byte
}

Source Files ¶

View all Source files

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