Skip to main content
1

🏎️ Throughput Priority (Unordered)

Future<List<T>>
int
required
The maximum number of Futures to run simultaneously.
Executes multiple Futures concurrently with a maximum limit. When one finishes, the next is immediately launched.
The results are ordered by completion time and are not guaranteed to match the input iterable’s order. Prioritize this for maximum speed.
2

✍️ Order Preservation

Future<List<T>>
int
required
The maximum number of Futures to run simultaneously.
Executes multiple Futures concurrently while guaranteeing the final list order matches the original input iterable’s index.
This requires slightly more internal complexity to manage the results, making it marginally slower but ensuring index reliability.