mathtools/cmd/convergents.go

103 lines
2.5 KiB
Go
Raw Normal View History

2025-08-19 03:18:10 +00:00
/*
Copyright © 2025 filifa
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
package cmd
import (
"fmt"
"math/big"
"github.com/spf13/cobra"
)
2025-09-06 01:23:25 +00:00
func cycle(seq []*big.Int) chan *big.Int {
ch := make(chan *big.Int)
2025-09-06 00:35:10 +00:00
n := len(seq)
2025-09-06 01:23:25 +00:00
go func() {
for i := 0; true; i = (i + 1) % n {
ch <- seq[i]
}
}()
return ch
}
2025-09-06 01:23:25 +00:00
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)
out <- tmp
}
}()
return out
2025-09-06 00:35:10 +00:00
}
2025-08-19 03:18:10 +00:00
2025-09-06 00:35:10 +00:00
func convergents(cmd *cobra.Command, args []string) {
2025-08-19 03:18:10 +00:00
a0, ok := new(big.Int).SetString(args[0], 10)
if !ok {
2025-08-28 01:33:44 +00:00
cobra.CheckErr("invalid input " + args[0])
2025-08-19 03:18:10 +00:00
}
2025-09-06 00:35:10 +00:00
denoms := make([]*big.Int, len(args[1:]))
2025-08-19 03:18:10 +00:00
for i, d := range args[1:] {
2025-09-06 00:35:10 +00:00
denoms[i] = new(big.Int)
_, ok := denoms[i].SetString(d, 10)
2025-08-19 03:18:10 +00:00
if !ok {
2025-08-28 01:33:44 +00:00
cobra.CheckErr("invalid input " + d)
2025-08-19 03:18:10 +00:00
}
}
2025-09-06 01:23:25 +00:00
hch := gaussianBrackets(a0, big.NewInt(1), cycle(denoms))
kch := gaussianBrackets(big.NewInt(1), big.NewInt(0), cycle(denoms))
2025-08-19 03:50:19 +00:00
2025-09-06 00:35:10 +00:00
r := new(big.Rat)
for {
h, k := <-hch, <-kch
2025-08-19 03:50:19 +00:00
r.SetFrac(h, k)
fmt.Println(r)
2025-08-19 03:18:10 +00:00
}
}
2025-08-19 03:50:19 +00:00
// FIXME: should support an initial block of non-periodic denominators (will need flags)
2025-08-19 03:18:10 +00:00
// convergentsCmd represents the convergents command
var convergentsCmd = &cobra.Command{
Use: "convergents N N [N ...]",
Short: "Compute convergents of a periodic continued fraction",
Long: `Compute convergents of a periodic continued fraction.`,
Args: cobra.MinimumNArgs(2),
Run: convergents,
}
func init() {
rootCmd.AddCommand(convergentsCmd)
// Here you will define your flags and configuration settings.
// Cobra supports Persistent Flags which will work for this command
// and all subcommands, e.g.:
// convergentsCmd.PersistentFlags().String("foo", "", "A help for foo")
// Cobra supports local flags which will only run when this command
// is called directly, e.g.:
// convergentsCmd.Flags().BoolP("toggle", "t", false, "Help message for toggle")
}