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 set of custom string types of various fixed sizes. Each inline string is a custom primitive type and can benefit from being stack friendly by avoiding allocations/heap tracking in the GC. When used in an array, the elements are able to be stored inline since each one has a fixed size. Currently support inline strings from 1 byte up to 255 bytes.

ArnoldiMethod.jl provides an iterative method to find a few approximate solutions to the eigenvalue problem in standard form with main goals:

• Having a native Julia implementation of the eigs function that performs as well as ARPACK. With native we mean that its implementation should be generic and support any number type. Currently the partialschur function does not depend on LAPACK, and removing the last remnants of direct calls to BLAS is in the pipeline.

• Removing the dependency of the Julia language on ARPACK. This goal was already achieved before the package was stable enough, since ARPACK moved to a separate repository Arpack.jl.

Documentation at https://melpa.org/#/flycheck-julia

Documentation at https://melpa.org/#/ob-julia-vterm

This package provides a wrapper for the fontconfig library.

This package provides a wrapper for the libxi library.

This package provides a wrapper for the libfdk audio library.

This package is an implementation of tropical (min-plus) arithmetic in Julia.

This package contains the underlying query operators that are exposed to users in Query.jl.

This package provides a minimal String type for Julia that allows for efficient string representation and transfer

The package provides a light-weight dependency for defining sensitivities for functions without the need to depend on ChainRules itself.

This package provides an interface for readable and writable references to an element of an array or dictionary in Julia.

This package provides SentinelArrayT that wraps an AbstractArray of type T, and accepts a sentinel and value argument.

This package provides a Julia ImageDistances.jl following the same API as Distances.jl with support image types and image-specific distances.

This package implements a variety of data structures, including, CircularBuffer, Queue, Stack, Accumulators, LinkedLists, SortedDicts and many others.

This package implements a variety of interpolation schemes for the Julia language. It has the goals of ease-of-use, broad algorithmic support, and exceptional performance.

BenchmarkTools.jl makes performance tracking of Julia code easy by supplying a framework for writing and running groups of benchmarks as well as comparing benchmark results.

This package provides some common helper functions that make it easier to implement various Base.show functions for types that participate in the TableTraits.jl ecosystem.

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.

AxisAlgorithms is a collection of filtering and linear algebra algorithms for multidimensional arrays. For algorithms that would typically apply along the columns of a matrix, you can instead pick an arbitrary axis (dimension).

ReferenceTests.jl is a Julia package that adds a couple of additional macros to your testing toolbox. In particular, it focuses on functionality for testing values against reference files, which in turn the package can help create and update if need be.

An IndirectArray is one that encodes data using a combination of an index and a value table. Each element is assigned its own index, which is used to retrieve the value from the value table. Among other uses, IndirectArrays can represent indexed images, sometimes called "colormap images" or "paletted images."

This package aims to offer a standard set of Geometry types, which easily work with metadata, query frameworks on geometries and different memory layouts. The aim is to create a solid basis for Graphics/Plotting, finite elements analysis, Geo applications, and general geometry manipulations - while offering a Julian API, that still allows performant C-interop.