Searched refs:bmod (Results 1 – 13 of 13) sorted by relevance
| /openbsd-src/gnu/usr.bin/perl/cpan/Math-BigInt/t/ |
| H A D | bigintpm.inc | 134 } elsif ($f eq "bmod") { 313 $x->bmod($y); 314 is($x, 1, '$x->bmod($y); $x'); 315 is($y, 3, '$x->bmod($y); $y'); 343 $x->bmod($y); 344 is($x, 2, '$x->bmod($y); $x'); 345 is($y, 3, '$x->bmod($y); $y'); 373 $x->bmod($y); 374 is($x, -1, '$x->bmod($y); $x'); 375 is($y, -3, '$x->bmod( [all...] |
| H A D | inf_nan.t | 339 # bmod and bdiv in list context 364 # bmod 369 my $m = $x->bmod($y); 373 . qq|\$m = \$x->bmod(\$y);|;
|
| H A D | mbimbf.inc | 324 is($class->new(15131)->bmod(123), 2, qq|$class->new(15131)->bmod(123)|); 325 is($class->bmod(15131, 123), 2, qq|$class->bmod(15131, 123)|); 326 is($class->bmod(15131, $class->new(123)), 2, 327 qq|$class->bmod(15131, $class->new(123))|);
|
| H A D | bigfltpm.inc | 143 } elsif ($f eq "bmod") { 144 $try .= ' $x->bmod($y);'; 1900 &bmod
|
| H A D | upgrade.inc | 140 } elsif ($f eq "bmod") { 994 &bmod
|
| H A D | downgrade.t | |
| /openbsd-src/gnu/usr.bin/perl/cpan/Math-BigRat/t/ |
| H A D | bigratpm.inc | |
| H A D | downgrade.t | |
| /openbsd-src/usr.bin/dc/ |
| H A D | bcode.c | 96 static void bmod(void); 144 { '%', bmod }, 1086 bmod(void) in bmod() function
|
| /openbsd-src/gnu/usr.bin/perl/cpan/Math-BigInt/lib/Math/ |
| H A D | BigInt.pm | 60 '%' => sub { $_[2] ? ref($_[0]) -> new($_[1]) -> bmod($_[0]) 61 : $_[0] -> copy() -> bmod($_[1]); }, 82 '%=' => sub { $_[0] -> bmod($_[1]); }, 2551 sub bmod { 2559 return $x if $x -> modify('bmod'); 2591 return $upgrade -> bmod($x, $y, @r) 2705 $x = $x->bmod($y); 2735 $x = $x -> bmod($y) if $x->{sign} ne $y->{sign}; 2765 # Modulo zero. See documentation for Math::BigInt's bmod() method. 4801 my $c = $expo -> copy() -> bdec() -> bmod( 2335 sub bmod { global() subroutine [all...] |
| H A D | BigFloat.pm | 50 '%' => sub { $_[2] ? ref($_[0]) -> new($_[1]) -> bmod($_[0]) 51 : $_[0] -> copy() -> bmod($_[1]); }, 72 '%=' => sub { $_[0] -> bmod($_[1]); }, 2294 $rem = $rem->bmod($y, @params); # copy already done 2313 sub bmod { 2321 return $x if $x->modify('bmod'); 2324 # Math::BigInt -> bmod(). 2328 # Modulo zero. This is handled the same way as in Math::BigInt -> bmod(). 2335 # Math::BigInt -> bmod(). 2342 # Math::BigInt -> bmod() 2226 sub bmod { global() subroutine [all...] |
| /openbsd-src/gnu/usr.bin/perl/cpan/Math-BigRat/lib/Math/ |
| H A D | BigRat.pm | |
| /openbsd-src/gnu/gcc/libstdc++-v3/include/tr1/ |
| H A D | random | 286 * linear function @f$x_{i+1}\leftarrow(ax_{i} + c) \bmod m @f$. 653 * carry_{i-1}) \bmod m @f$. 713 * @f$, sets @f$ x_{-r} \dots x_{-1} @f$ to @f$ lcg(1) \bmod m 714 * \dots lcg(r) \bmod m @f$ respectively. If @f$ x_{-1} = 0 @f$
|