"""Helpers for randomized testing."""

import random
from random import uniform

from ..core import I, Symbol, Tuple, comp
from ..core.compatibility import as_int, is_sequence
from ..simplify import nsimplify


def random_complex_number(a=2, b=-1, c=3, d=1, rational=True):
    """
    Return a random complex number.

    To reduce chance of hitting branch cuts or anything, we guarantee
    b <= Im z <= d, a <= Re z <= c

    """
    A, B = uniform(a, c), uniform(b, d)
    if not rational:
        return A + I*B
    return nsimplify(A, rational=True) + I*nsimplify(B, rational=True)


def verify_numerically(f, g, z=None, tol=1.0e-6, a=2, b=-1, c=3, d=1):
    """
    Test numerically that f and g agree when evaluated in the argument z.

    If z is None, all symbols will be tested. This routine does not test
    whether there are Floats present with precision higher than 15 digits
    so if there are, your results may not be what you expect due to round-
    off errors.

    Examples
    ========

    >>> verify_numerically(sin(x)**2 + cos(x)**2, 1, x)
    true

    """
    f, g, z = Tuple(f, g, z)
    z = [z] if isinstance(z, Symbol) else (f.free_symbols | g.free_symbols)
    reps = list(zip(z, [random_complex_number(a, b, c, d) for _ in z]))
    z1 = f.subs(reps).evalf(strict=False)
    z2 = g.subs(reps).evalf(strict=False)
    return comp(z1, z2, tol)


def verify_derivative_numerically(f, z, tol=1.0e-6, a=2, b=-1, c=3, d=1):
    """
    Test numerically that the symbolically computed derivative of f
    with respect to z is correct.

    This routine does not test whether there are Floats present with
    precision higher than 15 digits so if there are, your results may
    not be what you expect due to round-off errors.

    Examples
    ========

    >>> verify_derivative_numerically(sin(x), x)
    true

    """
    from ..core import Derivative
    z0 = random_complex_number(a, b, c, d)
    f1 = f.diff(z).evalf(subs={z: z0})
    f2 = Derivative(f, z).doit_numerically(z0)
    return comp(f1, f2, tol)


def _randrange(seed=None):
    """Return a randrange generator. ``seed`` can be
        o None - return randomly seeded generator
        o int - return a generator seeded with the int
        o list - the values to be returned will be taken from the list
          in the order given; the provided list is not modified.

    Examples
    ========

    >>> rr = _randrange()
    >>> rr(1000)
    864
    >>> rr = _randrange(3)
    >>> rr(1000)
    243
    >>> rr = _randrange([0, 5, 1, 3, 4])
    >>> rr(3), rr(3)
    (0, 1)

    """
    if seed is None:
        return random.randrange
    if isinstance(seed, int):
        return random.Random(seed).randrange
    if is_sequence(seed):
        seed = list(seed)  # make a copy
        seed.reverse()

        def give(a, b=None, seq=seed):
            if b is None:
                a, b = 0, a
            a, b = as_int(a), as_int(b)
            w = b - a
            if w < 1:
                raise ValueError('_randrange got empty range')
            try:
                x = seq.pop()
            except IndexError as exc:
                raise ValueError('_randrange sequence was too short') from exc
            if a <= x < b:
                return x
            return give(a, b, seq)
        return give
    raise ValueError('_randrange got an unexpected seed')


def _randint(seed=None):
    """Return a randint generator. ``seed`` can be
        o None - return randomly seeded generator
        o int - return a generator seeded with the int
        o list - the values to be returned will be taken from the list
          in the order given; the provided list is not modified.

    Examples
    ========

    >>> ri = _randint()
    >>> ri(1, 1000)
    865
    >>> ri = _randint(3)
    >>> ri(1, 1000)
    244
    >>> ri = _randint([0, 5, 1, 2, 4])
    >>> ri(1, 3), ri(1, 3)
    (1, 2)

    """
    if seed is None:
        return random.randint
    if isinstance(seed, int):
        return random.Random(seed).randint
    if is_sequence(seed):
        seed = list(seed)  # make a copy
        seed.reverse()

        def give(a, b, seq=seed):
            a, b = as_int(a), as_int(b)
            w = b - a
            if w < 0:
                raise ValueError('_randint got empty range')
            try:
                x = seq.pop()
            except IndexError as exc:
                raise ValueError('_randint sequence was too short') from exc
            if a <= x <= b:
                return x
            return give(a, b, seq)
        return give
    raise ValueError('_randint got an unexpected seed')
