Enter the query into the form above. You can look for specific version of a package by using @ symbol like this: gcc@10.
API method:
GET /api/packages?search=hello&page=1&limit=20
where search is your query, page is a page number and limit is a number of items on a single page. Pagination information (such as a number of pages and etc) is returned
in response headers.
If you'd like to join our channel search send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
FFTW is a C subroutine library for computing the discrete Fourier transform (DFT) in one or more dimensions, of arbitrary input size, and of both real and complex data (as well as of even/odd data---i.e. the discrete cosine/ sine transforms or DCT/DST).
Eigen is a C++ template library for linear algebra: matrices, vectors, numerical solvers, and related algorithms. It provides an elegant API based on "expression templates". It is versatile: it supports all matrix sizes, all standard numeric types, various matrix decompositions and geometry features, and more.
fpylll is a Python wrapper for fplll.
xtensor is a C++ library meant for numerical analysis with multi-dimensional array expressions.
xtensor provides:
an extensible expression system enabling lazy broadcasting.
an API following the idioms of the C++ standard library.
tools to manipulate array expressions and build upon xtensor.
GMP-ECM factors integers using the elliptic curve method (ECM) as well as the P-1 and P+1 algorithms. It provides a library and a stand-alone binary.
FFTW is a C subroutine library for computing the discrete Fourier transform (DFT) in one or more dimensions, of arbitrary input size, and of both real and complex data (as well as of even/odd data---i.e. the discrete cosine/ sine transforms or DCT/DST). Single-precision version.
FFTW is a C subroutine library for computing the discrete Fourier transform (DFT) in one or more dimensions, of arbitrary input size, and of both real and complex data (as well as of even/odd data---i.e. the discrete cosine/ sine transforms or DCT/DST). This CMake build offers the file FFTW3LibraryDepends.cmake required by some dependent packages, absent in the gnu build version.
Singular is a computer algebra system for polynomial computations, with special emphasis on commutative and non-commutative algebra, algebraic geometry and singularity theory.
M4RI is a library for fast arithmetic with dense matrices over F2. The name M4RI comes from the first implemented algorithm: The Method of the Four Russians inversion algorithm published by Gregory Bard. This algorithm in turn is named after the Method of the Four Russians multiplication algorithm.
Clac is a command line, stack-based calculator with postfix notation that displays the stack contents at all times. As you type, the stack changes are reflected immediately.
FFTW is a C subroutine library for computing the discrete Fourier transform (DFT) in one or more dimensions, of arbitrary input size, and of both real and complex data (as well as of even/odd data---i.e. the discrete cosine/ sine transforms or DCT/DST). With OpenMPI parallelism support.
bc is an arbitrary precision numeric processing language. It includes an interactive environment for evaluating mathematical statements. Its syntax is similar to that of C, so basic usage is familiar. It also includes "dc", a reverse-polish calculator.
Sollya is a computer program whose purpose is to provide an environment for safe floating-point code development. It is particularly targeted to the automated implementation of mathematical floating-point libraries (libm). Amongst other features, it offers a certified infinity norm, an automatic polynomial implementer, and a fast Remez algorithm.
Givaro is a C++ library implementing the basic arithmetic of various algebraic objects: prime fields, extension fields, finite fields, finite rings, polynomials, algebraic numbers, arbitrary precision integers and rationals (C++ wrappers over gmp), fixed precision integers. It also provides data-structures and templated classes for the manipulation of compound objects, such as vectors, matrices and univariate polynomials.
Mpfrcx is a library for the arithmetic of univariate polynomials over arbitrary precision real (mpfr) or complex (mpc) numbers, without control on the rounding. For the time being, only the few functions needed to implement the floating point approach to complex multiplication are implemented. On the other hand, these comprise asymptotically fast multiplication routines such as Toom–Cook and the FFT.
Eigen is a C++ template library for linear algebra: matrices, vectors, numerical solvers, and related algorithms. It provides an elegant API based on "expression templates". It is versatile: it supports all matrix sizes, all standard numeric types, various matrix decompositions and geometry features, and more.
The gf2x library provides arithmetic of polynomials over finite fields of characteristic 2. It implements the multiplication, squaring and greatest common divisor operations.
JTransforms is a multithreaded FFT library written in pure Java. Currently, four types of transforms are available: Discrete Fourier Transform (DFT), Discrete Cosine Transform (DCT), Discrete Sine Transform (DST) and Discrete Hartley Transform (DHT).
libsemigroups is a C++14 library containing implementations of several algorithms for computing finite, and finitely presented, semigroups and monoids.
Giac/Xcas is a computer algebra system. It has a compatibility mode for maple, mupad and the TI89. It is available as a standalone program (graphic or text interfaces) or as a C++ library.
SymEngine is a standalone fast C++ symbolic manipulation library. Optional thin wrappers allow usage of the library from other languages.
Kiss FFT is a mixed-radix Fast Fourier Transform based up on the principle, 'Keep It Simple, Stupid.'
lmfit is a C library for Levenberg-Marquardt least-squares minimization and curve fitting. It is mature code, based on decades-old algorithms from the FORTRAN library MINPACK.
The CM software implements the construction of ring class fields of imaginary quadratic number fields and of elliptic curves with complex multiplication via floating point approximations, and the elliptic curve primality proving algorithm (ECPP). It consists of libraries that can be called from within a C program and of executable command line applications.