Math::Prime::Util::GMP is a module for number theory in Perl using GMP. This
includes primality tests, getting primes in a range, factoring, and more.
These use GMP directly, so should be quite fast for bignums. This module is
mainly intended to be used within Math::Prime::Util, but most functions can be
easily used in independent C programs. Some, like factoring and primality
proving, have explicit ways of compiling as standalone programs.
WWW: https://metacpan.org/release/Math-Prime-Util-GMP
Math::Prime::Util is a module for number theory in Perl. This includes prime
sieving, primality tests, primality proofs, integer factoring, counts / bounds /
approximations for primes, nth primes, and twin primes, random prime generation,
and much more.
WWW: https://metacpan.org/release/Math-Prime-Util
This adds the compiler-callable math intrinsics library libpgmath. It is the
math library of the flang compiler with support for vector operations.
Patches were in large part adapted from the OpenBSD port.
Reviewed by: zeising (mentor), mat
Approved by: zeising (mentor)
Obtained from: Brian Callahan (bcallah@openbsd.org) with adaptations
Differential Revision: https://reviews.freebsd.org/D17034
SLEEF is the SIMD Library for Evaluating Elementary Functions, vectorized libm
and DFT. It provides a vectorabi interface for vectorized libm.
Reviewed by: zeising (mentor), mat
Approved by: zeising (mentor)
Differential Revision: https://reviews.freebsd.org/D17045
based on orthogonal arrays for (industrial) experiments. Additionally, it
provides utility functions for the class design, which is also used by
other packages for designed experiments.
WWW: https://CRAN.R-project.org/package=DoE.base
PR: 220062
Submitted by: pfg@
twin primes, primitive roots, modular logarithm and inverses, extended
GCD, Farey series and continuous fractions. Includes Legendre and Jacobi
symbols, some divisor functions, Euler's Phi function, etc.
WWW: https://cran.r-project.org/web/packages/numbers/
2018-08-20 net/openmq: Broken for more than 5 months
2018-08-20 net/coda6_server: Broken for more than 5 months
2018-08-20 net/ceph-devel: Broken for more than 5 months
2018-08-20 java/jgrapht: Broken for more than 5 months
2018-08-20 mail/mutt14: mutt 1.4.x has been out of support for 10+ years use mail/mutt
2018-08-20 www/pydio: Broken for more than 5 months
2018-08-20 security/fastd-devel: Broken for more than 5 months
2018-08-20 security/fastd: Broken for more than 5 months
2018-08-20 devel/bhyve-vm-goagent: Broken for more than 5 months
2018-08-20 devel/cherivis-devel: Depends on broken and expiring cheritrace-devel
2018-08-20 devel/cheritrace-devel: Broken for more than 5 months
2018-08-20 devel/javolution: Broken for more than 5 months
2018-08-20 devel/bisoncpp: Depends on broken and expiring libbobcat
2018-08-20 databases/php5-pdo_cassandra: Broken for more than 5 months
2018-08-20 games/crafty-open-large: Broken for more than 5 months
2018-08-20 games/crafty-open-enormous: Broken for more than 5 months
2018-08-20 games/crafty-open-medium: Broken for more than 5 months
2018-08-20 math/jakarta-commons-math: Broken for more than 5 months
2018-08-20 math/hfst: Broken for more than 5 months
2018-08-20 math/octave-forge-communications: Broken for more than 5 months
2018-08-20 lang/v8-devel: Broken for more than 5 months
2018-08-20 sysutils/rubygem-fluentd010: Broken for more than 5 months
The purpose of this (XS) module is to calculate the median (or in principle also
other statistics) with confidence intervals on a sample. To do that, it uses a
technique called bootstrapping. In a nutshell, it resamples the sample a lot of
times and for each resample, it calculates the median. From the distribution of
medians, it then calculates the confidence limits.
In order to implement the confidence limit calculation, various other functions
had to be implemented efficiently (both algorithmically efficient and done in
C). These functions may be useful in their own right and are thus exposed to
Perl. Most notably, this exposes a median (and general selection) algorithm that
works in linear time as opposed to the trivial implementation that requires
O(n*log(n)).
WWW: https://metacpan.org/release/Statistics-CaseResampling
