package/gonum
1
0
Fork 0
mirror of https://github.com/gonum/gonum.git synced 2025-10-06 23:52:47 +08:00
Code Issues Actions Packages Projects Releases Wiki Activity

stat/combin: fix spelling

Browse Source
This commit is contained in:
Dan Kortschak
2019-10-24 19:28:01 +10:30
parent f54cad9e6d
commit 35c4e21c06
3 changed files with 11 additions and 11 deletions
Download Patch File Download Diff File Expand all files Collapse all files

12
stat/combin/combin.go
View File

@@ -271,7 +271,7 @@ func IndexToCombination(dst []int, idx, n, k int) []int {
return dst
}
// Cartesian returns the cartesian product of the slices in data. The Cartesian
// Cartesian returns the Cartesian product of the slices in data. The Cartesian
// product of two sets is the set of all combinations of the items. For example,
// given the input
// []int{2, 3, 1}
@@ -311,7 +311,7 @@ func Card(dims []int) int {
return card
}
// NewCartesianGenerator returns a CartesianGenerator for iterating over cartesian products which are generated on the fly.
// NewCartesianGenerator returns a CartesianGenerator for iterating over Cartesian products which are generated on the fly.
// All values in lens must be positive, otherwise this will panic.
func NewCartesianGenerator(lens []int) *CartesianGenerator {
return &CartesianGenerator{
@@ -321,15 +321,15 @@ func NewCartesianGenerator(lens []int) *CartesianGenerator {
}
}
// CartesianGenerator iterates over a cartesian product set.
// CartesianGenerator iterates over a Cartesian product set.
type CartesianGenerator struct {
lens []int
rows int
idx int
}
// Next moves to the next product of the cartesian set.
// It returns false if the generator reached the end of the cartesian set end.
// Next moves to the next product of the Cartesian set.
// It returns false if the generator reached the end of the Cartesian set end.
func (g *CartesianGenerator) Next() bool {
if g.idx+1 < g.rows {
g.idx++
@@ -339,7 +339,7 @@ func (g *CartesianGenerator) Next() bool {
return false
}
// Product generates one product of the cartesian set according to the current index which is increased by Next().
// Product generates one product of the Cartesian set according to the current index which is increased by Next().
// Next needs to be called at least one time before this method, otherwise it will panic.
func (g *CartesianGenerator) Product(dst []int) []int {
return SubFor(dst, g.idx, g.lens)