Currently GoMusicBrainz provides methods to perform search and lookup requests. Browse requests are not supported yet.

This package implements a functionality to marshal/unmarshal XML to/from map[string]interface values (and JSON); extract/modify values from maps by key or key-path, including wildcards.

Package expect provides an expect-like interface to automate control of applications. It is unlike expect in that it does not spawn or manage process lifecycle. This package only focuses on expecting output and sending input through it's psuedoterminal.

multierr allows combining one or more Go errors together.

This package implements a speed-optimized natural sorting (natsort) in Golang. This implementation does not allocate memory, does not depend on sort and hence doesn't depend on reflect.

This package provides a relatively simple declarative config format for zerolog supporting configuration files written in YAML or JSON.

runewidth provides functions to get fixed width of the character or string. It is a fork of https://github.com/mattn/go-runewidth, updated to the newest Unicode and having various helper functions removed, so all that remains is just the runewidth.RuneWidth() function.

This package parses text into shell arguments. Based on the cpan module Parse::CommandLine.

jsoncolor is a drop-in replacement for encoding/json's Marshal and MarshalIndent functions and Encoder type which produce colorized output using github.com/fatih/color.

This package provides a structured event logger for Golang developed for fluentd.

Package strutil provides string metrics for calculating string similarity as well as other string utility functions.

This package provides a library for environment variables substitution.

Replace uses of the time package with the clockwork.Clock interface instead.

This package implements a functionality for generating things based on go files. This mechanism was first used in Kubernetes code-generator and is split out here for ease of reuse and maintainability.

Multi-log is based on logrus, and supports concurrently logging to two destinations: the console and a log file.

Package builder provides a method for writing fluent immutable DSL builders. It uses immutable persistent data structures so that each step in the method chain can be reused.

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.

This package provides a functionality for encoding and decoding unsigned varints.

This package makes it a breeze to check and modify file permission bits.

This package implements sysconf and provides the associated SC_* constants to query system configuration values at run time.

This package provides a code generation tool for creating methods to serialize and de-serialize Go data structures to and from data interchange format - MessagePack. This package provides an command line interface (CLI) tool.

Package gettext provides bindings for https://www.gnu.org/software/gettext/.

Standalone FTS5 extension for @urlhttps://github.com/mattn/go-sqlite3,go-sqlite3, that provides full-text search functionality to database applications.

Package sqlite is a CGo-free port of SQLite. It is a drop-in replacement for mattn/go-sqlite3.