File Manager

X7ROOT File Manager

Current Path: /opt/golang/1.22.0/src/math/big

opt / golang / 1.22.0 / src / math / big /

📁 ..
📄 accuracy_string.go(647 B)
📄 alias_test.go(8.81 KB)
📄 arith.go(8.28 KB)
📄 arith_386.s(4.04 KB)
📄 arith_amd64.go(278 B)
📄 arith_amd64.s(9.07 KB)
📄 arith_arm.s(4 KB)
📄 arith_arm64.s(11.85 KB)
📄 arith_decl.go(686 B)
📄 arith_decl_pure.go(1.01 KB)
📄 arith_decl_s390x.go(503 B)
📄 arith_loong64.s(749 B)
📄 arith_mips64x.s(763 B)
📄 arith_mipsx.s(759 B)
📄 arith_ppc64x.s(16.4 KB)
📄 arith_riscv64.s(750 B)
📄 arith_s390x.s(20.29 KB)
📄 arith_s390x_test.go(770 B)
📄 arith_test.go(19.88 KB)
📄 arith_wasm.s(613 B)
📄 bits_test.go(5.07 KB)
📄 calibrate_test.go(4.63 KB)
📄 decimal.go(6.63 KB)
📄 decimal_test.go(3.33 KB)
📄 doc.go(3.8 KB)
📄 example_rat_test.go(1.68 KB)
📄 example_test.go(4.05 KB)
📄 float.go(44.55 KB)
📄 float_test.go(51.94 KB)
📄 floatconv.go(8.35 KB)
📄 floatconv_test.go(24.27 KB)
📄 floatexample_test.go(3.63 KB)
📄 floatmarsh.go(3.65 KB)
📄 floatmarsh_test.go(4.51 KB)
📄 ftoa.go(13.5 KB)
📄 gcd_test.go(2.16 KB)
📄 hilbert_test.go(2.88 KB)
📄 int.go(33.21 KB)
📄 int_test.go(58.47 KB)
📄 intconv.go(6.7 KB)
📄 intconv_test.go(10.01 KB)
📄 intmarsh.go(2.19 KB)
📄 intmarsh_test.go(3.07 KB)
📄 link_test.go(1.4 KB)
📄 nat.go(31.81 KB)
📄 nat_test.go(26.22 KB)
📄 natconv.go(14.56 KB)
📄 natconv_test.go(16.85 KB)
📄 natdiv.go(34.36 KB)
📄 prime.go(10.39 KB)
📄 prime_test.go(7.1 KB)
📄 rat.go(13.48 KB)
📄 rat_test.go(18.89 KB)
📄 ratconv.go(12.35 KB)
📄 ratconv_test.go(19.31 KB)
📄 ratmarsh.go(2.23 KB)
📄 ratmarsh_test.go(3.34 KB)
📄 roundingmode_string.go(819 B)
📄 sqrt.go(2.79 KB)
📄 sqrt_test.go(4.81 KB)

Editing: sqrt.go

// Copyright 2017 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

import (
	"math"
	"sync"
)

var threeOnce struct {
	sync.Once
	v *Float
}

func three() *Float {
	threeOnce.Do(func() {
		threeOnce.v = NewFloat(3.0)
	})
	return threeOnce.v
}

// Sqrt sets z to the rounded square root of x, and returns it.
//
// If z's precision is 0, it is changed to x's precision before the
// operation. Rounding is performed according to z's precision and
// rounding mode, but z's accuracy is not computed. Specifically, the
// result of z.Acc() is undefined.
//
// The function panics if z < 0. The value of z is undefined in that
// case.
func (z *Float) Sqrt(x *Float) *Float {
	if debugFloat {
		x.validate()
	}

if z.prec == 0 {
		z.prec = x.prec
	}

if x.Sign() == -1 {
		// following IEEE754-2008 (section 7.2)
		panic(ErrNaN{"square root of negative operand"})
	}

// handle ±0 and +∞
	if x.form != finite {
		z.acc = Exact
		z.form = x.form
		z.neg = x.neg // IEEE754-2008 requires √±0 = ±0
		return z
	}

// MantExp sets the argument's precision to the receiver's, and
	// when z.prec > x.prec this will lower z.prec. Restore it after
	// the MantExp call.
	prec := z.prec
	b := x.MantExp(z)
	z.prec = prec

// Compute √(z·2**b) as
	//   √( z)·2**(½b)     if b is even
	//   √(2z)·2**(⌊½b⌋)   if b > 0 is odd
	//   √(½z)·2**(⌈½b⌉)   if b < 0 is odd
	switch b % 2 {
	case 0:
		// nothing to do
	case 1:
		z.exp++
	case -1:
		z.exp--
	}
	// 0.25 <= z < 2.0

// Solving 1/x² - z = 0 avoids Quo calls and is faster, especially
	// for high precisions.
	z.sqrtInverse(z)

// re-attach halved exponent
	return z.SetMantExp(z, b/2)
}

// Compute √x (to z.prec precision) by solving
//
//	1/t² - x = 0
//
// for t (using Newton's method), and then inverting.
func (z *Float) sqrtInverse(x *Float) {
	// let
	//   f(t) = 1/t² - x
	// then
	//   g(t) = f(t)/f'(t) = -½t(1 - xt²)
	// and the next guess is given by
	//   t2 = t - g(t) = ½t(3 - xt²)
	u := newFloat(z.prec)
	v := newFloat(z.prec)
	three := three()
	ng := func(t *Float) *Float {
		u.prec = t.prec
		v.prec = t.prec
		u.Mul(t, t)     // u = t²
		u.Mul(x, u)     //   = xt²
		v.Sub(three, u) // v = 3 - xt²
		u.Mul(t, v)     // u = t(3 - xt²)
		u.exp--         //   = ½t(3 - xt²)
		return t.Set(u)
	}

xf, _ := x.Float64()
	sqi := newFloat(z.prec)
	sqi.SetFloat64(1 / math.Sqrt(xf))
	for prec := z.prec + 32; sqi.prec < prec; {
		sqi.prec *= 2
		sqi = ng(sqi)
	}
	// sqi = 1/√x

// x/√x = √x
	z.Mul(x, sqi)
}

// newFloat returns a new *Float with space for twice the given
// precision.
func newFloat(prec2 uint32) *Float {
	z := new(Float)
	// nat.make ensures the slice length is > 0
	z.mant = z.mant.make(int(prec2/_W) * 2)
	return z
}

X7ROOT File Manager

Editing: sqrt.go

Upload File

Create Folder