|  | MySQL 9.5.0
    Source Code Documentation | 
The type for a possible transition from one state to another while holding at least a given set of latches. More...
#include <ut0stateful_latching_rules.h>
| Public Member Functions | |
| edge_t (node_t from, std::initializer_list< int > &&idxs, node_t to) | |
| Creates a description of one of allowed state transitions from given state to another while holding given latches.  More... | |
| Public Attributes | |
| node_t | m_from | 
| The old state from which the transition starts.  More... | |
| latches_set_t | m_latches | 
| The required subset of latches for this particular transition.  More... | |
| node_t | m_to | 
| The new state from to which the transition leads.  More... | |
The type for a possible transition from one state to another while holding at least a given set of latches.
| 
 | inline | 
Creates a description of one of allowed state transitions from given state to another while holding given latches.
For example {BUF_IO_READ, {0, 2}, BUF_IO_NONE} says a if a thread holds latches 0 and 2 then it can transition from BUF_IO_READ to BUF_IO_NONE.
| [in] | from | The old state from which the transition starts | 
| [in] | idxs | The list of integers in range <0,LATCHES_COUNT) used to construct set of latches for this edge. | 
| [in] | to | The new state from to which the transition leads. | 
| node_t ut::Stateful_latching_rules< Node, LATCHES_COUNT >::edge_t::m_from | 
The old state from which the transition starts.
| latches_set_t ut::Stateful_latching_rules< Node, LATCHES_COUNT >::edge_t::m_latches | 
The required subset of latches for this particular transition.
Note that there might be several edges for the same from->to pair, which means that a thread can pick any of them for which it has the required latches.
| node_t ut::Stateful_latching_rules< Node, LATCHES_COUNT >::edge_t::m_to | 
The new state from to which the transition leads.