---
id: queuelib
version: "1.9.0"
license: BSD-3-Clause
license_treatment: permissive
maintenance: active
---

# queuelib — Collection of persistent (disk-based) and non-persistent (memory-based) queues

License: permissive · Maintenance: active · Downloads: 3.1M/mo

## What it is and what it does

Queuelib is a collection library that implements standard queue data structures—FIFO queues, LIFO stacks, priority queues, and round-robin queues—with the option to store them in memory or persist them to disk. Each collection type exposes a simple push/pop API and is designed for speed. The library has no external dependencies and supports modern Python versions from 3.10 onward.

It is typically used in scenarios where you need a durable work queue that survives process restarts, or where you want to manage items with priority or fair distribution across multiple sources. The disk-based variants allow you to queue large numbers of items without keeping them all in RAM, making it useful for batch processing, task scheduling, and buffering workloads.

Use it for:

- Persist task queues to disk in web scrapers or background job systems to survive restarts
- Implement priority-based work distribution where higher-priority tasks are processed first
- Fair-share scheduling across multiple data sources using round-robin dequeuing
- Buffer large datasets on disk when processing streams that exceed available memory
- Build durable message queues for offline-first or resilient data pipelines

## Worth the install?

AI-flagged interpretation of the facts above — verify before relying.

Queuelib provides in-memory and disk-persisted queue, stack, priority queue, and round-robin collection implementations with a simple API.

Yes. Queuelib is actively maintained, has no dependencies, supports current Python versions, carries no known vulnerabilities, and offers a straightforward solution for persistent and in-memory queuing. Install it if you need disk-backed queues or priority/round-robin scheduling; skip it if you require thread-safety or distributed queue semantics.

## Install

pip install queuelib
uv add queuelib
poetry add queuelib

## Installing queuelib

Before you install: Low friction: pure Python, no runtime dependencies, and actively maintained with recent releases. Supports Python 3.10 through 3.14 and PyPy.

License in practice: BSD-3-Clause permissive license allows use in commercial and proprietary projects with minimal restrictions.

Quickstart:

pip install queuelib

from queuelib import FifoDiskQueue
q = FifoDiskQueue('queuefile')
q.push(b'item')
item = q.pop()
q.close()

Requires Python 3.10 or later. Collections are not thread-safe.

Verify before relying:

- Whether disk-persisted queues survive process crashes or only graceful shutdown
- Performance characteristics at scale (queue size, throughput limits)
- Thread-safety workarounds or recommended patterns for concurrent access

## Package facts

- License: BSD-3-Clause (permissive)
- Python support: supports_current
- Install friction: low
- Maintenance: active
- Downloads: 3.1M/month (top 5,000 on PyPI)
- Known vulnerabilities: none known

## Tags

disk-based queue implementation, persistent FIFO LIFO queue, priority queue library, round-robin queue, in-memory queue storage, queue data structure, persistent collections, data-structures, persistence, task-queue

[View on SkillFed](https://skillfed.io/packages/queuelib) · [View on PyPI](https://pypi.org/project/queuelib/)