next

README

Next

The package calculates asynchronously combinations and permutations of a collection of values.

To add the package recommended:

go get klaidliadon.dev/next

Functionalities

• Combinations
• Combinations with repetitions
• Permutations
• Permutations with repetitions

Usage

Just use create a new channel using Combination() or Permutation() and receive the results.

package main

import (
	"fmt"
	"klaidliadon.dev/next"
)

func main() {
	for v := range next.Combination([]int{1,2,3,4}, 2, true) {
		fmt.Println(v)
	}
}

Produces

[1 1]
[1 2]
[1 3]
[1 4]
[2 2]
[2 3]
[2 4]
[3 3]
[3 4]
[4 4]

Roadmap

The 4 main cases of combinatronics are covered:

• Combinations
• Combinations with repetitions
• Permutations
• Permutations with repetitions

The future updates will improve performance and memory usage.

Documentation

Overview

Package next calculates asynchronously combinations and permutations of a collection of values.

Here is a sample usage of next:

package main

import (
	"fmt"
	"klaidliadon.dev/next"
)

func main() {
	for v := range next.Combination([]int{1,2,3,4}, 2, true) {
		fmt.Println(v)
	}
}

Index

• func Combination[T any](base []T, n int, repeat bool) iter.Seq[[]T]
• func Permutation[T any](base []T, n int, repeat bool) func(yield func([]T) bool)

Functions

func Combination

func Combination[T any](base []T, n int, repeat bool) iter.Seq[[]T]

Returns a channel of combinantions of n element from base w/o repetition

func Permutation

func Permutation[T any](base []T, n int, repeat bool) func(yield func([]T) bool)

Returns a channel of permutations of n element from base w/o repetition