#include <linear_constraint_manager.h>

Inheritance diagram for operations_research::sat::ModelLpValues:

Public Member Functions
	ModelLpValues ()=default

Public Member Functions inherited from util_intops::StrongVector< IntegerVariable, double >
	StrongVector ()

	StrongVector (const allocator_type &a)

	StrongVector (size_type n)

	StrongVector (IntegerVariable n)

	StrongVector (size_type n, const value_type &v, const allocator_type &a=allocator_type())

	StrongVector (IntegerVariable n, const value_type &v, const allocator_type &a=allocator_type())

	StrongVector (const StrongVector &x)

	StrongVector (StrongVector &&x)=default

	StrongVector (std::initializer_list< value_type > l, const allocator_type &a=allocator_type())

	StrongVector (InputIteratorType first, InputIteratorType last, const allocator_type &a=allocator_type())

	~StrongVector ()

const ParentType &	get () const

ParentType *	mutable_get ()

reference	operator[] (IntegerVariable i)
	– Modified methods ----------------------------------------------------—

const_reference	operator[] (IntegerVariable i) const

reference	at (IntegerVariable i)

const_reference	at (IntegerVariable i) const

IntegerVariable	start_index () const
	– Extension methods ---------------------------------------------------—

IntegerVariable	end_index () const

bool	IsValidSize () const
	Returns true if the vector is fully addressable by the index type.

StrongIntRange< IntegerVariable >	index_range () const

value_type *	data ()
	– Pass-through methods to STL vector ----------------------------------—

const value_type *	data () const

StrongVector &	operator= (const StrongVector &x)

StrongVector &	operator= (StrongVector &&x)=default

StrongVector &	operator= (std::initializer_list< value_type > l)

void	swap (StrongVector &x) noexcept

void	assign (size_type n, const value_type &val)

void	assign (InputIt f, InputIt l)

void	assign (std::initializer_list< value_type > l)

iterator	emplace (const_iterator pos, Args &&... args)

reference	emplace_back (Args &&... args)

iterator	insert (const_iterator pos, const value_type &x)

iterator	insert (const_iterator pos, value_type &&x)

void	insert (const_iterator pos, size_type n, const value_type &x)

void	insert (const_iterator pos, SIT first, SIT last)

void	push_back (const value_type &val)

void	push_back (value_type &&val)

void	reserve (size_type n)

void	reserve (IntegerVariable n)

void	resize (size_type new_size)

void	resize (IntegerVariable new_size)

void	resize (size_type new_size, const value_type &x)

void	resize (IntegerVariable new_size, const value_type &x)

Additional Inherited Members
Public Types inherited from util_intops::StrongVector< IntegerVariable, double >
typedef std::vector< double, std::allocator< double > >	ParentType

typedef ParentType::size_type	size_type

typedef ParentType::allocator_type	allocator_type

typedef ParentType::value_type	value_type

typedef ParentType::reference	reference

typedef ParentType::const_reference	const_reference

typedef ParentType::pointer	pointer

typedef ParentType::const_pointer	const_pointer

typedef ParentType::iterator	iterator

typedef ParentType::const_iterator	const_iterator

typedef ParentType::reverse_iterator	reverse_iterator

typedef ParentType::const_reverse_iterator	const_reverse_iterator

Detailed Description

Stores for each IntegerVariable its temporary LP solution.

This is shared between all LinearProgrammingConstraint because in the corner case where we have many different LinearProgrammingConstraint and a lot of variable, we could theoretically use up a quadratic amount of memory otherwise.

Definition at line 46 of file linear_constraint_manager.h.

Constructor & Destructor Documentation

◆ ModelLpValues()

operations_research::sat::ModelLpValues::ModelLpValues ( )

default

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

ortools/sat/linear_constraint_manager.h

Public Member Functions

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ ModelLpValues()