Skip to content

Commit 090ddb1

Browse files
committed
Formatting changes
Ran `gofmt -s -w .` to update formatting.
1 parent 78b9135 commit 090ddb1

File tree

2 files changed

+18
-12
lines changed

2 files changed

+18
-12
lines changed

README.md

+4
Original file line numberDiff line numberDiff line change
@@ -1,5 +1,9 @@
11
# gobigger
22

3+
[![Go Report Card](https://goreportcard.com/badge/github.com/jtpeller/gobigger)](https://goreportcard.com/report/github.com/jtpeller/gobigger)
4+
[![Release](https://img.shields.io/github/release/jtpeller/gobigger.svg?style=flat-square)](https://github.com/jtpeller/gobigger/releases)
5+
![GitHub License](https://img.shields.io/github/license/jtpeller/gobigger)
6+
37
go bigger or go home-r?
48

59
## What

gobigger.go

+14-12
Original file line numberDiff line numberDiff line change
@@ -17,6 +17,7 @@ import (
1717
// ========================================================
1818

1919
// how big the mantissa is going to be. For super extreme
20+
//
2021
// precision, you could use a far larger number but this
2122
// will use much more space / memory.
2223
const DEFAULT_FLOAT_PREC = 256
@@ -43,7 +44,7 @@ func inew(i int64) *bint { return big.NewInt(i) }
4344

4445
func abs(a *bint) *bint { return zero().Abs(a) }
4546

46-
func add(a, b *bint) *bint { return zero().Add(a, b) }
47+
func add(a, b *bint) *bint { return zero().Add(a, b) }
4748

4849
func and(a, b *bint) *bint { return zero().And(a, b) }
4950

@@ -110,15 +111,17 @@ func fzero() *bfloat { return big.NewFloat(0) }
110111

111112
func fnew(a float64) *bfloat { return big.NewFloat(a) }
112113

113-
func parseFloat(s string, base int, prec uint, mod big.RoundingMode) (f *bfloat, b int, err error) { return big.ParseFloat(s, base, prec, mod) }
114+
func parseFloat(s string, base int, prec uint, mod big.RoundingMode) (f *bfloat, b int, err error) {
115+
return big.ParseFloat(s, base, prec, mod)
116+
}
114117

115118
func fabs(a *bfloat) *bfloat { return fzero().Abs(a) }
116119

117120
func facc(a *bfloat) big.Accuracy { return a.Acc() }
118121

119122
func fadd(a, b *bfloat) *bfloat { return fzero().Add(a, b) }
120123

121-
func fappend(a *bfloat, buf []byte, fmt byte, prec int) []byte {return a.Append(buf, fmt, prec) }
124+
func fappend(a *bfloat, buf []byte, fmt byte, prec int) []byte { return a.Append(buf, fmt, prec) }
122125

123126
func fcmp(a, b *bfloat) int { return a.Cmp(b) }
124127

@@ -146,7 +149,7 @@ func trunc(a *bfloat) (*bint, big.Accuracy) { return a.Int(nil) }
146149
// BIG RAT WRAPPERS
147150
// ==============================================
148151

149-
func rzero() *brat { return big.NewRat(0, 1)}
152+
func rzero() *brat { return big.NewRat(0, 1) }
150153

151154
func rnew(a, b int64) *brat { return big.NewRat(a, b) }
152155

@@ -243,11 +246,11 @@ func gcd(a, b *bint) *bint {
243246
}
244247

245248
/**
246-
* nCr(n, k) -- Compute the binomial of two big ints!
249+
* nCr(n, k) -- Compute the binomial of two big ints!
247250
* AKA Binomial(n, k) or C(n, r)
248251
* Will panic if: n < 0 || k < 0 || n < k
249252
*/
250-
func nCr(n, k *bint) *bint {
253+
func nCr(n, k *bint) *bint {
251254
// error checking
252255
if lt(n, zero()) || lt(k, zero()) || lt(n, k) {
253256
return zero()
@@ -256,7 +259,7 @@ func nCr(n, k *bint) *bint {
256259
// C(n,r) = n!/((n-r)!r!). Instead, do the shortcut. Modify k based on n
257260
// k > n/2
258261
if gt(k, div(n, inew(2))) {
259-
k = sub(n, k) // k = n - k
262+
k = sub(n, k) // k = n - k
260263
}
261264
c := inew(1)
262265
for i := inew(1); lteq(i, k); inc(i) {
@@ -291,7 +294,7 @@ func itof(a *bint) *bfloat {
291294
func itor(a *bint) *brat {
292295
r := new(big.Rat)
293296
r.SetFrac(a, inew(1))
294-
return r
297+
return r
295298
}
296299

297300
// ### comparisons
@@ -355,15 +358,15 @@ func divall_f(start *bfloat, nums ...*bfloat) *bfloat {
355358
}
356359

357360
// computes a^e, where a is a float!
358-
func fpow(a *bfloat, e int64) *bfloat {
361+
func fpow(a *bfloat, e int64) *bfloat {
359362
if e == 0 {
360363
return fnew(1)
361364
}
362365
r := fzero().Copy(a)
363366
for i := int64(0); i < e-1; i++ {
364367
r = fmul(r, a)
365368
}
366-
if e < 0 { // negative exponents are reciprocals of positives
369+
if e < 0 { // negative exponents are reciprocals of positives
367370
return fdiv(fnew(1), r)
368371
}
369372
return r
@@ -404,7 +407,6 @@ func lteq_f(a, b *bfloat) bool { return lt_f(a, b) || equals_f(a, b) }
404407
// returns true/false of a >= b
405408
func gteq_f(a, b *bfloat) bool { return gt_f(a, b) || equals_f(a, b) }
406409

407-
408410
// ==============================================
409411
// BIG RAT NEW FUNCTIONALITY
410412
// ==============================================
@@ -475,4 +477,4 @@ func gt_r(a, b *brat) bool { return a.Cmp(b) == 1 }
475477
func lteq_r(a, b *brat) bool { return lt_r(a, b) || equals_r(a, b) }
476478

477479
// returns true/false of a >= b
478-
func gteq_r(a, b *brat) bool { return gt_r(a, b) || equals_r(a, b) }
480+
func gteq_r(a, b *brat) bool { return gt_r(a, b) || equals_r(a, b) }

0 commit comments

Comments
 (0)