Google OR-Tools: operations_research::RevIntSet< T > Class Template Reference

template<class T>
class operations_research::RevIntSet< T >

This is a special class to represent a 'residual' set of T. T must be an integer type. You fill it at first, and then during search, you can efficiently remove an element, and query the removed elements.

Definition at line 3920 of file constraint_solveri.h.

#include <constraint_solveri.h>

Public Types

typedef const T * const_iterator
 Iterators on the indices.

Public Member Functions

 RevIntSet (int capacity)
 Capacity is the fixed size of the set (it cannot grow).
 RevIntSet (int capacity, int *shared_positions, int shared_positions_size)
 Capacity is the fixed size of the set (it cannot grow).
 ~RevIntSet ()
int Size () const
int Capacity () const
Element (int i) const
RemovedElement (int i) const
void Insert (Solver *const solver, const T &elt)
void Remove (Solver *const solver, const T &value_index)
void Restore (Solver *const solver, const T &value_index)
void Clear (Solver *const solver)
const_iterator begin () const
const_iterator end () const

Static Public Attributes

static constexpr int kNoInserted = -1

◆ const_iterator

◆ RevIntSet() [2/2]

◆ ~RevIntSet()

◆ begin()

◆ Capacity()

◆ Clear()

◆ Element()

◆ end()

◆ Insert()

◆ Remove()

◆ RemovedElement()

◆ Restore()

◆ Size()

◆ kNoInserted


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