OXIESEC PANEL
- Current Dir:
/
/
opt
/
golang
/
1.19.4
/
src
/
math
/
big
Server IP: 191.96.63.230
Upload:
Create Dir:
Name
Size
Modified
Perms
📁
..
-
12/01/2022 06:13:56 PM
rwxr-xr-x
📄
accuracy_string.go
414 bytes
12/01/2022 06:12:59 PM
rw-r--r--
📄
alias_test.go
8.81 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith.go
8.28 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_386.s
4.07 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_amd64.go
306 bytes
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_amd64.s
9.09 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_arm.s
4.03 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_arm64.s
11.88 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_decl.go
594 bytes
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_decl_pure.go
1.04 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_decl_s390x.go
531 bytes
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_loong64.s
745 bytes
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_mips64x.s
817 bytes
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_mipsx.s
809 bytes
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_ppc64x.s
16.36 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_riscv64.s
786 bytes
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_s390x.s
20.32 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_s390x_test.go
812 bytes
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_test.go
19.88 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
arith_wasm.s
641 bytes
12/01/2022 06:12:59 PM
rw-r--r--
📄
bits_test.go
5.07 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
calibrate_test.go
4.63 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
decimal.go
6.63 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
decimal_test.go
3.33 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
doc.go
3.79 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
example_rat_test.go
1.68 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
example_test.go
4.05 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
float.go
44.28 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
float_test.go
51.94 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
floatconv.go
8.34 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
floatconv_test.go
24.27 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
floatexample_test.go
3.63 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
floatmarsh.go
3.53 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
floatmarsh_test.go
3.92 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
ftoa.go
13.55 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
gcd_test.go
2.16 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
hilbert_test.go
2.88 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
int.go
30.26 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
int_test.go
53.14 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
intconv.go
6.69 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
intconv_test.go
10.01 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
intmarsh.go
2.14 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
intmarsh_test.go
3.07 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
link_test.go
1.4 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
nat.go
26.73 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
nat_test.go
23.56 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
natconv.go
14.55 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
natconv_test.go
16.85 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
natdiv.go
34.15 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
prime.go
10.34 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
prime_test.go
7.1 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
rat.go
13.47 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
rat_test.go
18.89 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
ratconv.go
9.78 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
ratconv_test.go
15.75 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
ratmarsh.go
2.1 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
ratmarsh_test.go
3.3 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
roundingmode_string.go
501 bytes
12/01/2022 06:12:59 PM
rw-r--r--
📄
sqrt.go
2.79 KB
12/01/2022 06:12:59 PM
rw-r--r--
📄
sqrt_test.go
4.81 KB
12/01/2022 06:12:59 PM
rw-r--r--
Editing: example_rat_test.go
Close
// Copyright 2015 The Go Authors. All rights reserved. // Use of this source code is governed by a BSD-style // license that can be found in the LICENSE file. package big_test import ( "fmt" "math/big" ) // Use the classic continued fraction for e // // e = [1; 0, 1, 1, 2, 1, 1, ... 2n, 1, 1, ...] // // i.e., for the nth term, use // // 1 if n mod 3 != 1 // (n-1)/3 * 2 if n mod 3 == 1 func recur(n, lim int64) *big.Rat { term := new(big.Rat) if n%3 != 1 { term.SetInt64(1) } else { term.SetInt64((n - 1) / 3 * 2) } if n > lim { return term } // Directly initialize frac as the fractional // inverse of the result of recur. frac := new(big.Rat).Inv(recur(n+1, lim)) return term.Add(term, frac) } // This example demonstrates how to use big.Rat to compute the // first 15 terms in the sequence of rational convergents for // the constant e (base of natural logarithm). func Example_eConvergents() { for i := 1; i <= 15; i++ { r := recur(0, int64(i)) // Print r both as a fraction and as a floating-point number. // Since big.Rat implements fmt.Formatter, we can use %-13s to // get a left-aligned string representation of the fraction. fmt.Printf("%-13s = %s\n", r, r.FloatString(8)) } // Output: // 2/1 = 2.00000000 // 3/1 = 3.00000000 // 8/3 = 2.66666667 // 11/4 = 2.75000000 // 19/7 = 2.71428571 // 87/32 = 2.71875000 // 106/39 = 2.71794872 // 193/71 = 2.71830986 // 1264/465 = 2.71827957 // 1457/536 = 2.71828358 // 2721/1001 = 2.71828172 // 23225/8544 = 2.71828184 // 25946/9545 = 2.71828182 // 49171/18089 = 2.71828183 // 517656/190435 = 2.71828183 }