Google OR-Tools v9.9
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::PathState::NodeRange Class Reference

#include <constraint_solveri.h>

Classes

class  Iterator
 

Public Member Functions

 NodeRange (const ChainBounds *begin_chain, const ChainBounds *end_chain, const int *first_node)
 
Iterator begin () const
 
Iterator end () const
 

Detailed Description

A NodeRange allows to iterate on all nodes of a path, by a two-level iteration on ChainBounds* and CommittedNode* of a PathState.

Definition at line 3632 of file constraint_solveri.h.

Constructor & Destructor Documentation

◆ NodeRange()

operations_research::PathState::NodeRange::NodeRange ( const ChainBounds * begin_chain,
const ChainBounds * end_chain,
const int * first_node )
inline

NodeRanges hold ChainBounds* and int* (first committed node), a NodeRange may be invalidated if on of the underlying vector is modified.

Definition at line 3669 of file constraint_solveri.h.

Member Function Documentation

◆ begin()

Iterator operations_research::PathState::NodeRange::begin ( ) const
inline

Definition at line 3674 of file constraint_solveri.h.

◆ end()

Iterator operations_research::PathState::NodeRange::end ( ) const
inline
Note
there is a sentinel value at the end of PathState::chains_, so dereferencing chain_range_.end()->begin_ is always valid.

Definition at line 3677 of file constraint_solveri.h.


The documentation for this class was generated from the following file: