This package generates UUID-format strings using high quality bytes. It is not intended to be RFC compliant, merely to use a well-understood string representation of a 128-bit value. It can also parse UUID-format strings into their component bytes.

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

Package glob provides objects for matching strings with globs.

gocovmerge takes the results from multiple go test -coverprofile runs and merges them into one profile.

This package provides a wrapper for the Pluggable Authentication Modules application API.

This package provides a small error library that augments the errors library in go standard library.

This package implements /dev/loop device in Go.

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 golang wrapper for parsing gocui keybindings.

Package optparse parses command line arguments very similarly to GNU getopt_long(). It supports long options and optional arguments, but does not permute arguments. It is intended as a replacement for Go's flag package.

Package silog provides a slog.Handler implementation that produces human-readable, logfmt-style output.

This package implements a functionality to translate C to Go source code.

This package implements a functionality to translate C to Go source code.

Pacakge p takes in values and returns a pointer to the value.

Ristretto is a fast, fixed size, in-memory cache with a dual focus on throughput and hit ratio performance. It's a fork of dgraph-io/ristretto project.

This package provides a pretty printing library for Golang values.

Package ring implements a FIFO queue backed by a ring buffer.

This package implements a functionalit to list currently running Go processes.

This package facilitates the BusyBox style reexec of a binary. Handlers can be registered with a name and the argv 0 of the exec of the binary will be used to find and execute custom init paths.

This package provides decoding of basic EXIF and TIFF encoded data. Functionality is split into packages:

• exif - implements decoding of EXIF data as defined in the EXIF 2.2 specification (http://www.exif.org/Exif2-2.PDF)

• mknote - provides makernote parsers that can be used with goexif/exif

• tiff - implements TIFF decoding as defined in TIFF 6.0 specification at http://partners.adobe.com/public/developer/en/tiff/TIFF6.pdf

Go library for input handling using Windows Console API.

This package provides set of utilities/abstractions developed as part of datastore connectivity and testing (viant/dsc, viant/dsunit).

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.

Semver is a library for Semantic versioning written in Go.