Linux vmi284606.contaboserver.net 4.15.0-213-generic #224-Ubuntu SMP Mon Jun 19 13:30:12 UTC 2023 x86_64
Apache/2.4.57 (Ubuntu)
: 167.86.127.34 | : 216.73.217.1
Cant Read [ /etc/named.conf ]
7.2.24-0ubuntu0.18.04.17
root
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
local /
go /
src /
math /
[ HOME SHELL ]
Name
Size
Permission
Action
big
[ DIR ]
drwxr-xr-x
bits
[ DIR ]
drwxr-xr-x
cmplx
[ DIR ]
drwxr-xr-x
rand
[ DIR ]
drwxr-xr-x
abs.go
363
B
-rw-r--r--
acos_s390x.s
3.73
KB
-rw-r--r--
acosh.go
1.72
KB
-rw-r--r--
acosh_s390x.s
4.32
KB
-rw-r--r--
all_test.go
84.21
KB
-rw-r--r--
arith_s390x.go
2.01
KB
-rw-r--r--
arith_s390x_test.go
10.78
KB
-rw-r--r--
asin.go
983
B
-rw-r--r--
asin_386.s
1.09
KB
-rw-r--r--
asin_s390x.s
4.16
KB
-rw-r--r--
asinh.go
1.85
KB
-rw-r--r--
asinh_s390x.s
5.74
KB
-rw-r--r--
atan.go
2.97
KB
-rw-r--r--
atan2.go
1.45
KB
-rw-r--r--
atan2_386.s
396
B
-rw-r--r--
atan2_s390x.s
6.88
KB
-rw-r--r--
atan_386.s
376
B
-rw-r--r--
atan_s390x.s
3.69
KB
-rw-r--r--
atanh.go
1.93
KB
-rw-r--r--
atanh_s390x.s
5.36
KB
-rw-r--r--
bits.go
1.87
KB
-rw-r--r--
cbrt.go
2.25
KB
-rw-r--r--
cbrt_s390x.s
4.89
KB
-rw-r--r--
const.go
2.18
KB
-rw-r--r--
copysign.go
378
B
-rw-r--r--
cosh_s390x.s
5.59
KB
-rw-r--r--
dim.go
1.55
KB
-rw-r--r--
dim_amd64.s
1.9
KB
-rw-r--r--
dim_arm64.s
947
B
-rw-r--r--
dim_s390x.s
1.96
KB
-rw-r--r--
erf.go
11.38
KB
-rw-r--r--
erf_s390x.s
8.5
KB
-rw-r--r--
erfc_s390x.s
14.4
KB
-rw-r--r--
erfinv.go
3.36
KB
-rw-r--r--
example_test.go
3.33
KB
-rw-r--r--
exp.go
5.25
KB
-rw-r--r--
exp2_386.s
1.12
KB
-rw-r--r--
exp_amd64.s
4.23
KB
-rw-r--r--
exp_arm64.s
5.35
KB
-rw-r--r--
exp_asm.go
260
B
-rw-r--r--
exp_s390x.s
4.65
KB
-rw-r--r--
expm1.go
7.84
KB
-rw-r--r--
expm1_386.s
1.84
KB
-rw-r--r--
expm1_s390x.s
5.29
KB
-rw-r--r--
export_s390x_test.go
732
B
-rw-r--r--
export_test.go
357
B
-rw-r--r--
floor.go
3.09
KB
-rw-r--r--
floor_386.s
1.45
KB
-rw-r--r--
floor_amd64.s
1.98
KB
-rw-r--r--
floor_arm64.s
549
B
-rw-r--r--
floor_ppc64x.s
483
B
-rw-r--r--
floor_s390x.s
555
B
-rw-r--r--
floor_wasm.s
447
B
-rw-r--r--
fma.go
4.49
KB
-rw-r--r--
frexp.go
860
B
-rw-r--r--
frexp_386.s
689
B
-rw-r--r--
gamma.go
5.52
KB
-rw-r--r--
huge_test.go
2.24
KB
-rw-r--r--
hypot.go
773
B
-rw-r--r--
hypot_386.s
1.8
KB
-rw-r--r--
hypot_amd64.s
1.05
KB
-rw-r--r--
j0.go
13.6
KB
-rw-r--r--
j1.go
13.3
KB
-rw-r--r--
jn.go
7.17
KB
-rw-r--r--
ldexp.go
990
B
-rw-r--r--
ldexp_386.s
441
B
-rw-r--r--
lgamma.go
11.02
KB
-rw-r--r--
log.go
3.8
KB
-rw-r--r--
log10.go
740
B
-rw-r--r--
log10_386.s
596
B
-rw-r--r--
log10_s390x.s
4.73
KB
-rw-r--r--
log1p.go
6.3
KB
-rw-r--r--
log1p_386.s
860
B
-rw-r--r--
log1p_s390x.s
5.15
KB
-rw-r--r--
log_386.s
394
B
-rw-r--r--
log_amd64.s
3.66
KB
-rw-r--r--
log_s390x.s
4.31
KB
-rw-r--r--
logb.go
1014
B
-rw-r--r--
mod.go
834
B
-rw-r--r--
mod_386.s
531
B
-rw-r--r--
modf.go
847
B
-rw-r--r--
modf_386.s
1.07
KB
-rw-r--r--
modf_arm64.s
439
B
-rw-r--r--
modf_ppc64x.s
404
B
-rw-r--r--
nextafter.go
1.2
KB
-rw-r--r--
pow.go
3.16
KB
-rw-r--r--
pow10.go
1.24
KB
-rw-r--r--
pow_s390x.s
16.27
KB
-rw-r--r--
remainder.go
1.96
KB
-rw-r--r--
remainder_386.s
543
B
-rw-r--r--
signbit.go
302
B
-rw-r--r--
sin.go
6.23
KB
-rw-r--r--
sin_s390x.s
8.34
KB
-rw-r--r--
sincos.go
1.75
KB
-rw-r--r--
sinh.go
1.56
KB
-rw-r--r--
sinh_s390x.s
5.98
KB
-rw-r--r--
sqrt.go
4.84
KB
-rw-r--r--
sqrt_386.s
296
B
-rw-r--r--
sqrt_amd64.s
326
B
-rw-r--r--
sqrt_arm.s
521
B
-rw-r--r--
sqrt_arm64.s
302
B
-rw-r--r--
sqrt_mipsx.s
375
B
-rw-r--r--
sqrt_ppc64x.s
326
B
-rw-r--r--
sqrt_s390x.s
301
B
-rw-r--r--
sqrt_wasm.s
269
B
-rw-r--r--
stubs_386.s
908
B
-rw-r--r--
stubs_amd64.s
1.41
KB
-rw-r--r--
stubs_arm.s
1.7
KB
-rw-r--r--
stubs_arm64.s
1.37
KB
-rw-r--r--
stubs_mips64x.s
1.83
KB
-rw-r--r--
stubs_mipsx.s
1.79
KB
-rw-r--r--
stubs_ppc64x.s
1.58
KB
-rw-r--r--
stubs_riscv64.s
1.75
KB
-rw-r--r--
stubs_s390x.s
13.24
KB
-rw-r--r--
stubs_wasm.s
1.63
KB
-rw-r--r--
tan.go
3.61
KB
-rw-r--r--
tan_s390x.s
2.73
KB
-rw-r--r--
tanh.go
2.59
KB
-rw-r--r--
tanh_s390x.s
4.57
KB
-rw-r--r--
trig_reduce.go
2.94
KB
-rw-r--r--
unsafe.go
1.27
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : sqrt.go
// Copyright 2009 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 math // The original C code and the long comment below are // from FreeBSD's /usr/src/lib/msun/src/e_sqrt.c and // came with this notice. The go code is a simplified // version of the original C. // // ==================================================== // Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved. // // Developed at SunPro, a Sun Microsystems, Inc. business. // Permission to use, copy, modify, and distribute this // software is freely granted, provided that this notice // is preserved. // ==================================================== // // __ieee754_sqrt(x) // Return correctly rounded sqrt. // ----------------------------------------- // | Use the hardware sqrt if you have one | // ----------------------------------------- // Method: // Bit by bit method using integer arithmetic. (Slow, but portable) // 1. Normalization // Scale x to y in [1,4) with even powers of 2: // find an integer k such that 1 <= (y=x*2**(2k)) < 4, then // sqrt(x) = 2**k * sqrt(y) // 2. Bit by bit computation // Let q = sqrt(y) truncated to i bit after binary point (q = 1), // i 0 // i+1 2 // s = 2*q , and y = 2 * ( y - q ). (1) // i i i i // // To compute q from q , one checks whether // i+1 i // // -(i+1) 2 // (q + 2 ) <= y. (2) // i // -(i+1) // If (2) is false, then q = q ; otherwise q = q + 2 . // i+1 i i+1 i // // With some algebraic manipulation, it is not difficult to see // that (2) is equivalent to // -(i+1) // s + 2 <= y (3) // i i // // The advantage of (3) is that s and y can be computed by // i i // the following recurrence formula: // if (3) is false // // s = s , y = y ; (4) // i+1 i i+1 i // // otherwise, // -i -(i+1) // s = s + 2 , y = y - s - 2 (5) // i+1 i i+1 i i // // One may easily use induction to prove (4) and (5). // Note. Since the left hand side of (3) contain only i+2 bits, // it does not necessary to do a full (53-bit) comparison // in (3). // 3. Final rounding // After generating the 53 bits result, we compute one more bit. // Together with the remainder, we can decide whether the // result is exact, bigger than 1/2ulp, or less than 1/2ulp // (it will never equal to 1/2ulp). // The rounding mode can be detected by checking whether // huge + tiny is equal to huge, and whether huge - tiny is // equal to huge for some floating point number "huge" and "tiny". // // // Notes: Rounding mode detection omitted. The constants "mask", "shift", // and "bias" are found in src/math/bits.go // Sqrt returns the square root of x. // // Special cases are: // Sqrt(+Inf) = +Inf // Sqrt(±0) = ±0 // Sqrt(x < 0) = NaN // Sqrt(NaN) = NaN func Sqrt(x float64) float64 // Note: Sqrt is implemented in assembly on some systems. // Others have assembly stubs that jump to func sqrt below. // On systems where Sqrt is a single instruction, the compiler // may turn a direct call into a direct use of that instruction instead. func sqrt(x float64) float64 { // special cases switch { case x == 0 || IsNaN(x) || IsInf(x, 1): return x case x < 0: return NaN() } ix := Float64bits(x) // normalize x exp := int((ix >> shift) & mask) if exp == 0 { // subnormal x for ix&(1<<shift) == 0 { ix <<= 1 exp-- } exp++ } exp -= bias // unbias exponent ix &^= mask << shift ix |= 1 << shift if exp&1 == 1 { // odd exp, double x to make it even ix <<= 1 } exp >>= 1 // exp = exp/2, exponent of square root // generate sqrt(x) bit by bit ix <<= 1 var q, s uint64 // q = sqrt(x) r := uint64(1 << (shift + 1)) // r = moving bit from MSB to LSB for r != 0 { t := s + r if t <= ix { s = t + r ix -= t q += r } ix <<= 1 r >>= 1 } // final rounding if ix != 0 { // remainder, result not exact q += q & 1 // round according to extra bit } ix = q>>1 + uint64(exp-1+bias)<<shift // significand + biased exponent return Float64frombits(ix) }
Close
