extra-collections (or extra for short) is a python3 package that provides a pythonic, intuitive, and easy implementation of the most common data structures used in software projects.

Algorithms and Data Structures, solutions to common CS problems.

Numpy ring buffer at a fixed memory address to allow for significantly sped up numpy, sigpy, numba & pyFFTW calculations.

Data structures for Redis

Is works on the principle of a ring buffer. Due to the fact that there is no need to allocate memory again, each operation is performed in O(1). This queue implementation has a significant drawback: a limit on the maximum size.

Classic Snake made with pygame library and collections.deque!

asyncio-mongo-reflection is an ORM like library. It provides reflections that write each separate change of wrapped python's list/deque, dict or any their nested combination to mongodb objects asynchronously in background using asyncio.

Python program utilizing namedtuples, defaultdict, dictionaries, and deque for efficient organization, display, and management of elementary and composite product details.

✔️ Abstract Data Types algorithm in Python

Thread-safe, double-ended queue with queue.Queue()-like functionality. Supports blocking operations, task tracking, join() and task_done() methods.

A deque with mostly standard functionality plus a few additional features.

A personal collection of code notes, use cases, and best practices organized by topics for quick reference.

Data Structures and Algorithms in Python

📘 2월 알고리즘 스터디

CLI War card game in Python

Master's | Basic Algorithms & Data structures | Module 2 | Main Data Strucrures

Pluggable, compressed in-memory queues and deques for both sync and asyncio applications.

Simple Double-ended Queue (DEQUE) implementation in Python, made to my data structures class

In computer science, a double-ended queue (abbreviated to deque) is an abstract data type that generalizes a queue, for which elements can be added to or removed from either the front (head) or back (tail).