Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
#include <bitset.h>
Public Types | |
using | difference_type = std::ptrdiff_t |
using | iterator_category = std::forward_iterator_tag |
using | value_type = IndexType |
using | size_type = std::size_t |
using | reference = value_type& |
using | pointer = value_type* |
Public Member Functions | |
Iterator () | |
Iterator (Iterator &&other)=default | |
Iterator (const Iterator &other)=default | |
Iterator & | operator= (const Iterator &other)=default |
Iterator (const Bitset64 &bitset) | |
bool | operator== (const Iterator &other) const |
bool | operator!= (const Iterator &other) const |
IndexType | operator* () const |
Iterator | operator++ (int) |
Iterator & | operator++ () |
Static Public Member Functions | |
static Iterator | EndIterator (const Bitset64 &bitset) |
Class to iterate over the bit positions at 1 of a Bitset64.
IMPORTANT: Because the iterator "caches" the current uint64_t bucket, this will probably not do what you want if Bitset64 is modified while iterating.
using operations_research::Bitset64< IndexType >::Iterator::difference_type = std::ptrdiff_t |
using operations_research::Bitset64< IndexType >::Iterator::iterator_category = std::forward_iterator_tag |
using operations_research::Bitset64< IndexType >::Iterator::pointer = value_type* |
using operations_research::Bitset64< IndexType >::Iterator::reference = value_type& |
using operations_research::Bitset64< IndexType >::Iterator::size_type = std::size_t |
using operations_research::Bitset64< IndexType >::Iterator::value_type = IndexType |
|
inline |
|
default |
|
default |
|
inlineexplicit |
|
inlinestatic |
|
inline |
|
inline |
|
inline |
|
inline |
|
default |
|
inline |