return channels
This commit is contained in:
parent
0603ee9879
commit
e4bd9aa661
|
|
@ -23,24 +23,32 @@ import (
|
||||||
"github.com/spf13/cobra"
|
"github.com/spf13/cobra"
|
||||||
)
|
)
|
||||||
|
|
||||||
func cycle(seq []*big.Int, ch chan<- *big.Int) {
|
func cycle(seq []*big.Int) chan *big.Int {
|
||||||
|
ch := make(chan *big.Int)
|
||||||
n := len(seq)
|
n := len(seq)
|
||||||
|
go func() {
|
||||||
for i := 0; true; i = (i + 1) % n {
|
for i := 0; true; i = (i + 1) % n {
|
||||||
ch <- seq[i]
|
ch <- seq[i]
|
||||||
}
|
}
|
||||||
|
}()
|
||||||
|
|
||||||
|
return ch
|
||||||
}
|
}
|
||||||
|
|
||||||
func gaussianBrackets(x, xprev *big.Int, seq []*big.Int, ch chan<- *big.Int) {
|
func gaussianBrackets(x, xprev *big.Int, ch chan *big.Int) chan *big.Int {
|
||||||
c := make(chan *big.Int)
|
out := make(chan *big.Int)
|
||||||
go cycle(seq, c)
|
|
||||||
for a := range c {
|
go func() {
|
||||||
tmp := new(big.Int)
|
for a := range ch {
|
||||||
tmp.Mul(a, x)
|
tmp := new(big.Int).Mul(a, x)
|
||||||
tmp.Add(tmp, xprev)
|
tmp.Add(tmp, xprev)
|
||||||
xprev.Set(x)
|
xprev.Set(x)
|
||||||
x.Set(tmp)
|
x.Set(tmp)
|
||||||
ch <- tmp
|
out <- tmp
|
||||||
}
|
}
|
||||||
|
}()
|
||||||
|
|
||||||
|
return out
|
||||||
}
|
}
|
||||||
|
|
||||||
func convergents(cmd *cobra.Command, args []string) {
|
func convergents(cmd *cobra.Command, args []string) {
|
||||||
|
|
@ -58,10 +66,8 @@ func convergents(cmd *cobra.Command, args []string) {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
hch := make(chan *big.Int)
|
hch := gaussianBrackets(a0, big.NewInt(1), cycle(denoms))
|
||||||
kch := make(chan *big.Int)
|
kch := gaussianBrackets(big.NewInt(1), big.NewInt(0), cycle(denoms))
|
||||||
go gaussianBrackets(a0, big.NewInt(1), denoms, hch)
|
|
||||||
go gaussianBrackets(big.NewInt(1), big.NewInt(0), denoms, kch)
|
|
||||||
|
|
||||||
r := new(big.Rat)
|
r := new(big.Rat)
|
||||||
for {
|
for {
|
||||||
|
|
|
||||||
|
|
@ -39,10 +39,8 @@ func pell(cmd *cobra.Command, args []string) {
|
||||||
cobra.CheckErr(pellCoeff + " is a perfect square")
|
cobra.CheckErr(pellCoeff + " is a perfect square")
|
||||||
}
|
}
|
||||||
|
|
||||||
hch := make(chan *big.Int)
|
hch := gaussianBrackets(a0, big.NewInt(1), cycle(repetend))
|
||||||
kch := make(chan *big.Int)
|
kch := gaussianBrackets(big.NewInt(1), big.NewInt(0), cycle(repetend))
|
||||||
go gaussianBrackets(a0, big.NewInt(1), repetend, hch)
|
|
||||||
go gaussianBrackets(big.NewInt(1), big.NewInt(0), repetend, kch)
|
|
||||||
|
|
||||||
for {
|
for {
|
||||||
h, k := <-hch, <-kch
|
h, k := <-hch, <-kch
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue