Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
operations_research::RevGrowingArray< T, C > Class Template Reference

#include <constraint_solveri.h>

Public Member Functions

 RevGrowingArray (int64_t block_size)
 
 ~RevGrowingArray ()
 
At (int64_t index) const
 
void RevInsert (Solver *const solver, int64_t index, T value)
 

Detailed Description

template<class T, class C>
class operations_research::RevGrowingArray< T, C >

This class is a reversible growing array. In can grow in both directions, and even accept negative indices. The objects stored have a type T. As it relies on the solver for reversibility, these objects can be up-casted to 'C' when using Solver::SaveValue().

Definition at line 2813 of file constraint_solveri.h.

Constructor & Destructor Documentation

◆ RevGrowingArray()

template<class T , class C >
operations_research::RevGrowingArray< T, C >::RevGrowingArray ( int64_t block_size)
inlineexplicit

Definition at line 2815 of file constraint_solveri.h.

◆ ~RevGrowingArray()

template<class T , class C >
operations_research::RevGrowingArray< T, C >::~RevGrowingArray ( )
inline

Definition at line 2820 of file constraint_solveri.h.

Member Function Documentation

◆ At()

template<class T , class C >
T operations_research::RevGrowingArray< T, C >::At ( int64_t index) const
inline

Definition at line 2826 of file constraint_solveri.h.

◆ RevInsert()

template<class T , class C >
void operations_research::RevGrowingArray< T, C >::RevInsert ( Solver *const solver,
int64_t index,
T value )
inline

Definition at line 2836 of file constraint_solveri.h.


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