math/big.Float.prec (field)

78 uses

	math/big (current package)
		float.go#L66: 	prec uint32
		float.go#L169: 		z.prec = 0
		float.go#L182: 	old := z.prec
		float.go#L183: 	z.prec = uint32(prec)
		float.go#L184: 	if z.prec < old {
		float.go#L209: 	return uint(x.prec)
		float.go#L358: 	return x.prec <= uint32(x.exp) || x.MinPrec() <= uint(x.exp) // not enough bits for fractional mantissa
		float.go#L378: 	if x.prec == 0 {
		float.go#L406: 	if bits <= z.prec {
		float.go#L425: 	r := uint(bits - z.prec - 1) // rounding bit position; r >= 0
		float.go#L435: 	n := (z.prec + (_W - 1)) / _W // mantissa length in words for desired precision
		float.go#L442: 	ntz := n*_W - z.prec // 0 <= ntz < _W
		float.go#L501: 	if z.prec == 0 {
		float.go#L502: 		z.prec = 64
		float.go#L515: 	if z.prec < 64 {
		float.go#L545: 	if z.prec == 0 {
		float.go#L546: 		z.prec = 53
		float.go#L566: 	if z.prec < 53 {
		float.go#L597: 	if z.prec == 0 {
		float.go#L598: 		z.prec = umax32(bits, 64)
		float.go#L623: 	if z.prec == 0 {
		float.go#L624: 		z.prec = umax32(a.prec, b.prec)
		float.go#L658: 		if z.prec == 0 {
		float.go#L659: 			z.prec = x.prec
		float.go#L660: 		} else if z.prec < x.prec {
		float.go#L675: 		z.prec = x.prec
		float.go#L892: 		r.prec = uint32(p)
		float.go#L1012: 		r.prec = uint32(p)
		float.go#L1342: 	n := int(z.prec/_W) + 1
		float.go#L1447: 	if z.prec == 0 {
		float.go#L1448: 		z.prec = umax32(x.prec, y.prec)
		float.go#L1521: 	if z.prec == 0 {
		float.go#L1522: 		z.prec = umax32(x.prec, y.prec)
		float.go#L1588: 	if z.prec == 0 {
		float.go#L1589: 		z.prec = umax32(x.prec, y.prec)
		float.go#L1633: 	if z.prec == 0 {
		float.go#L1634: 		z.prec = umax32(x.prec, y.prec)
		floatconv.go#L34: 	prec := z.prec
		floatconv.go#L65: 		z.prec = prec
		floatconv.go#L124: 		z.prec = prec
		floatmarsh.go#L30: 		n = int((x.prec + (_W - 1)) / _W) // required mantissa length in words for given precision
		floatmarsh.go#L50: 	binary.BigEndian.PutUint32(buf[2:], x.prec)
		floatmarsh.go#L75: 	oldPrec := z.prec
		floatmarsh.go#L83: 	z.prec = binary.BigEndian.Uint32(buf[2:])
		ftoa.go#L188: 	s := mant.bitLen() - int(x.prec+1)
		ftoa.go#L331: 	case w < x.prec:
		ftoa.go#L332: 		m = nat(nil).shl(m, uint(x.prec-w))
		ftoa.go#L333: 	case w > x.prec:
		ftoa.go#L334: 		m = nat(nil).shr(m, uint(w-x.prec))
		ftoa.go#L339: 	e := int64(x.exp) - int64(x.prec)
		sqrt.go#L38: 	if z.prec == 0 {
		sqrt.go#L39: 		z.prec = x.prec
		sqrt.go#L58: 	prec := z.prec
		sqrt.go#L60: 	z.prec = prec
		sqrt.go#L94: 	u := newFloat(z.prec)
		sqrt.go#L95: 	v := newFloat(z.prec)
		sqrt.go#L98: 		u.prec = t.prec
		sqrt.go#L99: 		v.prec = t.prec
		sqrt.go#L109: 	sqi := newFloat(z.prec)
		sqrt.go#L111: 	for prec := z.prec + 32; sqi.prec < prec; {
		sqrt.go#L112: 		sqi.prec *= 2