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 aim of this package is to provide users with a set of small generic routines useful above all in astronomical and astrophysical context, written in Julia.
This package implements various 3D rotation parameterizations and defines conversions between them. At their heart, each rotation parameterization is a 3Ă—3 unitary (orthogonal) matrix (based on the StaticArrays.jl package), and acts to rotate a 3-vector about the origin through matrix-vector multiplication.
Parsers.jl is a collection of type parsers and utilities for Julia.
This package provides another JSON package for Julia, with a focus on speed and slick struct mapping.
This package provides a convenient function form of the conditional ifelse. It is similar to Core.ifelse but it is extendable.
ImageInTerminal.jl is a drop-in package that once imported changes a how a single Colorant and whole Colorant arrays (i.e. Images) are displayed in the interactive REPL. The displayed images will be downscaled to fit into the size of your active terminal session.
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 provides support for one-dimensional numerical integration in Julia using adaptive Gauss-Kronrod quadrature. The code was originally part of Base Julia. It supports integration of arbitrary numeric types, including arbitrary precision (BigFloat), and even integration of arbitrary normed vector spaces (e.g. matrix-valued integrands).
RecursiveArrayTools.jl is a set of tools for dealing with recursive arrays like arrays of arrays.
This package just exports one type: the InvertedIndex, or Not for short. It can wrap any supported index type and may be used as an index into any AbstractArray subtype, including OffsetArrays.
This package defines the Bijection data type. A Bijection data structure behaves similar to a Dict, however it prevents assigning the same value to two different keys.
CommonSolve.jl provides solve, init, solve!, and step! commands. By using the same definition, solver libraries from other completely different ecosystems can extend the functions and thus not clash with SciML if both ecosystems export the solve command.
This package provides an interface for readable and writable references to an element of an array or dictionary in Julia.
This package contains types with default field values, keyword constructors and (un-)pack macros. Keyword functions can be slow in Julia, however, the normal positional constructor is also provided and could be used in performance critical code.
BufferedStreams.jl provides buffering for IO operations. It can wrap any IO type automatically making incremental reading and writing faster.
This package provides tools for transcoding data streams which are:
fast: small overhead and specialized methods
consistent: basic I/O operations work as expected
generic: support any I/O objects like files, buffers, pipes, etc.
extensible: easy definition for new codec to transcode data
ItemGraphs is a simple wrapper around LightGraphs that enables most common use case for graph-like data structures: with collection of items that are in relations between each other providing the shortest path between two items.
This package defines the primitive types for nucleic acids and amino acids that are used ny otherBioJulia packages.
This is a Julia interface to libquadmath, providing a Float128 type corresponding to the IEEE754 binary128 floating point format.
PositiveFactorizations is a package for computing a positive definite matrix decomposition (factorization) from an arbitrary symmetric input. The motivating application is optimization (Newton or quasi-Newton methods), in which the canonical search direction -H/g (H being the Hessian and g the gradient) may not be a descent direction if H is not positive definite.
BSON.jl is a Julia package for working with the Binary JSON serialisation format. It can be used as a general store for Julia data structures.
TableTraits defines a generic interface for tabular data.
HTTP.jl is a Julia library for HTTP Messages, implementing both a client and a server.
This package provides string distances in Julia. Distances are defined for AbstractStrings, and any iterator that define length(). The package also defines Distance "modifiers" that can be applied to any distance.