Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::ElementIterator< Set > Class Template Reference

Detailed Description

template<typename Set>
class operations_research::ElementIterator< Set >
Todo
(user): Move the Set-related classbelow to util/bitset.h Iterates over the elements of a set represented as an unsigned integer, starting from the smallest element. (See the class Set<Integer> below.)

Definition at line 109 of file hamiltonian_path.h.

#include <hamiltonian_path.h>

Public Member Functions

 ElementIterator (Set set)
bool operator!= (const ElementIterator &other) const
int operator* () const
 Returns the smallest element in the current_set_.
const ElementIteratoroperator++ ()
 Advances the iterator by removing its smallest element.

Constructor & Destructor Documentation

◆ ElementIterator()

template<typename Set>
operations_research::ElementIterator< Set >::ElementIterator ( Set set)
inlineexplicit

Definition at line 111 of file hamiltonian_path.h.

Member Function Documentation

◆ operator!=()

template<typename Set>
bool operations_research::ElementIterator< Set >::operator!= ( const ElementIterator< Set > & other) const
inline

Definition at line 112 of file hamiltonian_path.h.

◆ operator*()

template<typename Set>
int operations_research::ElementIterator< Set >::operator* ( ) const
inline

Returns the smallest element in the current_set_.

Definition at line 117 of file hamiltonian_path.h.

◆ operator++()

template<typename Set>
const ElementIterator & operations_research::ElementIterator< Set >::operator++ ( )
inline

Advances the iterator by removing its smallest element.

Definition at line 120 of file hamiltonian_path.h.


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