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 provides a filesystem glob API. It uses gobwas/glob underneath and returns only matching files or directories, depending on the configuration.
This package provides a library for embedding human-meaningful graphics in QR codes. However, instead of scribbling on redundant pieces and relying on error correction to preserve the meaning, qart engineers the encoded values to create the picture in a code with no inherent errors.
This package implements a functionality to translate C to Go source code.
Package pgconn is a low-level PostgreSQL database driver. It operates at nearly the same level as the C library libpq.
It is primarily intended to serve as the foundation for higher level libraries such as https://github.com/jackc/pgx. Applications should handle normal queries with a higher level library and only use pgconn directly when required for low-level access to PostgreSQL functionality.
This package provides an implementation of the Unicode Text Segmentation specification for Go. Specifically, it currently includes only the grapheme cluster segmentation algorithm.
This package provides a Go library for reading from continuously updating files, like tail -f.
This package provides a Sqlite3 driver for Go using database/sql.
This package provides an implementation of the Unicode Text Segmentation specification for Go. Specifically, it currently includes only the grapheme cluster segmentation algorithm.
This package provides a library for Goroutines that helps to implement more complicated parallel cases.
This package provides a cross-platform facility for creating temporary files that are automatically cleaned up (even in the event of an unexpected process exit).
This package implements ULID as specified in https://github.com/ulid/spec.
Features of ULID:
128-bit compatibility with UUID
1.21e+24 unique ULIDs per millisecond
lexicographically sortable
canonically encoded as a 26 character string, as opposed to the 36 character UUID
uses Crockford's base32 for better efficiency and readability (5 bits per character)
case insensitive
no special characters (URL safe)
monotonic sort order (correctly detects and handles the same millisecond)
This package provides a command line interface (CLI) tool.
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.
This package provides an easy access to native byte order.
The loginshell package provides a Go library to get the login shell of the current user.
Package glob provides objects for matching strings with globs.
This package provides the Windows API used at Charmbracelet.
This package provides a syntactically different way to iterate over integers.
Suture provides Erlang-ish supervisor trees for Go. "Supervisor trees" -> "sutree" -> "suture" -> holds your code together when it's trying to die.
It is intended to deal gracefully with the real failure cases that can occur with supervision trees (such as burning all your CPU time endlessly restarting dead services), while also making no unnecessary demands on the "service" code, and providing hooks to perform adequate logging with in a production environment
This package provides features beyond the defacto YAML library including:
Pretty format for error notifications
Support Scanner or Lexer or Parser as public API
Support Anchor and Alias to Marshaler
Allow referencing elements declared in another file via anchors
Extract value or AST by YAMLPath (YAMLPath is like a JSONPath)
This package implements a various systemd bindings and provides Golang submodules:
activation- for writing and using socket activation from Godaemon- for notifying systemd of service status changesdbus- for starting/stopping/inspecting running services and unitsjournal- for writing to systemd's logging service, journaldsdjournal- for reading from journald by wrapping its C APIlogin1- for integration with the systemd logind APImachine1- for registering machines/containers with systemdunit- for (de)serialization and comparison of unit files
cli is a library for implementing command-line interfaces. Features:
easy sub-command based CLIs:
cli foo,cli bar, etc.support for nested subcommands such as
cli foo baroptional support for default subcommands so
clidoes something other than errorsupport for shell autocompletion of subcommands, flags, and arguments with callbacks in Go
automatic help generation for listing subcommands
automatic help flag recognition of
-h,--help, etc.automatic version flag recognition of
-v,--versionhelpers for interacting with the terminal, such as outputting information, asking for input, etc.
use of Go interfaces/types makes augmenting various parts of the library a piece of cake
This package provides a way to check whether two Go source directories contain equivalent code.
Optimized codec for []byte <=> base36 string conversion.
The goipp package implements the IPP core protocol, as defined by @urlhttps://rfc-editor.org/rfc/rfc8010.html,RFC 8010.