gronx is cron expression parser ported from adhocore/cron-expr with task runner and daemon that supports crontab like task list file. It may be used programatically in Golang or as standalone binary instead of crond.

The OCI Image Format project creates and maintains the software shipping container image format spec (OCI Image Format).

Package yaml implements YAML support for the Go language.

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)

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.

go-units is a library to transform human friendly measurements into machine friendly values.

Package dig provides a functionality to implement resolving object dependencies graph during the process startup.

This package is a Go library that draws progress bars on the terminal.

Package uuid can be used to generate and parse universally unique identifiers, a standardized format in the form of a 128 bit number.

Package fuse enables writing FUSE file systems. It is a from-scratch implementation of the kernel-userspace communication protocol, and does not use the C library from the project called FUSE.

Package userns provides utilities to detect whether we are currently running in a Linux user namespace.

This package provides a single Tree implementation, optimized for sparse nodes of radix tree.

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

This package provides a native Go clean room implementation of the Porter Stemming Algorithm.

This package provides implementation of various data structures and algorithms in Go.

This package provides a collection Golang implementation defined in specification-runtime-spec.

Quant provides an interface for image color quantizers.

This is a memcache client library for the Go programming language.

reflectwalk is a Go library for "walking" a value in Go using reflection, in the same way a directory tree can be "walked" on the file system. Walking a complex structure can allow you to do manipulations on unknown structures such as those decoded from JSON.

This package provides a basic set of functions applying grammar rules to inflect English words, modify case style (Capitalize, camelCase, snake_case, etc.).

Go library provides utilities for building command line interfaces.

go-libnp is a tiny cross-platform library for extracting information about the music/image/video that is Now Playing on the system.

This package provides a golang wrapper for parsing gocui keybindings.

Atlas is a language-agnostic tool for managing and migrating database schemas using DevOps principles.