|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
A query for Mo's algorithm: inclusive range [l, r] with id. More...
#include <tpl_mo_algorithm.H>
Public Attributes | |
| size_t | l |
| Left endpoint (inclusive, 0-based). | |
| size_t | r |
| Right endpoint (inclusive, 0-based). | |
| size_t | id |
| Original query index (for reordering answers). | |
A query for Mo's algorithm: inclusive range [l, r] with id.
Definition at line 82 of file tpl_mo_algorithm.H.
| size_t Aleph::Mo_Query::id |
Original query index (for reordering answers).
Definition at line 86 of file tpl_mo_algorithm.H.
| size_t Aleph::Mo_Query::l |
Left endpoint (inclusive, 0-based).
Definition at line 84 of file tpl_mo_algorithm.H.
Referenced by Aleph::Gen_Mo_On_Trees< GT, Policy >::mo_sweep(), Aleph::Gen_Mo_On_Tree_Node< T, Policy >::mo_sweep(), and Aleph::Gen_Mo_Algorithm< T, Policy >::solve().
| size_t Aleph::Mo_Query::r |
Right endpoint (inclusive, 0-based).
Definition at line 85 of file tpl_mo_algorithm.H.
Referenced by Aleph::Gen_Mo_On_Trees< GT, Policy >::mo_sweep(), Aleph::Gen_Mo_On_Tree_Node< T, Policy >::mo_sweep(), and Aleph::Gen_Mo_Algorithm< T, Policy >::solve().