57
array-deque
v0.4.0 ExperimentalFixed-capacity circular buffer implementations: heap-allocated ArrayDeque and stack-allocated StackArrayDeque. Efficient O(1) operations, no_std support.
MIT Edition 2024
Data structuresNo standard library #data-structures#deque#circular-buffer#ring-buffer#fixed-capacity
Quick Verdict
- ✓Actively maintained (updated 2d ago)
- !Pre-1.0: API may have breaking changes
- ✓Tiny footprint (13KB, 2 deps)
- ✓Permissive license (MIT)
Security
Checking security advisories...
Downloads
5.5K
Dependents
0
Releases
5
Size
13KB
Deep Insights
📈
Strong growth momentum
655 downloads in the last 30 days (22/day), up 785% from the previous period.
🪶
Minimal dependencies
Only 2 direct dependencies. Lean dependency tree means faster builds and lower supply chain risk.
📐
Compact crate
At 12KB, array-deque is lightweight. Small crate size correlates with focused, well-scoped functionality.
Health Breakdown
Maintenance 18/25
Recency, release consistency, active ratio
Quality 16/25
Yanked ratio, deps, size, maturity, features
Community 6/20
Reverse deps, ownership, ecosystem
Popularity 4/15
Downloads, momentum, growth trend
Documentation 13/15
Docs, repo, license, metadata
Download Trend
Daily downloads · last 90 days
13/day avg+42%
Version Adoption
v0.3.1
75%
v0.2.0
8%
v0.3.0
8%
v0.1.0
8%
v0.4.0
0%
Release Timeline
5 releasessince 2025
J
F
M
A
M
J
J
A
S
O
N
D
2025
4
2026
1
LessMore
Feature Flags
default =["std"]
std*serde
README
Loading README...
Maintainers
Dependencies
2
direct dependencies
Dependents
0
crates depend on array-deque