levenshtein

Related in Queues

• deheap - Doubly-ended heap (min-max heap) with O(log n) access to both minimum and maximum elements.
• deque - A highly optimized double-ended queue.
• deque - Fast ring-buffer deque (double-ended queue).
• dqueue - Simple, in memory, zero dependency and battle tested, thread-safe deferred queue.
• goconcurrentqueue - Concurrent FIFO queue.
• hatchet - Distributed, Fault-tolerant task queue.
• list - A generic, thread-safe doubly linked list with full iterator support and an intrusive singly linked list for embedded use; a feature-rich replacement for container/list.
• memlog - An easy to use, lightweight, thread-safe and append-only in-memory data structure inspired by Apache Kafka.
• queue - Multiple thread-safe, generic queue implementations for Go.
• dsu - Disjoint Set data structure implementation in Go.