README.md

#include <pls/pls.h>
#include <iostream>

long fib(long n);

int main() {
    // All memory needed by the scheduler can be allocated in advance either on stack or using malloc.
    const unsigned int num_threads = 8;
    const unsigned int memory_per_thread = 2 << 14;
    static pls::static_scheduler_memory<num_threads, memory_per_thread> memory;

    // Create the scheduler instance (starts a thread pool).
    pls::scheduler scheduler{&memory, num_threads};

    // Wake up the thread pool and perform work.
    scheduler.perform_work([&] {
        long result = fib(20);
        std::cout << "fib(20)=" << result << std::endl;
    });
    // At this point the thread pool sleeps.
    // This can for example be used for periodic work.
}

long fib(long n) {
    if (n == 0) {
        return 0;
    }
    if (n == 1) {
        return 1;
    }

    // Example for the high level API.
    // Will run both functions in parallel as seperate tasks.
    int left, right;
    pls::invoke_parallel(
            [&] { left = fib(n - 1); },
            [&] { right = fib(n - 2); }
    );
    return left + right;
}