![]() |
MySQL 8.0.43
Source Code Documentation
|
List of Discrete_interval objects. More...
#include <discrete_interval.h>
Public Member Functions | |
| Discrete_intervals_list () | |
| void | clear () |
| void | swap (Discrete_intervals_list *other) |
| const Discrete_interval * | get_next () |
| ~Discrete_intervals_list () | |
| bool | append (ulonglong start, ulonglong val, ulonglong incr) |
| Appends an interval to the list. More... | |
| ulonglong | minimum () const |
| ulonglong | maximum () const |
| uint | nb_elements () const |
Private Member Functions | |
| void | operator= (Discrete_intervals_list &) |
| bool | append (Discrete_interval *new_interval) |
| void | copy_shallow (const Discrete_intervals_list *other) |
| Discrete_intervals_list (const Discrete_intervals_list &other) | |
Private Attributes | |
| Discrete_interval | first_interval |
| To avoid heap allocation in the common case when there is only one interval in the list, we store the first interval here. More... | |
| Discrete_interval * | head |
| Discrete_interval * | tail |
| Discrete_interval * | current |
| When many intervals are provided at the beginning of the execution of a statement (in a replication slave or SET INSERT_ID), "current" points to the interval being consumed by the thread now (so "current" goes from "head" to "tail" then to NULL). More... | |
| uint | elements |
| number of elements More... | |
List of Discrete_interval objects.
|
inlineprivate |
|
inline |
|
inline |
|
inlineprivate |
Appends an interval to the list.
| start | start of interval |
| val | how many values it contains |
| incr | what increment between each value |
| true | error |
| false | success |
|
inline |
|
inlineprivate |
|
inline |
|
inline |
|
inline |
|
inline |
|
private |
|
inline |
|
private |
When many intervals are provided at the beginning of the execution of a statement (in a replication slave or SET INSERT_ID), "current" points to the interval being consumed by the thread now (so "current" goes from "head" to "tail" then to NULL).
|
private |
number of elements
|
private |
To avoid heap allocation in the common case when there is only one interval in the list, we store the first interval here.
|
private |
|
private |