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.
Shellquote provides utilities for joining/splitting strings using sh's word-splitting rules.
It's an alternative fork of https://github.com/kballard/go-shellquote.
This package provides an easy access to native byte order.
Messagediff is a library for calculating diffs of arbitrary structs in the Go programming language.
This package provides a Golang implementation of the Base object for the "Optional Parameters Pattern".
flock implements a thread-safe file lock. It also includes a non-blocking TryLock function to allow locking without blocking execution.
This package provides a command-line completion engine for the Kong CLI parser.
This pacakge provides bindings for CRIU. The code is based on the Go-based PHaul implementation from the CRIU repository.
This Package provides filters that can be chained together in a manner similar to Unix pipelines.
go-diff offers algorithms to perform operations required for synchronizing plain text:
compare two texts and return their differences
perform fuzzy matching of text
apply patches onto text
This package provides functionality of converting a blob of text into a list of sentences.
This package provides a implementation of the Snowball stemmer for natural language processing.
This package provides a library and CLI program to parse the org-mode file format alongside a static site generator with HTML & pretty printed rendering in Golang.
The walker function is a faster, parallel version, of filepath.Walk
This package provides a base32 encoding package from go with NoPadding option.
This package provides colorable, a module that makes it possible to handle ANSI color escapes on Windows.
This package provides a wrapper for the Pluggable Authentication Modules application API.
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.
Package locker provides a mechanism for creating finer-grained locking to help free up more global locks to handle other tasks.
This package implements a functionality to perform efficient file copies using reflink operations on compatible filesystems such as btrfs and xfs.
Package complete provides a tool for bash writing bash completion in go, and bash completion for the go command line.
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.
Storm is a toolkit for BoltDB, providing various methods to work with it.
This package provides functionality for detecting natural languages and scripts (writing systems). Languages are represented by a defined list of constants, while scripts are represented by RangeTable.