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.
SMTInterpol is an SMT solver, that can compute Craig interpolants for various theories.
Arccon is part of the Arcane framework, providing core functionality for the Arcane development platform.
GNU Units converts numeric quantities between units of measure. It can handle scale changes through adaptive usage of standard scale prefixes (micro-, kilo-, etc.). It can also handle nonlinear conversions such as Fahrenheit to Celsius. Its interpreter is powerful enough to be used effectively as a scientific calculator.
The C-library cddlib implements the Double Description Method of Motzkin et al. for generating all vertices (i.e. extreme points) and extreme rays of a general convex polyhedron given by a system of linear inequalities in arbitrary dimension. It can also be used for the converse operation of computing convex hulls.
ARPACK-NG is a collection of Fortran77 subroutines designed to solve large scale eigenvalue problems.
This package provides a C++ implementation of the Louvain community detection algorithm.
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
This is a header-only C++ library for calculating analytical derivatives and taylor expansions of composite functions.
Giza is a lightweight scientific plotting library built on top of cairo that provides uniform output to multiple devices.
CyLP is a Python interface to COIN-OR’s Linear and mixed-integer program solvers (CLP, CBC, and CGL). CyLP’s unique feature is that you can use it to alter the solution process of the solvers from within Python. For example, you may define cut generators, branch-and-bound strategies, and primal/dual Simplex pivot rules completely in Python.
DUNE, the Distributed and Unified Numerics Environment is a modular toolbox for solving partial differential equations (PDEs) with grid-based methods. It supports the easy implementation of methods like Finite Elements (FE), Finite Volumes (FV), and also Finite Differences (FD).
UMFPACK is a set of routines for solving unsymmetric sparse linear systems using the Unsymmetric MultiFrontal method and direct sparse LU factorization.
PETSc, the Portable, Extensible Toolkit for Scientific Computation, is a suite of data structures and routines for the scalable (parallel) solution of scientific applications modeled by partial differential equations. It employs the MPI standard for all message-passing communication. petsc4py provides Python bindings to almost all functions of PETSc.
Yices is a solver for SMT problems. It can process input in SMT-LIB format or its own s-expression-based format.
SuiteSparse is a suite of sparse matrix algorithms. This package contains a library with common configuration options.
This package provides a collection of basic programming tools for numerical computation, including Fast Fourier Transforms, Spherical Harmonic Transforms, non-equispaced Fourier transforms, as well as some concrete applications like 4pi convolution on the sphere and gridding/degridding of radio interferometry data.
PnetCDF is a high-performance parallel I/O library for accessing Unidata's NetCDF, files in classic formats, specifically the formats of CDF-1, 2, and 5.
optizelle is a software library designed to solve nonlinear optimization problems. Four types of problem are considered: unconstrained, equality constrained, inequality constrained and constrained. Constraints may be applied as values of functions or sets of partial differential equations (PDEs).
Solution algorithms such as the preconditioned nonlinear conjugate gradient method, sequential quadratic programming (SQP) and the primal-dual interior-point method are made available. Interfaces are provided for applications written in C++ and Python. Parallel computation is supported via MPI.
HYPRE is a software library of high performance preconditioners and solvers for the solution of large, sparse linear systems of equations. It features multigrid solvers for both structured and unstructured grid problems.
This package provides the C library of RBio. It can be used for reading and writing sparse matrices in the Rutherford/Boeing format.
reduceLCS is an implementation of the Reduce-Expand algorithm for LCS. It is a fast program to compute the approximate Longest Commons Subsequence of a set of strings.
The terminal calculator is a small program to help users of the GNU/Linux terminal do calculations simply and quickly. The formula to be calculated can be fed to tcalc through the command line.
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.
GKlib is a library of various helper routines and frameworks used by software from KarypisLab, such as METIS.