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([]interface{}{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([]interface{1,2,3,4}, 2, true) {
fmt.Println(v)
}
}
Index ¶
Constants ¶
This section is empty.
Variables ¶
This section is empty.
Functions ¶
func Combination ¶
Returns a channel of combinantions of n element from base w/o repetition
func Permutation ¶
Returns a channel of permutations of n element from base w/o repetition
Types ¶
This section is empty.
Source Files
Directories
Click to show internal directories.
Click to hide internal directories.