IAInterface::ProblemSets Class Reference

Collections of indicator sets of variables and constraints that define a subproblem, or define the global problem, or define the remaining part of the global problem. More...

List of all members.

Public Member Functions
bool	empty () const
void	find_dependent_set (const VariableConstraintDependencies &var_con_dep, ProblemSets &subsets)
	Create a subset by chasing variables or constraints. Top of recursion - call this version. "this" is the global set.
void	find_variable_dependent_set (const int variable_j, const VariableConstraintDependencies &var_con_dep, ProblemSets &subsets)
	This is the recursive implementation; call "find_dependent_set" instead. Add the variable (index) to the sub-problem, mark it as removed from the larger problem, and recursively build the sub-problem by chasing its dependent constraints. "this" is the global set.
void	find_constraint_dependent_set (const int constraint_i, const VariableConstraintDependencies &var_con_dep, ProblemSets &subsets)
	This is the recursive implementation; call "find_dependent_set" instead. Add the constraint (index) to the sub-problem, mark it as removed from the larger problem, and recursively build the sub-problem by chasing its variables. "this" is the global set.
void	print () const
bool	empty () const
void	find_dependent_set (const VariableConstraintDependencies &var_con_dep, ProblemSets &subsets)
	Create a subset by chasing variables or constraints. Top of recursion - call this version. "this" is the global set.
void	find_variable_dependent_set (const int variable_j, const VariableConstraintDependencies &var_con_dep, ProblemSets &subsets)
	This is the recursive implementation; call "find_dependent_set" instead. Add the variable (index) to the sub-problem, mark it as removed from the larger problem, and recursively build the sub-problem by chasing its dependent constraints. "this" is the global set.
void	find_constraint_dependent_set (const int constraint_i, const VariableConstraintDependencies &var_con_dep, ProblemSets &subsets)
	This is the recursive implementation; call "find_dependent_set" instead. Add the constraint (index) to the sub-problem, mark it as removed from the larger problem, and recursively build the sub-problem by chasing its variables. "this" is the global set.
void	print () const
bool	empty () const
void	find_dependent_set (const VariableConstraintDependencies &var_con_dep, ProblemSets &subsets)
	Create a subset by chasing variables or constraints. Top of recursion - call this version. "this" is the global set.
void	find_variable_dependent_set (const int variable_j, const VariableConstraintDependencies &var_con_dep, ProblemSets &subsets)
	This is the recursive implementation; call "find_dependent_set" instead. Add the variable (index) to the sub-problem, mark it as removed from the larger problem, and recursively build the sub-problem by chasing its dependent constraints. "this" is the global set.
void	find_constraint_dependent_set (const int constraint_i, const VariableConstraintDependencies &var_con_dep, ProblemSets &subsets)
	This is the recursive implementation; call "find_dependent_set" instead. Add the constraint (index) to the sub-problem, mark it as removed from the larger problem, and recursively build the sub-problem by chasing its variables. "this" is the global set.
void	print () const
Public Attributes
IndexSet	constraintSet
IndexSet	variableSet
IndexSet	hardVariableSet
IndexVec	varMap

---

Detailed Description

Collections of indicator sets of variables and constraints that define a subproblem, or define the global problem, or define the remaining part of the global problem.

Definition at line 268 of file IntervalAssignment/meshkit/IAInterface.hpp.

---

Member Function Documentation

bool empty

(

)

const [inline]

Definition at line 273 of file IntervalAssignment/meshkit/IAInterface.hpp.

bool empty

(

)

const [inline]

Definition at line 273 of file meshkit/IAInterface.hpp.

bool empty

(

)

const [inline]

Definition at line 281 of file IntervalAssignment/stubs/IAInterface.hpp.

void find_constraint_dependent_set	(	const int	constraint_i,
		const VariableConstraintDependencies &	var_con_dep,
		ProblemSets &	subsets
	)

This is the recursive implementation; call "find_dependent_set" instead. Add the constraint (index) to the sub-problem, mark it as removed from the larger problem, and recursively build the sub-problem by chasing its variables. "this" is the global set.

Definition at line 259 of file IAInterface.cpp.

void find_constraint_dependent_set	(	const int	constraint_i,
		const VariableConstraintDependencies &	var_con_dep,
		ProblemSets &	subsets
	)

This is the recursive implementation; call "find_dependent_set" instead. Add the constraint (index) to the sub-problem, mark it as removed from the larger problem, and recursively build the sub-problem by chasing its variables. "this" is the global set.

void find_constraint_dependent_set	(	const int	constraint_i,
		const VariableConstraintDependencies &	var_con_dep,
		ProblemSets &	subsets
	)

This is the recursive implementation; call "find_dependent_set" instead. Add the constraint (index) to the sub-problem, mark it as removed from the larger problem, and recursively build the sub-problem by chasing its variables. "this" is the global set.

void find_dependent_set	(	const VariableConstraintDependencies &	var_con_dep,
		ProblemSets &	subsets
	)

Create a subset by chasing variables or constraints. Top of recursion - call this version. "this" is the global set.

Definition at line 284 of file IAInterface.cpp.

void find_dependent_set	(	const VariableConstraintDependencies &	var_con_dep,
		ProblemSets &	subsets
	)

Create a subset by chasing variables or constraints. Top of recursion - call this version. "this" is the global set.

void find_dependent_set	(	const VariableConstraintDependencies &	var_con_dep,
		ProblemSets &	subsets
	)

Create a subset by chasing variables or constraints. Top of recursion - call this version. "this" is the global set.

void find_variable_dependent_set	(	const int	variable_j,
		const VariableConstraintDependencies &	var_con_dep,
		ProblemSets &	subsets
	)

This is the recursive implementation; call "find_dependent_set" instead. Add the variable (index) to the sub-problem, mark it as removed from the larger problem, and recursively build the sub-problem by chasing its dependent constraints. "this" is the global set.

void find_variable_dependent_set	(	const int	variable_j,
		const VariableConstraintDependencies &	var_con_dep,
		ProblemSets &	subsets
	)

This is the recursive implementation; call "find_dependent_set" instead. Add the variable (index) to the sub-problem, mark it as removed from the larger problem, and recursively build the sub-problem by chasing its dependent constraints. "this" is the global set.

Definition at line 234 of file IAInterface.cpp.

void find_variable_dependent_set	(	const int	variable_j,
		const VariableConstraintDependencies &	var_con_dep,
		ProblemSets &	subsets
	)

This is the recursive implementation; call "find_dependent_set" instead. Add the variable (index) to the sub-problem, mark it as removed from the larger problem, and recursively build the sub-problem by chasing its dependent constraints. "this" is the global set.

void print

(

)

const

Definition at line 327 of file IAInterface.cpp.

void print

(

)

const

void print

(

)

const

---

Member Data Documentation

IndexSet constraintSet

Definition at line 271 of file IntervalAssignment/meshkit/IAInterface.hpp.

IndexSet hardVariableSet

Definition at line 271 of file IntervalAssignment/meshkit/IAInterface.hpp.

IndexSet variableSet

Definition at line 271 of file IntervalAssignment/meshkit/IAInterface.hpp.

IndexVec varMap

Definition at line 272 of file IntervalAssignment/meshkit/IAInterface.hpp.

---

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

• IntervalAssignment/meshkit/IAInterface.hpp
• IntervalAssignment/stubs/IAInterface.hpp
• meshkit/IAInterface.hpp
• IAInterface.cpp
• IAInterfaceStub.cpp