import (
	"math"
	. "strconv"
	"testing"
)

func TestMulByLog2Log10(t *testing.T) {
	for x := -1600; x <= +1600; x++ {
		iMath := MulByLog2Log10(x)
		fMath := int(math.Floor(float64(x) * math.Ln2 / math.Ln10))
		if iMath != fMath {
			t.Errorf("mulByLog2Log10(%d) failed: %d vs %d\n", x, iMath, fMath)
		}
	}
}

func TestMulByLog10Log2(t *testing.T) {
	for x := -500; x <= +500; x++ {

	old := optimize
	optimize = b
	return old
}

func ParseFloatPrefix(s string, bitSize int) (float64, int, error) {
	return parseFloatPrefix(s, bitSize)
}

func MulByLog2Log10(x int) int {
	return mulByLog2Log10(x)
}

func MulByLog10Log2(x int) int {
	return mulByLog10Log2(x)

	// Because mant >= 2^54, it is enough to choose:
	//     2^(e2+54) >= 10^(-q+prec-1)
	// or q = -mulByLog2Log10(e2+54) + prec - 1
	//
	// The minimal required exponent is -mulByLog2Log10(1025)+18 = -291
	// The maximal required exponent is mulByLog2Log10(1074)+18 = 342
	q := -mulByLog2Log10(e2+54) + prec - 1

	// Now compute mant*(2^e2)*(10^q).
	// Is it an exact computation?