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
//! Basic heuristics for whether or not to use a parallel or serial verion of an algorithm.
//!
//! The parallel implementations in this crate generally have a noticeable overhead when compared
//! to the serial versions on small problem sizes.
/// These are operations that work on a per-table or per-rule level where the size of the workload
/// is hard to gauge ahead of time. In this case, we gate parallel execution based on the number of
/// threads available and whether the total size of the database exceeds a certain threshold.
pub
/// Whether or not to use a parallel algorithm to construct a hash index.
pub
/// Whtether or not to use a parallel algorithm to rebuild a [`crate::table::SortedWritesTable`].
pub
/// Whether or not to perform an operation for a given container memo table.
pub
/// Whether or not to perform an operation in parallel across a set of different container memo
/// tables.
pub
pub