Miscellaneous Data Structures and Algorithms

Implementation of dataframes, series, and data wrangling methods for Go

Concurrent scalable data structures like `xsync.Map`, a concurrent generic hash table

HyperLogLog implementation with Sparse, LogLog-Beta bias correction and TailCut space reduction

In-memory geo index

Region quadtrees with efficient point location and neighbour finding

A comprehensive, reusable and efficient concurrent-safe generics utility functions and data structures library

Determine how intervals relate to each other

Generic tuple implementation for Go 1.18+

Finite-State Machine package

Generic slice, map, set, iterator, and goroutine utilities

ID type with marshalling to/from hash to prevent sending IDs to clients

Go implementation Count-Min-Log sketch: Approximately counting with approximate counters (Like Count-Min sketch but using less memory)

Highly concurrent drop-in replacement for `bufio.Writer`

Go 1.18+ generics package inspired by Kotlin's Sequence and Map

Go Data Structures using Go 1.18 generics

Generic, zero-alloc, 100%-test covered quadtree

FSM for Go

Pure, generic functions for slices

fractional api for Go

Combinatorial operations including permutations, combinations, and combinations-with-replacement