diff options
| author | Adrien Hopkins <adrien.p.hopkins@gmail.com> | 2025-09-22 16:44:29 -0500 |
|---|---|---|
| committer | Adrien Hopkins <adrien.p.hopkins@gmail.com> | 2025-09-22 16:46:05 -0500 |
| commit | bec087c3855f1641ac3681d56c9f8247aa556d2e (patch) | |
| tree | 19b07482d8519326954b8a1acac310ccc4b1847c /args.go | |
| parent | d3fdb797db81ab81c4f91dd88d24723a88b39c2e (diff) | |
Add option to show logarithmic RC
This makes finding the RC of prime powers multiplication instead of
exponentation, which is much easier to do mentally.
Diffstat (limited to 'args.go')
| -rw-r--r-- | args.go | 15 |
1 files changed, 9 insertions, 6 deletions
@@ -27,12 +27,13 @@ const ProgramVersion = "1.0.0-rc.1" // The arguments to this program type args struct { - Radix uint - Compact bool - FullMap bool - ExactMTCLarge bool - TotativeDigits bool - DigitMapOnly bool + Radix uint + Compact bool + FullMap bool + ExactMTCLarge bool + TotativeDigits bool + DigitMapOnly bool + LogRegularComplexities bool // If true, exit the program immediately after parsing args. Exit bool } @@ -45,6 +46,8 @@ func parseArgs() (args, error) { flag.BoolVar(&a.FullMap, "f", false, fmt.Sprintf("Show full digit map (up to %d) for every radix", maxSmallRadix)) + flag.BoolVar(&a.LogRegularComplexities, "l", false, + "Show the base-2 logarithm of the regular complexities") flag.BoolVar(&a.ExactMTCLarge, "m", false, fmt.Sprintf("Calculate exact MTC for very large radices (up to %d instead of %d), which may take a while.", maxExtended, maxNormal)) |
