File Coverage

lib/Math/ProvablePrime/Rand.pm

Criterion	Covered	Total	%
statement	22	23	95.6
branch	8	8	100.0
condition	2	3	66.6
subroutine	4	5	80.0
pod	0	1	0.0
total	36	40	90.0

package Math::ProvablePrime::Rand;

use strict;
use warnings;

use Bytes::Random::Secure::Tiny ();

my $rng;

#Return a random integer N such that $lower <= N <= $upper.
#cf. Python random.randint()
#TODO: test this
sub int {
    my ($lower, $upper) = @_;

    $rng ||= Bytes::Random::Secure::Tiny->new();

    my $is_bigint = ref $upper;

    my $diff = $is_bigint ? $upper->copy()->bsub($lower) : ($upper - $lower);

    my $diff_bin = $is_bigint ? substr( $diff->as_bin(), 2 ) : sprintf('%b', $diff);

    my $bit_length = length $diff_bin;

    my $ct_of_chunks_of_32_bits = int( $bit_length / 32 );
    my $ct_of_leftover_bits = $bit_length % 32;

    my $diff_hex = $is_bigint ? substr( $diff->as_hex(), 2 ) : sprintf('%x', $diff);

    #my $hex;
    my $rand;

    do {
        $rand = Math::BigInt->from_bin( $rng->string_from('01', length $diff_bin) );

        #$hex = join( q<>, map { sprintf '%08x', _irand() } 1 .. $ct_of_chunks_of_32_bits );

        #Now the remaining bits
        #if ($ct_of_leftover_bits) {
        #    substr( $hex, 0, 0) = sprintf '%x', int rand( (2 ** $ct_of_leftover_bits) );
        #}
        #$rand->badd($lower);

    #} while (length($hex) == length($diff_hex)) && ($hex gt $diff_hex);
    } while $rand->bgt($diff);

    #TODO: Allow this to return scalars.
    #return $is_bigint ? Math::BigInt->from_hex($hex)->badd($lower) : ($lower + hex $hex);
    return $is_bigint ? $rand->badd($lower) : ($rand->numify() + $lower);
}

#cf. Bytes::Random::Secure::Tiny … but NOT cryptographic-strength
sub _irand {
    return CORE::int(0.5 + rand) + CORE::int(rand 0xffffffff);
}

1;