filifa
/
mathtools
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

return channels

This commit is contained in:
filifa 2025-09-05 21:23:25 -04:00
parent 0603ee9879
commit e4bd9aa661
2 changed files with 27 additions and 23 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

30
cmd/convergents.go
View File

@ -23,24 +23,32 @@ import (
"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)
go func() {
for i := 0; true; i = (i + 1) % n {
ch <- seq[i]
}
}()
return ch
}
func gaussianBrackets(x, xprev *big.Int, seq []*big.Int, ch chan<- *big.Int) {
c := make(chan *big.Int)
go cycle(seq, c)
for a := range c {
tmp := new(big.Int)
tmp.Mul(a, x)
func gaussianBrackets(x, xprev *big.Int, ch chan *big.Int) chan *big.Int {
out := make(chan *big.Int)
go func() {
for a := range ch {
tmp := new(big.Int).Mul(a, x)
tmp.Add(tmp, xprev)
xprev.Set(x)
x.Set(tmp)
ch <- tmp
out <- tmp
}
}()
return out
}
func convergents(cmd *cobra.Command, args []string) {
@ -58,10 +66,8 @@ func convergents(cmd *cobra.Command, args []string) {
}
}
hch := make(chan *big.Int)
kch := make(chan *big.Int)
go gaussianBrackets(a0, big.NewInt(1), denoms, hch)
go gaussianBrackets(big.NewInt(1), big.NewInt(0), denoms, kch)
hch := gaussianBrackets(a0, big.NewInt(1), cycle(denoms))
kch := gaussianBrackets(big.NewInt(1), big.NewInt(0), cycle(denoms))
r := new(big.Rat)
for {

6
cmd/pell.go
View File

@ -39,10 +39,8 @@ func pell(cmd *cobra.Command, args []string) {
cobra.CheckErr(pellCoeff + " is a perfect square")
}
hch := make(chan *big.Int)
kch := make(chan *big.Int)
go gaussianBrackets(a0, big.NewInt(1), repetend, hch)
go gaussianBrackets(big.NewInt(1), big.NewInt(0), repetend, kch)
hch := gaussianBrackets(a0, big.NewInt(1), cycle(repetend))
kch := gaussianBrackets(big.NewInt(1), big.NewInt(0), cycle(repetend))
for {
h, k := <-hch, <-kch