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 pty package provides functions for working with Unix pseudoterminals.
Safe and easy casting from one type to another in Go.
This package implements a functionality to serialize/deserialize JSON by using JIT and SIMD approaches.
This package provides an additinal Golang modules for error handling in containerd projects.
errgrpc - provides utility functions for translating errors to and from a gRPC context
errhttp - provides utility functions for translating errors to and from a HTTP context
Go library that pluralizes and singularizes English nouns.
This package provides a encoder and decoder of the PostgreSQL wire protocol version 3.
Dasel (short for data-selector) allows you to query and modify data structures using selector strings. It's similar to jq/yq, but supports JSON, YAML, TOML, XML and CSV with zero runtime dependencies.
doublestar is a Go implementation of path pattern matching and globbing with support for "doublestar" patterns.
Package term manages POSIX terminals. As POSIX terminals are connected to, or emulate, a UART, this package also provides control over the various UART and serial line parameters.
Package log provides types and functions related to logging, passing loggers through a context, and attaching context to the logger.
This is a spelling corrector implementing the Damerau-Levenshtein distance. Takes a string value input from the user. Looks for an identical word on a list of words, if none is found, look for a similar word.
Colorstring provides functions for colorizing strings for terminal output.
Package argv parses command line string into arguments array using the bash syntax.
Bolt is a pure Go key/value store inspired by Howard Chu's LMDB project. The goal of the project is to provide a simple, fast, and reliable database for projects that don't require a full database server such as Postgres or MySQL.
This package provides Go clients for talking to a kubernetes cluster.
Package fuse enables writing and mounting user-space file systems. Subpackages:
fuseprovides support for mounting a new file system and reading requests from the kernelfuseopsenumerates the supported requests from the kernel, and provides documentation on their semanticsfuseutil, in particular theFileSysteminterface, provides a convenient way to create a file system type and export it to the kernel viafuse.Mount.
Package logutils augments the standard log package with levels.
This package implements a feature of limiting the maximum number of concurrently started routines which has the same role and API as sync.WaitGroup. It could for example be used to start multiples routines querying a database but without sending too much queries in order to not overload the given database.
Package sequential provides a set of functions for managing sequential files on Windows.
Package depth provides an ability to traverse and retrieve Go source code dependencies in the form of internal and external packages.
Go SDK for dicedb.
This package provides utilities for correcting image orientation based on EXIF metadata. It's an alternative fork of https://github.com/edwvee/exiffix maintained by Kitty comunity.
Package csvvalue provides an efficient parser for a single line CSV value. It is more efficient than the standard library csv package for parsing many small values. For multi-line CSV parsing, the standard library is recommended.
go-datastructures is a collection of useful, performant, and thread-safe Go data structures.
It includes:
Augmented Tree - Interval tree for collision in n-dimensional ranges. Implemented via a red-black augmented tree.
Bitarray - Bitarray used to detect existence without having to resort to hashing with hashmaps. Requires entities have a uint64 unique identifier. Two implementations exist, regular and sparse.
Futures - A helpful tool to send a broadcast message to listeners.
Queue - Package contains both a normal and priority queue. Both implementations never block on send and grow as much as necessary.
Fibonacci Heap - A standard Fibonacci heap providing the usual operations. Can be useful in executing Dijkstra or Prim's algorithms in the theoretically minimal time.
Range Tree - Useful to determine if n-dimensional points fall within an n-dimensional range.
Set - Set implementation which accepts items of type
interfaceand includes only a few methods.Threadsafe - A package that is meant to contain some commonly used items but in a threadsafe way.
AVL Tree - This is an example of a branch copy immutable Adelson-Velsky and Landis Balanced Binary Search Trees.
X-Fast Trie - An interesting design that treats integers as words and uses a trie structure to reduce time complexities by matching prefixes.
Y-Fast Trie - An extension of the X-Fast trie in which an X-Fast trie is combined with some other ordered data structure to reduce space consumption and improve CRUD types of operations.
Fast Integer Hashmap - A datastructure used for checking existence but without knowing the bounds of your data. If you have a limited small bounds, the bitarray package might be a better choice.
Skiplist - An ordered structure that provides amortized logarithmic operations but without the complication of rotations that are required by BSTs.
Sort - The sort package implements a multithreaded bucket sort that can be up to 3x faster than the native Golang sort package.
Numerics - Early work on some nonlinear optimization problems. The initial implementation allows a simple use case with either linear or nonlinear constraints.
B+ Tree - Initial implementation of a B+ tree. Delete method still needs added as well as some performance optimization.
Immutable B Tree - A btree based on two principles, immutability and concurrency.
Ctrie - A concurrent, lock-free hash array mapped trie with efficient non-blocking snapshots.
Dtrie - A persistent hash trie that dynamically expands or shrinks to provide efficient memory allocation.
Persistent List - A persistent, immutable linked list.
Simple Graph - A mutable, non-persistent undirected graph where parallel edges and self-loops are not permitted.