BadgerDB implements an embeddable, key-value (KV) database, written in pure Go. It is designed to be highly performant for both reads and writes simultaneously. It uses Multi-Version Concurrency Control, supports concurrent serializable transactions.

This package is a UPnP DLNA Digital Media Server. It runs from the terminal, and serves content directly from the filesystem from the working directory, or the path given. The SSDP component will broadcast and respond to requests on all available network interfaces.

flock implements a thread-safe file lock. It also includes a non-blocking TryLock function to allow locking without blocking execution.

Semver is a library for Semantic versioning written in Go.

go-redis is the official Redis client library for the Go programming language. It offers a straightforward interface for interacting with Redis servers. github.com/redis/go-redis and github.com/go-redis/redis are distributed from the same source.

Sprig is a library that provides more than 100 commonly used template functions.

This package provides a Go library for calculating sunrise and sunset times from geographical coordinates and a date.

This package provides Go helpers for data sizes (kilobytes, petabytes), human readable sizes, parsing.

Package pgservicefile is a parser for PostgreSQL service files (e.g. .pg_service.conf).

This package provides string-matching based on BSD fnmatch.3. It is an updated clone of kballards golang fnmatch gist (https://gist.github.com/kballard/272720).

Package strutil collects utils supplemental to the standard strings package.

Helper to merge structs and maps in Golang. Useful for configuration default values, avoiding messy if-statements.

Mergo merges same-type structs and maps by setting default values in zero-value fields. Mergo won't merge unexported (private) fields. It will do recursively any exported one. It also won't merge structs inside maps (because they are not addressable using Go reflection).

This package provides a Go implementation of the LevelDB key/value storage system.

This package provides a C99 compiler front end.

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 interface and 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.

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 bar

• optional support for default subcommands so cli does something other than error

• support 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, --version

• helpers 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

PG* is a protoc plugin library for efficient proto-based code generation.

This package provides an immutable treap implementation in the Go Language. A treap is a data structure that maintains a dynamic set of ordered keys and allows binary searches among the keys. Its height is, with high probability, proportional to the logarithm of the number of keys, so that each search, insertion, or deletion operation takes logarithmic time to perform. gtreap's implementation of a treap is immutable, and thus provides a simple approach to multi-version concurrency control. It's an alternative fork of https://github.com/steveyen/gtreap.

This library converts ANSI escape sequences to Windows API calls on Windows environment. You can easily use this feature by replacing fmt with ansi.

Package udev provides a cgo wrapper around the libudev C library.

This package provides a implementation of the Snowball stemmer for natural language processing.

Simple console customizable progress bars for Golang. It's an alternative fork of https://github.com/cheggaaa/pb.

closestmatch is a simple and fast Go library for fuzzy matching an input string to a list of target strings. closestmatch is useful for handling input from a user where the input (which could be mispelled or out of order) needs to match a key in a database. closestmatch uses a bag-of-words approach to precompute character n-grams to represent each possible target string. The closest matches have highest overlap between the sets of n-grams. The precomputation scales well and is much faster and more accurate than Levenshtein for long strings.

Package goversion provides utilities to get the Go module version information.