User-friendly atomic operations wrapper providing JDK-like atomic API for Rust.
Qubit Atomic is a comprehensive atomic operations library that provides easy-to-use atomic types with reasonable default memory orderings, similar to Java's java.util.concurrent.atomic package. It hides the complexity of memory ordering while maintaining zero-cost abstraction and allowing advanced users to access underlying types for fine-grained control.
- Ease of Use: Hides memory ordering complexity with reasonable defaults
- Completeness: Provides high-level operations similar to JDK atomic classes
- Safety: Guarantees memory safety and thread safety
- Performance: Zero-cost abstraction with no additional overhead
- Flexibility: Exposes underlying types via
inner()for advanced users - Simplicity: Minimal API surface without
_with_orderingvariants
- Integer Specializations:
Atomic<i8>,Atomic<u8>,Atomic<i16>,Atomic<u16>,Atomic<i32>,Atomic<u32>,Atomic<i64>,Atomic<u64>,Atomic<i128>,Atomic<u128>,Atomic<isize>,Atomic<usize> - Boolean Specialization:
Atomic<bool>with set, clear, negate, logical AND/OR/XOR, and conditional CAS helpers - Floating-Point Specializations:
Atomic<f32>andAtomic<f64>with arithmetic operations implemented through CAS loops - Rich Operations: increment, decrement, add, subtract, multiply, divide, bitwise operations, max/min
- Functional Updates:
fetch_update,fetch_accumulate
AtomicCount: non-negative count for active tasks, in-flight requests, and resource usageAtomicSignedCount: signed count for deltas, balances, backlog, and offsets- No-Wrap Semantics: checked updates that panic or return
Noneinstead of wrapping - Zero-Transition Logic:
inc,dec,add, andsubreturn the new value
- AtomicRef: Thread-safe atomic reference using
Arc<T> - Reference Updates: Atomic swap and CAS operations
- Functional Updates: Transform references atomically
ArcAtomic<T>: convenience newtype aroundArc<Atomic<T>>ArcAtomicRef<T>: convenience newtype aroundArc<AtomicRef<T>>ArcAtomicCount/ArcAtomicSignedCount: shared-owner wrappers for the count types- Shared Container Clone: cloning an
ArcAtomic*value shares the same atomic container
- Atomic: Generic entry point for primitive atomic values
- AtomicRef: Atomic
Arc<T>reference wrapper AtomicCount/AtomicSignedCount: checked state-oriented semantics (no silent wrap)ArcAtomic*wrappers: ergonomic shared ownership without spellingArc<...>at every use site
Add this to your Cargo.toml:
[dependencies]
qubit-atomic = "0.10.0"Atomic<T> is generic over the primitive value type. Rust usually infers T from the argument to Atomic::new, but literals such as 0 can be ambiguous across integer widths.
In those cases, pick T explicitly using a turbofish on the constructor, or by annotating the variable:
use qubit_atomic::Atomic;
let wide: Atomic<u64> = Atomic::new(0);
assert_eq!(wide.load(), 0u64);
let narrow = Atomic::<i16>::new(0);
assert_eq!(narrow.load(), 0i16);use qubit_atomic::Atomic;
use std::sync::Arc;
use std::thread;
fn main() {
let counter = Arc::new(Atomic::<i32>::new(0));
let mut handles = vec![];
// Spawn 10 threads, each increments counter 1000 times
for _ in 0..10 {
let counter = counter.clone();
let handle = thread::spawn(move || {
for _ in 0..1000 {
counter.fetch_inc();
}
});
handles.push(handle);
}
// Wait for all threads to complete
for handle in handles {
handle.join().unwrap();
}
// Verify result
assert_eq!(counter.load(), 10000);
println!("Final count: {}", counter.load());
}Use Atomic<T> for pure metrics. Use AtomicCount when the
count is part of concurrent state, such as active work or termination checks.
use qubit_atomic::{
AtomicCount,
AtomicSignedCount,
};
fn main() {
let active_tasks = AtomicCount::zero();
active_tasks.inc();
assert!(!active_tasks.is_zero());
if active_tasks.dec() == 0 {
println!("all active tasks are finished");
}
let backlog_delta = AtomicSignedCount::zero();
assert_eq!(backlog_delta.add(5), 5);
assert_eq!(backlog_delta.sub(8), -3);
assert!(backlog_delta.is_negative());
}Use the ArcAtomic* wrappers when the atomic container itself is shared across
threads or components. Their clone() operation clones the outer Arc, so all
clones observe and update the same container.
use qubit_atomic::{
ArcAtomic,
ArcAtomicCount,
ArcAtomicRef,
ArcAtomicSignedCount,
};
use std::sync::Arc;
use std::thread;
fn main() {
let requests = ArcAtomic::new(0usize);
let worker_requests = requests.clone();
let handle = thread::spawn(move || {
worker_requests.fetch_inc();
});
handle.join().expect("worker should finish");
assert_eq!(requests.load(), 1);
assert_eq!(requests.strong_count(), 1);
let active_tasks = ArcAtomicCount::zero();
let shared_tasks = active_tasks.clone();
assert_eq!(shared_tasks.inc(), 1);
assert_eq!(active_tasks.get(), 1);
let backlog = ArcAtomicSignedCount::zero();
let shared_backlog = backlog.clone();
assert_eq!(shared_backlog.sub(3), -3);
assert_eq!(backlog.get(), -3);
let config = ArcAtomicRef::from_value(String::from("v1"));
let same_config = config.clone();
same_config.store(Arc::new(String::from("v2")));
assert_eq!(config.load().as_str(), "v2");
}use qubit_atomic::Atomic;
fn increment_even_only(atomic: &Atomic<i32>) -> Result<i32, &'static str> {
let mut current = atomic.load();
loop {
// Only increment even values
if current % 2 != 0 {
return Err("Value is odd");
}
let new = current + 2;
match atomic.compare_set(current, new) {
Ok(_) => return Ok(new),
Err(actual) => current = actual, // Retry
}
}
}
fn main() {
let atomic = Atomic::<i32>::new(10);
match increment_even_only(&atomic) {
Ok(new_value) => println!("Successfully incremented to: {}", new_value),
Err(e) => println!("Failed: {}", e),
}
assert_eq!(atomic.load(), 12);
}use qubit_atomic::Atomic;
fn main() {
let atomic = Atomic::<i32>::new(10);
// Update using a function (returns old value)
let old_value = atomic.fetch_update(|x| {
if x < 100 {
x * 2
} else {
x
}
});
assert_eq!(old_value, 10);
assert_eq!(atomic.load(), 20);
println!("Updated value: {}", atomic.load());
// Accumulate operation (returns old value)
let old_result = atomic.fetch_accumulate(5, |a, b| a + b);
assert_eq!(old_result, 20);
assert_eq!(atomic.load(), 25);
println!("Accumulated value: {}", atomic.load());
}use qubit_atomic::AtomicRef;
use std::sync::Arc;
#[derive(Debug, Clone)]
struct Config {
timeout: u64,
max_retries: u32,
}
fn main() {
let config = Arc::new(Config {
timeout: 1000,
max_retries: 3,
});
let atomic_config = AtomicRef::new(config);
// Update configuration
let new_config = Arc::new(Config {
timeout: 2000,
max_retries: 5,
});
let old_config = atomic_config.swap(new_config);
println!("Old config: {:?}", old_config);
println!("New config: {:?}", atomic_config.load());
// Update using a function (returns old value)
let old = atomic_config.fetch_update(|current| {
Arc::new(Config {
timeout: current.timeout * 2,
max_retries: current.max_retries + 1,
})
});
println!("Previous config: {:?}", old);
println!("Updated config: {:?}", atomic_config.load());
}use qubit_atomic::Atomic;
use std::sync::Arc;
struct Service {
running: Arc<Atomic<bool>>,
}
impl Service {
fn new() -> Self {
Self {
running: Arc::new(Atomic::<bool>::new(false)),
}
}
fn start(&self) {
// Only start if not already running
if self.running.set_if_false(true).is_ok() {
println!("Service started successfully");
} else {
println!("Service is already running");
}
}
fn stop(&self) {
// Only stop if currently running
if self.running.set_if_true(false).is_ok() {
println!("Service stopped successfully");
} else {
println!("Service is already stopped");
}
}
fn is_running(&self) -> bool {
self.running.load()
}
}
fn main() {
let service = Service::new();
service.start();
assert!(service.is_running());
service.start(); // Duplicate start will fail
service.stop();
assert!(!service.is_running());
service.stop(); // Duplicate stop will fail
}use qubit_atomic::Atomic;
use std::sync::Arc;
use std::thread;
fn main() {
let sum = Arc::new(Atomic::<f32>::new(0.0));
let mut handles = vec![];
// Spawn 10 threads, each adds 100 times
for _ in 0..10 {
let sum = sum.clone();
let handle = thread::spawn(move || {
for _ in 0..100 {
sum.fetch_add(0.01);
}
});
handles.push(handle);
}
for handle in handles {
handle.join().unwrap();
}
// Note: Due to floating-point precision, result may not be exactly 10.0
let result = sum.load();
println!("Sum: {:.6}", result);
println!("Error: {:.6}", (result - 10.0).abs());
}| Method | Description | Memory Ordering |
|---|---|---|
new(value) |
Create new atomic | - |
load() |
Load current value | Acquire |
store(value) |
Store new value | Release |
swap(value) |
Swap value, return old | AcqRel |
compare_set(current, new) |
CAS operation, return Result | AcqRel/Acquire |
compare_set_weak(current, new) |
Weak CAS, return Result | AcqRel/Acquire |
compare_and_exchange(current, new) |
CAS operation, return actual value | AcqRel/Acquire |
compare_and_exchange_weak(current, new) |
Weak CAS, return actual value | AcqRel/Acquire |
fetch_update(f) |
Functional update, return old | AcqRel/Acquire |
inner() |
Access underlying backend type | - |
| Method | Description | Memory Ordering |
|---|---|---|
fetch_inc() |
Post-increment, return old | Relaxed |
fetch_dec() |
Post-decrement, return old | Relaxed |
fetch_add(delta) |
Post-add, return old | Relaxed |
fetch_sub(delta) |
Post-subtract, return old | Relaxed |
fetch_mul(factor) |
Post-multiply, return old | AcqRel (CAS loop) |
fetch_div(divisor) |
Post-divide, return old | AcqRel (CAS loop) |
fetch_and(value) |
Bitwise AND, return old | AcqRel |
fetch_or(value) |
Bitwise OR, return old | AcqRel |
fetch_xor(value) |
Bitwise XOR, return old | AcqRel |
fetch_not() |
Bitwise NOT, return old | AcqRel |
fetch_max(value) |
Atomic max, return old | AcqRel |
fetch_min(value) |
Atomic min, return old | AcqRel |
fetch_update(f) |
Functional update, return old | AcqRel/Acquire |
fetch_accumulate(x, f) |
Accumulate, return old | AcqRel/Acquire |
| Method | AtomicCount |
AtomicSignedCount |
Description |
|---|---|---|---|
new(value) |
usize |
isize |
Create a count |
zero() |
Yes | Yes | Create a zero value |
get() |
usize |
isize |
Read the current value |
is_zero() |
Yes | Yes | Check whether the value is zero |
is_positive() |
Yes | Yes | Check whether the value is positive |
is_negative() |
No | Yes | Check whether the value is negative |
inc() |
Yes | Yes | Increment by one, return new value |
dec() |
Panic on underflow | Allows negative values | Decrement by one, return new value |
add(delta) |
Panic on overflow | Panic on overflow | Add delta, return new value |
sub(delta) |
Panic on underflow | Panic on overflow | Subtract delta, return new value |
try_add(delta) |
None on overflow |
None on overflow |
Checked add |
try_dec() |
None at zero |
No | Checked decrement |
try_sub(delta) |
None on underflow |
None on overflow |
Checked subtract |
The ArcAtomic* wrappers dereference to their underlying atomic container, so
you can call operations such as load, fetch_inc, store, inc, and sub
directly on the wrapper.
| Method | Available On | Description |
|---|---|---|
new(value) |
ArcAtomic<T>, ArcAtomicCount, ArcAtomicSignedCount |
Create a new shared wrapper from an initial value |
new(Arc<T>) |
ArcAtomicRef<T> |
Create a shared atomic reference from an existing Arc<T> |
from_value(value) |
ArcAtomicRef<T> |
Create a shared atomic reference from an owned value |
from_atomic(...) |
ArcAtomic<T> |
Wrap an existing Atomic<T> |
from_atomic_ref(...) |
ArcAtomicRef<T> |
Wrap an existing AtomicRef<T> |
from_count(...) |
ArcAtomicCount, ArcAtomicSignedCount |
Wrap an existing count container |
from_arc(arc) |
All ArcAtomic* wrappers |
Wrap an existing Arc<...> container |
as_arc() |
All ArcAtomic* wrappers |
Borrow the underlying Arc<...> |
into_arc() |
All ArcAtomic* wrappers |
Consume the wrapper and return the underlying Arc<...> |
strong_count() |
All ArcAtomic* wrappers |
Return the number of strong Arc owners |
| Method | Description | Memory Ordering |
|---|---|---|
fetch_set() |
Set to true, return old | AcqRel |
fetch_clear() |
Set to false, return old | AcqRel |
fetch_not() |
Negate, return old | AcqRel |
fetch_and(value) |
Logical AND, return old | AcqRel |
fetch_or(value) |
Logical OR, return old | AcqRel |
fetch_xor(value) |
Logical XOR, return old | AcqRel |
set_if_false(new) |
CAS if false | AcqRel/Acquire |
set_if_true(new) |
CAS if true | AcqRel/Acquire |
| Method | Description | Memory Ordering |
|---|---|---|
fetch_add(delta) |
Atomic add, return old | AcqRel (CAS loop) |
fetch_sub(delta) |
Atomic subtract, return old | AcqRel (CAS loop) |
fetch_mul(factor) |
Atomic multiply, return old | AcqRel (CAS loop) |
fetch_div(divisor) |
Atomic divide, return old | AcqRel (CAS loop) |
fetch_update(f) |
Functional update, return old | AcqRel/Acquire |
| Operation Type | Default Ordering | Reason |
|---|---|---|
Pure Read (load()) |
Acquire |
Ensure reading latest value |
Pure Write (store()) |
Release |
Ensure write visibility |
Read-Modify-Write (swap(), CAS) |
AcqRel |
Ensure both read and write correctness |
Atomic<T> integer ops (fetch_inc(), fetch_add()) |
Relaxed |
Pure metrics; no need to sync other data |
AtomicCount / AtomicSignedCount (inc(), dec()) |
CAS loop | Values used as concurrent state signals |
Bitwise Operations (fetch_and(), fetch_or()) |
AcqRel |
Usually used for flag synchronization |
Max/Min Operations (fetch_max(), fetch_min()) |
AcqRel |
Often used with threshold checks |
Functional Updates (fetch_update()) |
AcqRel / Acquire |
CAS loop standard semantics |
For scenarios requiring fine-grained memory ordering control (approximately 1% of use cases), use inner() to access the underlying backend type:
use std::sync::atomic::Ordering;
use qubit_atomic::Atomic;
let atomic = Atomic::<i32>::new(0);
// 99% of scenarios: use simple API
let value = atomic.load();
// 1% of scenarios: need fine-grained control
let value = atomic.inner().load(Ordering::Relaxed);
atomic.inner().store(42, Ordering::Release);| Feature | JDK | Qubit Atomic | Notes |
|---|---|---|---|
| Basic Types | 3 types | Atomic<T> specializations |
Rust supports more integer, floating-point, boolean, and counter use cases |
| Memory Ordering | Implicit (volatile) | Default + inner() optional |
Rust more flexible |
| Weak CAS | weakCompareAndSet |
compare_set_weak |
Equivalent |
| Reference Type | AtomicReference<V> |
AtomicRef<T> |
Rust uses Arc<T> |
AtomicCount / AtomicSignedCount |
Manual composition | AtomicCount, AtomicSignedCount |
Non-negative / signed counts for state tracking |
| Shared Ownership | Usually object references | ArcAtomic<T>, ArcAtomicRef<T>, ArcAtomicCount, ArcAtomicSignedCount |
Convenience wrappers for shared atomic containers |
| Nullability | Allows null |
Use Option<Arc<T>> |
Rust no null pointers |
| Bitwise Operations | Partial support | Full support | Rust more powerful |
| Max/Min Operations | Java 9+ support | Supported | Equivalent |
| API Count | ~20 methods/type | ~25 methods/type | Rust provides more convenience methods |
Primitive wrappers use #[repr(transparent)] and #[inline] so the generic API compiles down to the backend atomic operations:
// Our wrapper
let atomic = Atomic::<i32>::new(0);
let value = atomic.load();
// Compiles to the same code as
let atomic = std::sync::atomic::AtomicI32::new(0);
let value = atomic.load(Ordering::Acquire);99% of scenarios: Use default API, which already provides optimal performance.
1% of scenarios: Use inner() only when:
- Extreme performance optimization (need
Relaxedordering) - Complex lock-free algorithms (need precise memory ordering control)
- Interoperating with code that directly uses standard library or
portable-atomicbackend types
Golden Rule: Default API first, inner() as last resort.
This project maintains comprehensive test coverage with detailed validation of all functionality.
# Run all tests
cargo test
# Run with coverage report
./coverage.sh
# Generate text format report
./coverage.sh text
# Run CI checks (format, clippy, test, coverage)
./ci-check.shSee COVERAGE.md for detailed coverage statistics.
Runtime dependencies are intentionally small:
arc-swappowersAtomicRef<T>.portable-atomicprovides the stable backend forAtomic<i128>andAtomic<u128>.
Copyright (c) 2025 - 2026. Haixing Hu, Qubit Co. Ltd. All rights reserved.
Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License.
See LICENSE for the full license text.
Contributions are welcome! Please feel free to submit a Pull Request.
- Follow the Rust API guidelines
- Maintain comprehensive test coverage
- Document all public APIs with examples
- Ensure all tests pass before submitting PR
Haixing Hu - Qubit Co. Ltd.
More Rust libraries from Qubit are published under the qubit-ltd organization on GitHub.
Repository: https://github.com/qubit-ltd/rs-atomic