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 defines the primitive types for nucleic acids and amino acids that are used ny otherBioJulia packages.
This package provides Julia implementations of the Standard Clausen functions and Glaisher-Clausen functions of integer order for real or complex arguments.
Configurations.jl provides a macro @option to let you define structs to represent options/configurations, and serialize between different option/configuration file formats such as TOML.
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 allows programmers to explicitly SIMD-vectorize their Julia code. By exposing SIMD vector types and corresponding operations, the programmer can explicitly vectorize their code. While this does not guarantee that the generated machine code is efficient, it relieves the compiler from determining whether it is legal to vectorize the code, deciding whether it is beneficial to do so, and rearranging the code to synthesize vector instructions.
StackViews provides only one array type: StackView. There are multiple ways to understand StackView:
inverse of
eachslicecatvariantview object
lazy version of
repeatspecial case
The purpose of this library is to solidify extensions to the current AbstractArray interface, which are put to use in package ecosystems like DifferentialEquations.jl. Since these libraries are live, this package will serve as a staging ground for ideas before they are merged into Base Julia. For this reason, no functionality is exported so that if such functions are added and exported in a future Base Julia, there will be no issues with the upgrade.
RecursiveArrayTools.jl is a set of tools for dealing with recursive arrays like arrays of arrays.
LightGraphs offers both (a) a set of simple, concrete graph implementations -- Graph (for undirected graphs) and DiGraph (for directed graphs), and (b) an API for the development of more sophisticated graph implementations under the AbstractGraph type.
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.
This package was factored out of Plots.jl to allow any other plotting package to use the recipe pipeline. In short, the extremely lightweight RecipesBase.jl package can be depended on by any package to define "recipes": plot specifications of user-defined types, as well as custom plot types. RecipePipeline.jl contains the machinery to translate these recipes to full specifications for a plot.
This package provides an interface for manipulating multivariate polynomials. Implementing algorithms on polynomials using this interface will allow the algorithm to work for all polynomials implementing this interface. The interface contains functions for accessing the coefficients, monomials, defining arithmetic operations on them, rational functions, division with remainder, calculus and differentiation, and evaluation and substitution.
This package provides definitions for common functions that are useful for symbolic expression manipulation in Julia. Its purpose is to provide a shared interface between various symbolic programming packages, for example SymbolicUtils.jl, Symbolics.jl, and Metatheory.jl.
This package exports following operations over bit vectors with extremely fast speed while keeping extra memory usage small:
getindex(bv::IndexableBitVectors, i::Integer):i-th element ofbvrank(b::Bool, bv::AbstractIndexableBitVector, i::Integer): the number of occurrences of bitbinbv[1:i]select(b::Bool, bv::AbstractIndexableBitVector, i::Integer): the index of i-th occurrence ofbinbv.
and other shortcuts or types.
This package contains the underlying query operators that are exposed to users in Query.jl.
This package contains generic helper algorithms for building plotting components.
Parsers.jl is a collection of type parsers and utilities for Julia.
This package provides the @OptionalData macro and the corresponding OptData type which is a thin wrapper around a nullable value (of type UnionT, Nothing where T). It allows you to load and access globally available data at runtime in a type-stable way.
This package intends to provide a simple RNG with stable streams, suitable for tests in packages which need reproducible streams of random numbers across Julia versions. Indeed, the Julia RNGs provided by default are documented to have non-stable streams (which for example enables some performance improvements).
This package provides Julia implementation for reading and writing FITS files, based on the cfitsio library.
This package provides the type DataValue that is used to represent missing data.
The SortingAlgorithms package provides three sorting algorithms that can be used with Julia's standard sorting API: heapsort, timsort and radixsort.
This package offers Python-style general formatting and c-style numerical formatting.