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.
This package implements a variety of data structures, including, CircularBuffer, Queue, Stack, Accumulators, LinkedLists, SortedDicts and many others.
The is package provides a variety of common utilities that can be used by downstream automatic differentiation (AD) tools to define and execute forward-, reverse-, and mixed-mode primitives.
This package takes a string or buffer containing Julia code, performs lexical analysis and returns a stream of tokens.
This package lazily represents matrices filled with a single entry, as well as identity matrices. This package exports the following types: Eye, Fill, Ones, Zeros, Trues and Falses.
This package provides an interface to line search algorithms implemented in Julia.
This package provides the IOCapture.capture(f) function, which captures the standard output and standard error, and returns it as a string together with the return value.
Optim.jl is a package for univariate and multivariate optimization of functions.
This package is intended as a lightweight foundation for tensor operations across the Julia ecosystem. Currently it exports three operations: hadamard, tensor, and boxdot.
OffsetArrays.jl provides Julia users with arrays that have arbitrary indices, similar to those found in some other programming languages like Fortran.
Tracker.jl previously provided Flux.jl with automatic differentiation for its machine learning platform.
This package provides an implementation of an associative container mapping (K,V) pairs via the type IntervalTreeK, V. The type K may be any ordered type.
This package implements real and complex polylogarithms, including the real and complex dilogarithm and trilogarithm in Julia.
This small package supports the representation of images as AxisArrays to endow the axes with "meaning," and makes programming with such arrays easy via traits.
This implements the notation .. for indexing arrays. It's similar to the Python ... in that it means "all of the columns before (or after)".
This package provides support for image resizing, image rotation, and other spatial transformations of arrays.
This package allows multiple FFT packages to co-exist with the same underlying fft(x) and plan_fft(x) interface. It is mainly not intended to be used directly. Instead, developers of packages that implement FFTs (such as FFTW.jl or FastTransforms.jl) extend the types/functions defined in AbstractFFTs.
This package provides a namespace for data-related generic function definitions to solve the optional dependency problem; packages wishing to share and/or extend functions can avoid depending directly on each other by moving the function definition to StatsAPI.jl and each package taking a dependency on it.
This package provides generic methods and modules used in many of the other BioJulia packages. This package defines IO, exceptions, and other types or methods used by other BioJulia packages.
This package implements "lazy" in-place elementwise transformations of arrays for the Julia programming language. Explicitly, it provides a "view" M of an array A so that M[i] = f(A[i]) for a specified (but arbitrary) function f, without ever having to compute M explicitly (in the sense of allocating storage for M). The name of the package comes from the fact that M == map(f, A).
This is a small package to make it easier to type LaTeX equations in string literals in the Julia language.
This package contains utilities for setting up documentation generation with Documenter.jl.
Measurements.jl is an error propagation calculator and library for physical measurements. It supports real and complex numbers with uncertainty, arbitrary precision calculations, operations with arrays, and numerical integration. The linear error propagation theory is employed to propagate the errors.
This Julia package provides several utilities for working with tree-like data structures. Most importantly, it defines the children method that any package that contains such a data structure may import and extend in order to take advantage of any generic tree algorithm in this package.
This package provides a combinatorics library for Julia, focusing mostly (as of now) on enumerative combinatorics and permutations.