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 webring send a patch to ~whereiseveryone/toys@lists.sr.ht adding your channel as an entry in channels.scm.
The Java HDF5 Interface (JHI5) uses the Java Native Interface to wrap the HDF5 library, which is implemented in C.
ARPACK-NG is a collection of Fortran77 subroutines designed to solve large scale eigenvalue problems.
Frama-C is an extensible and collaborative platform dedicated to source-code analysis of C software. The Frama-C analyzers assist you in various source-code-related activities, from the navigation through unfamiliar projects up to the certification of critical software.
An implementation of the maxflow algorithm described in An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision. Yuri Boykov and Vladimir Kolmogorov. In IEEE Transactions on Pattern Analysis and Machine Intelligence, September 2004
PETSc, pronounced PET-see (the S is silent), is a suite of data structures and routines for the scalable (parallel) solution of scientific applications modeled by partial differential equations.
KLU is a method for computing the LU factorization of sparse for real and complex matrices.
libflame is a portable library for dense matrix computations, providing much of the functionality present in LAPACK, developed by current and former members of the SHPC group in the Institute for Computational Engineering and Sciences at The University of Texas at Austin. libflame includes a compatibility layer, lapack2flame, which includes a complete LAPACK implementation.
MUMPS (MUltifrontal Massively Parallel sparse direct Solver) solves a sparse system of linear equations A x = b using Gaussian elimination.
CLP is a high quality linear programming solver. Its main strengths are its dual and primal Simplex algorithms. It also has a barrier algorithm for linear and quadratic objectives. There are limited facilities for nonlinear and quadratic objectives using the Simplex algorithm.
The dozenal suite is a set of programs designed to assist with working in the dozenal (also called "duodecimal" or "base twelve") system. It includes number converters (dozenal-to-decimal and decimal-to-dozenal), an RPN calculator, a graphical calculator, a metric system converter (works with imperial, U.S. customary, SI metric, and the dozenal TGM), a pretty-printer for dozenal numbers, a date-and-time program, and a dozenal calendar programs, complete with events and to-dos.
BLIS is a portable software framework for instantiating high-performance BLAS-like dense linear algebra libraries. The framework was designed to isolate essential kernels of computation that, when optimized, immediately enable optimized implementations of most of its commonly used and computationally intensive operations. While BLIS exports a new BLAS-like API, it also includes a BLAS compatibility layer which gives application developers access to BLIS implementations via traditional BLAS routine calls.
GNU Octave is a high-level interpreted language that is specialized for numerical computations. It can be used for both linear and non-linear applications and it provides great support for visualizing results. Work may be performed both at the interactive command-line as well as via script files.
Bitwuzla is a SMT solver for the theories of fixed-size bit-vectors, floating-point arithmetic, arrays, uninterpreted functions and their combinations.
LibPoly is a C library for manipulating polynomials to support symbolic reasoning engines that need to reason about polynomial constraints.
This package provides a Wolfram language lexer for Pygments.
The double-conversion library provides binary-decimal and decimal-binary routines for IEEE doubles. The library consists of efficient conversion routines that have been extracted from the V8 JavaScript engine.
HDF5 is a suite that makes possible the management of extremely large and complex data collections.
MUMPS (MUltifrontal Massively Parallel sparse direct Solver) solves a sparse system of linear equations A x = b using Gaussian elimination.
Aris is a program for performing logical proofs. It supports propositional and predicate logic, as well as Boolean algebra and arithmetical logic. In addition to its predefined inference and equivalence rules, Aris also supports references to older proofs. Its use of standard logical symbols and its natural deduction interface make it easy to use for beginners.
PETSc, pronounced PET-see (the S is silent), is a suite of data structures and routines for the scalable (parallel) solution of scientific applications modeled by partial differential equations.
muParser is an extensible high performance math parser library. It is based on transforming an expression into a bytecode and precalculating constant parts of it.
MiniSat is a minimalistic, open-source SAT solver, developed to help researchers and developers alike to get started on SAT.
Maxima is a system for the manipulation of symbolic and numerical expressions. It yields high precision numeric results by using exact fractions, arbitrary precision integers, and variable precision floating point numbers.
CCOLAMD is library for computing a permutation vector for a matrix with which the LU factorization becomes sparser. It is a variant of COLAMD which has the the option to apply constraints to the ordering.