radix_Plus

⚡ A high-performance, parallelized Radix Sort library for Dart.

radix_Plus brings native-like speed to Dart’s sorting world. It’s designed for developers who need maximum performance, low GC pressure, and fine-grained control over memory and threading.

🚀 Core Highlights

Multi-Type Sorting: Supports List<int>, List<double>, and List<BigInt>.
Stable & Accurate: Preserves order of equal elements and correctly handles signed values, ±0, ±∞, and NaN.
TypedData Optimized: Works directly with Int32List, Uint32List, and Float64List for zero-copy performance.
Parallel Execution: Leverages Isolates for large-scale data sorting.
Adaptive Hybrid Logic: Automatically switches to insertion sort for small segments to minimize overhead.

🧠 Advanced Capabilities

Buffer Pooling: Reuse pre-allocated buffers to reduce GC overhead.
Range Optimization: Specialized BigInt routines with maxBitLength hints.
Custom Merge Strategies: Control parallel merge behavior for massive datasets.
Performance Estimation: Benchmark potential speedups with estimateParallelPerformance().

🧰 API Overview

Function	Description
`radixSortInt()`	Sorts any `List<int>` (signed/unsigned).
`radixSortDouble()`	Stable sort for doubles (handles ±∞, NaN).
`radixSortBigInt()`	Hybrid Radix Sort for arbitrary precision integers.
`radixSortFloat64()`	Zero-copy sorting for `Float64List`.
`radixSortParallelUnsigned()`	Multi-core sorting for large unsigned integer lists.
`clearBufferPools()`	Frees all global buffer pools to release memory.

⚙️ Example

import 'package:radix_Plus/radix_Plus.dart';

void main() {
  final data = List.generate(1000000, (i) => 1000000 - i);

  // High-performance parallel radix sort
  await radixSortParallelUnsigned(data);

  print(data.take(10));
}

radix_plus library