This Go library provides facilities for pattern matching on file names.

This package provides tooling and utility libraries for perfoming and reading benchmarks results.

• benchfmt - reads and writes the Go benchmark format

• benchunit - manipulates benchmark units and formats numbers in those units

• benchproc - provides tools for filtering, grouping, and sorting benchmark results

• benchmath - provides tools for computing statistics over distributions of benchmark measurements

Monolith-Go is a Go library for working with byte sequences.

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.

Golang utilities to make your life easier with zero allocations.

Go library for ini files

Package pgpassfile is a parser PostgreSQL .pgpass files.

Package opt implements command-line flag parsing.

This package provides a Go package to intelligently and flexibly pool among multiple hosts from your Go application. Host selection can operate in round robin or epsilon greedy mode, and unresponsive hosts are avoided.

This package provides a library for handling IP addresses, including IPv4 and IPv6 addresses, subnets, and ranges with support for parsing, validation, and manipulation.

Package sqlstruct provides some convenience functions for using structs with the Go standard library's database/sql package.

This package aims to provide algorithms optimized to leverage advanced instruction sets of modern CPUs to maximize throughput and take the best advantage of the available compute power. It includes functions that have often been designed to work on arrays of values, which is where SIMD and branchless algorithms shine.

go-multierror is Golang module providing a mechanism for representing a list of error values as a single error. It is fully compatible with the standard errors package, including the functions As, Is, and Unwrap. This provides a standardized approach for introspecting on error values.

Package gopher-luar simplifies data passing to and from gopher-lua.

Lumberjack is a Go package for writing logs to rolling files.

Package yaml implements YAML support for the Go language.

This library provides unit multipliers and functions for Go.

This package provides a text formatting functions in Go.

doublestar is a Go implementation of path pattern matching and globbing with support for "doublestar" patterns.

This package provides a library for Goroutines that helps to implement more complicated parallel cases.

Hasher is a tool to automate the creation of methods and tables for a string to uint32 mapper.

This package provides a Sqlite3 driver for Go using database/sql.

gostl is a data structure and algorithm library for Go, designed to provide functions similar to C++ STL.

Package webp implements a decoder and encoder for https://en.wikipedia.org/wiki/WebP, WebP images.