This is the cl-parallel Reference Manual, version 0.1.1, generated automatically by Declt version 4.0 beta 2 "William Riker" on Tue Jul 15 04:12:12 2025 GMT+0.
The main system appears first, followed by any subsystem dependency.
cl-parallelA fairly simple parallelism library for Common Lisp
Tom Hulihan
MIT
0.1.1
bordeaux-threads (system).
src/package.lisp (file).
src/future.lisp (file).
src/list.lisp (file).
Files are sorted by type and then listed depth-first from the systems components trees.
cl-parallel/cl-parallel.asdcl-parallel/src/package.lispcl-parallel/src/future.lispcl-parallel/src/list.lispcl-parallel/src/future.lispsrc/package.lisp (file).
cl-parallel (system).
future (macro).
future-finished-p (function).
future-p (function).
realize (function).
realize-if-finished (function).
cl-parallel/src/list.lispsrc/package.lisp (file).
src/future.lisp (file).
cl-parallel (system).
par-calls (macro).
par-every (function).
par-find (function).
par-find-if (function).
par-map (function).
par-map-chunked (function).
par-map-reduce (function).
par-some (function).
partition-if (function).
with-sequential-thread-queue (macro).
with-thread-queue (macro).
Packages are listed by definition order.
parallelbordeaux-threads.
common-lisp.
future (macro).
future-finished-p (function).
future-p (function).
par-calls (macro).
par-every (function).
par-find (function).
par-find-if (function).
par-map (function).
par-map-chunked (function).
par-map-reduce (function).
par-some (function).
realize (function).
realize-if-finished (function).
partition-if (function).
with-sequential-thread-queue (macro).
with-thread-queue (macro).
Definitions are sorted by export status, category, package, and then by lexicographic order.
This macro essentially creates a new future type – a computation that happens seperately from the rest of the program, and may or may not be finished
Make multiple calls in parallel.
Return true iff the argument is a live thread
Test whether or not a value is a future.
Given a predicate and a list, will determine if every element of the list satisfies that predicate.
Given an item and a list, will return that item if it is found, nil otherwise.
Given a predicate and a list, will return the first element in the list that satisfies that predicate.
This function computes a function upon a list in parallel.
Break a list up into ‘size‘ chunks, and process those chunks in parallel.
Given a mapping function, reducing function, and list, will map the values accross the list in parallel, then reduce them in the order that the computations finish.
Given a predicate and a list, return true if at least one element in the list satifies the predicate.
Force a future to be evaluated, or return nil if the value is not a future.
If the future is finished, return the value; if the future is still running, return the future; if the value is not a future, return it.
Given a predicate and a list, will return a list with the first element being all of the elements that satisfy the predicate, and the second element being all of the elements that do not satisfy the predicate.
| Jump to: | F M P R W |
|---|
| Jump to: | F M P R W |
|---|
| Jump to: | C F P S |
|---|
| Jump to: | C F P S |
|---|