chia-pos2 0.5.0

A library for creating plots, validating proofs of space, farming partial proofs and solving proofs. Using Chia proof of space v2
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94

#pragma once

#include <algorithm>
#include <cassert>
#include <functional>
#include <future>
#include <iterator>
#include <numeric>
#include <type_traits>
#include <vector>

#include "common/thread.hpp"

// A small, self-contained parallel_for_range utility.
// - Iterates over [first, last) and calls fn(element) for each element.
// - Provides overloads for iterator ranges and numeric index ranges.

// Iterator-based overloads
template <typename It, typename Fn>
std::enable_if_t<!std::is_integral<It>::value, void> parallel_for_range(It first, It last, Fn fn)
{
    unsigned hw = std::thread::hardware_concurrency();
    unsigned num_threads = hw == 0 ? 4u : hw;
    parallel_for_range(first, last, fn, num_threads);
}

template <typename It, typename Fn>
std::enable_if_t<!std::is_integral<It>::value, void> parallel_for_range(
    It first, It last, Fn fn, unsigned max_threads)
{
    using diff_t = typename std::iterator_traits<It>::difference_type;
    diff_t total = std::distance(first, last);
    if (total <= 0)
        return;

    unsigned num_threads = max_threads == 0 ? 1u : max_threads;
    num_threads = static_cast<unsigned>(std::min<diff_t>(num_threads, total));

    if (num_threads <= 1) {
        for (It it = first; it != last; ++it)
            fn(*it);
        return;
    }

    std::vector<thread> workers;
    workers.reserve(num_threads);

    for (unsigned t = 0; t < num_threads; ++t) {
        diff_t start = (total * t) / num_threads;
        diff_t end = (total * (t + 1)) / num_threads;
        It b = std::next(first, start);
        It e = std::next(first, end);

        workers.emplace_back([b, e, &fn]() {
            for (It it = b; it != e; ++it)
                fn(*it);
        });
    }
}

// Numeric index range [start, stop)
template <typename T, typename Fn>
std::enable_if_t<std::is_integral_v<T>, void> parallel_for_range(
    T start, T stop, Fn fn, unsigned max_threads = std::thread::hardware_concurrency())
{
    using diff_t = T;
    diff_t total = (stop > start) ? (stop - start) : 0;
    if (total <= 0)
        return;

    unsigned num_threads = max_threads == 0 ? 1u : max_threads;
    num_threads = static_cast<unsigned>(std::min<diff_t>(num_threads, total));

    if (num_threads <= 1) {
        for (T i = start; i < stop; ++i)
            fn(i);
        return;
    }

    std::vector<thread> workers;
    workers.reserve(num_threads);

    for (unsigned t = 0; t < num_threads; ++t) {
        diff_t local_start = (total * t) / num_threads;
        diff_t local_end = (total * (t + 1)) / num_threads;
        T b = static_cast<T>(start + local_start);
        T e = static_cast<T>(start + local_end);

        workers.emplace_back([b, e, &fn]() {
            for (T i = b; i < e; ++i)
                fn(i);
        });
    }
}