algo

package

v0.0.0-...-207deea Latest Latest Go to latest Published: Apr 23, 2024 License: MIT, MIT Imports: 7 Imported by: 16

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

Repository

github.com/junegunn/fzf

Links

Open Source Insights

Documentation ¶

Constants ¶

This section is empty.

Variables ¶

View Source

var DEBUG bool

Functions ¶

func Init ¶

func Init(scheme string) bool

func NormalizeRunes ¶

func NormalizeRunes(runes []rune) []rune

NormalizeRunes normalizes latin script letters

Types ¶

type Algo ¶

type Algo func(caseSensitive bool, normalize bool, forward bool, input *util.Chars, pattern []rune, withPos bool, slab *util.Slab) (Result, *[]int)

Algo functions make two assumptions 1. "pattern" is given in lowercase if "caseSensitive" is false 2. "pattern" is already normalized if "normalize" is true

type Result ¶

type Result struct {
	// TODO int32 should suffice
	Start int
	End   int
	Score int
}

Result contains the results of running a match function.

func ExactMatchNaive ¶

func ExactMatchNaive(caseSensitive bool, normalize bool, forward bool, text *util.Chars, pattern []rune, withPos bool, slab *util.Slab) (Result, *[]int)

ExactMatchNaive is a basic string searching algorithm that handles case sensitivity. Although naive, it still performs better than the combination of strings.ToLower + strings.Index for typical fzf use cases where input strings and patterns are not very long.

Since 0.15.0, this function searches for the match with the highest bonus point, instead of stopping immediately after finding the first match. The solution is much cheaper since there is only one possible alignment of the pattern.

func FuzzyMatchV1 ¶

func FuzzyMatchV1(caseSensitive bool, normalize bool, forward bool, text *util.Chars, pattern []rune, withPos bool, slab *util.Slab) (Result, *[]int)

FuzzyMatchV1 performs fuzzy-match

func FuzzyMatchV2 ¶

func FuzzyMatchV2(caseSensitive bool, normalize bool, forward bool, input *util.Chars, pattern []rune, withPos bool, slab *util.Slab) (Result, *[]int)

func PrefixMatch ¶

func PrefixMatch(caseSensitive bool, normalize bool, forward bool, text *util.Chars, pattern []rune, withPos bool, slab *util.Slab) (Result, *[]int)

PrefixMatch performs prefix-match

func SuffixMatch ¶

func SuffixMatch(caseSensitive bool, normalize bool, forward bool, text *util.Chars, pattern []rune, withPos bool, slab *util.Slab) (Result, *[]int)

SuffixMatch performs suffix-match

Source Files ¶

View all Source files

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