Calculate type of all radices without -l

factors.Type now supports all numbers; I have used lookup arrays instead
of determining whether a number is SAN or not.  There are only 117
elements to store, and this makes the algorithm Θ(1), so it's an
improvement.

Also, I have changed the size of some integer values to correspond to
this change - they now indicate the size of numbers they can accept.

The only outputs that are hidden for large radices are:
- The digit map, which goes up to 36 because I don't have any more
  digits beyond that point
- The multiplication table complexity, which is estimated above 2^16
  (for performance), and can optionally be extended to 2^32 (above this,
  the output could overflow a uint64).

1 files changed, 1 insertions, 1 deletions

diff --git a/radix_info.go b/radix_info.go
index afcc5b2..9845572 100644
--- a/radix_info.go
+++ b/radix_info.go
@@ -12,7 +12,7 @@ func main() {
 	}
 
 	if err == nil {
-		factorInfo := getFactorInfo(args.Radix, args.FullMap, args.LargeCalc)
+		factorInfo := getFactorInfo(args.Radix, args.FullMap, args.ExactMTCLarge)
 		if args.Compact {
 			factorInfo.writeToCompact(os.Stdout)
 		} else {