algorithms

package

v0.1.7 Latest Latest Go to latest Published: Mar 15, 2024 License: MIT Imports: 5 Imported by: 17

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/pluralsh/polly

Links

Open Source Insights

Documentation ¶

Index ¶

func BFS[T comparable](initial T, neighbors func(T) ([]T, error), visit func(T) error) error
func Coinflip(num, dem int) bool
func DFS[T comparable](initial T, neighbors func(T) ([]T, error), visit func(T) error) error
func Filter[T any](arr []T, f func(T) bool) []T
func Index[T any](arr []T, f func(T) bool) int
func Int() int
func Intn(max int) int
func IntnRange(min, max int) int
func Map[T any, V any](arr []T, f func(T) V) []V
func MapValues[K comparable, V any](m map[K]V) []V
func Max[T Numeric](a, b T) T
func Merge(maps ...map[string]interface{}) map[string]interface{}
func ProbeGraph[T comparable](prober Prober[T], initial T, neighbors func(T) ([]T, error), ...) error
func Reduce[T any, V any](arr []T, acc V, f func(T, V) V) V
func Retry(op func() error, maxTries uint64) (err error)
func Reverse[T any](arr []T) []T
func String(n int) string
func TopSort[T comparable](vals []T, neighbors func(T) ([]T, error)) ([]T, error)
func TopsortGraph[T comparable](g containers.Graph[T]) ([]T, error)
type FetchPageFunc
type Numeric
type PageInfo
type PageIter
type Pager
- func NewPager[T any](pageSize int64, fetchPage FetchPageFunc[T]) *Pager[T]
- func (p *Pager[T]) HasNext() bool
- func (p *Pager[T]) NextPage() ([]T, error)
type Prober

Constants ¶

This section is empty.

Variables ¶

This section is empty.

Functions ¶

func BFS ¶

func BFS[T comparable](initial T, neighbors func(T) ([]T, error), visit func(T) error) error

func Coinflip ¶ added in v0.0.4

func Coinflip(num, dem int) bool

Coinflip method

func DFS ¶

func DFS[T comparable](initial T, neighbors func(T) ([]T, error), visit func(T) error) error

func Filter ¶

func Filter[T any](arr []T, f func(T) bool) []T

func Index ¶ added in v0.0.3

func Index[T any](arr []T, f func(T) bool) int

func Int ¶ added in v0.0.4

func Int() int

Int returns a non-negative pseudo-random int.

func Intn ¶ added in v0.0.4

func Intn(max int) int

Intn generates an integer in range [0,max). By design this should panic if input is invalid, <= 0.

func IntnRange ¶ added in v0.0.4

func IntnRange(min, max int) int

IntnRange generates an integer in range [min,max). By design this should panic if input is invalid, <= 0.

func Map ¶

func Map[T any, V any](arr []T, f func(T) V) []V

func MapValues ¶ added in v0.1.7

func MapValues[K comparable, V any](m map[K]V) []V

func Max ¶ added in v0.1.0

func Max[T Numeric](a, b T) T

func Merge ¶ added in v0.1.5

func Merge(maps ...map[string]interface{}) map[string]interface{}

func ProbeGraph ¶

func ProbeGraph[T comparable](prober Prober[T], initial T, neighbors func(T) ([]T, error), visit func(T) error) error

func Reduce ¶ added in v0.0.5

func Reduce[T any, V any](arr []T, acc V, f func(T, V) V) V

func Retry ¶ added in v0.1.0

func Retry(op func() error, maxTries uint64) (err error)

func Reverse ¶

func Reverse[T any](arr []T) []T

func String ¶ added in v0.0.4

func String(n int) string

String generates a random alphanumeric string, without vowels, which is n characters long. This will panic if n is less than zero.

func TopSort ¶

func TopSort[T comparable](vals []T, neighbors func(T) ([]T, error)) ([]T, error)

func TopsortGraph ¶ added in v0.0.2

func TopsortGraph[T comparable](g containers.Graph[T]) ([]T, error)

Types ¶

type FetchPageFunc ¶ added in v0.1.6

type FetchPageFunc[T any] func(page *string, size int64) ([]T, *PageInfo, error)

type Numeric ¶ added in v0.1.0

type Numeric interface {
	int | int8 | int16 | int32 | int64 | float64 | float32
}

type PageInfo ¶ added in v0.1.6

type PageInfo struct {
	HasNext  bool
	After    *string
	PageSize int64
}

type PageIter ¶ added in v0.1.6

type PageIter[T any] interface {
	NextPage() ([]T, error)
}

type Pager[T any] struct {
	// contains filtered or unexported fields
}

func NewPager ¶ added in v0.1.6

func NewPager[T any](pageSize int64, fetchPage FetchPageFunc[T]) *Pager[T]

func (p *Pager[T]) HasNext() bool

func (p *Pager[T]) NextPage() ([]T, error)

type Prober ¶

type Prober[T any] interface {
	Push(val T)
	Pop() (T, error)
	Empty() bool
}

Source Files ¶

View all Source files

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