A Julia framework for implementing FFTs

Abstract julia interfaces for working with trees

Update immutable data

-

Repository for automatic differentiation backend types

An efficient sampler for discrete random variables

A Julia wrapper for the Alpha Vantage API.

ANSI escape code translator

Package for checking function arguments

Tools for writing functions that handle many kinds of IO arguments

The Arnoldi Method with Krylov-Schur restart, natively in Julia.

Julia Wrappers for the arpack-ng Fortran library

Designs for new Base array interface primitives, used widely through scientific machine learning (SciML) and other organizations

A Julia package for describing array layouts and more general fast linear algebra

-

Efficient filtering and linear algebra routines for multidimensional arrays

A Julia package for representing banded matrices

A benchmarking framework for the Julia language

Bijection datatype for Julia.

BitFlag.jl provides an Enum-like type for bit flag option values.

Bit twiddling convenience functions.

Web-based GUIs for Julia

BlockArrays for Julia

A Julia package for representing block-banded matrices and banded-block-banded matrices

C-compatible enum for Julia

AD-backend agnostic system defining custom forward and reverse mode rules. This is the light weight core to allow you to define rules for your functions in your packages, without depending on any particular AD system.

Interface for transformation functions in Julia

-

A Julia package for data clustering

A bzip2 codec for TranscodingStreams.jl.

Zlib codecs for TranscodingStreams.jl.

Color manipulation utilities for Julia

Colorschemes, colormaps, gradients, and palettes

Basic color definitions and traits

Treat colors as if they are n-vectors for the purposes of arithmetic

A combinatorics library for Julia

A CommonMark-compliant Markdown parser for Julia.

A common solve function for scientific machine learning (SciML) and beyond

Naïve combined subexpression elimination in Julia

Fixing the world one invalidator at a time.