| Adiar 2.1.0
    An External Memory Decision Diagram Library | 
Nested Sweeping statistics. More...
#include <adiar/statistics.h>
| Classes | |
| struct | inner_down_t | 
| Root Requests generated for Inner Down Sweep.  More... | |
| struct | inner_up_t | 
| Inner Up Sweep(s)  More... | |
| struct | outer_up_t | 
| Outer Reduce Sweep.  More... | |
| Public Attributes | |
| uintwide | skips = 0 | 
| Number of times Nested Sweeping Framework is skipped for a simple Reduce algorithm. | |
| uintwide | runs = 0 | 
| Number of times Nested Sweeping Framework is skipped for a simple Reduce algorithm. | |
| adiar::statistics::nested_sweeping_t::outer_up_t | outer_up | 
| Outer Reduce Sweep. " | |
| struct adiar::statistics::nested_sweeping_t::inner_down_t | inner_down | 
| Root Requests generated for Inner Down Sweep. " | |
| adiar::statistics::nested_sweeping_t::inner_up_t | inner_up | 
| Wrap an iterator into a consumer function. " | |
Nested Sweeping statistics.
Statistics related to runs of nested_sweep; some of the statistics to each specific instantiation (e.g. bdd_exists) is found in the algorithm's respective statistics.