#include <common_solving.hpp>

Classes
struct	tag_copy_cons

struct	tag_gpu_block_copy

Public Types
using	universe_type = typename Universe::local_type

using	LIStore = VStore< universe_type, BasicAllocator >

using	IStore = VStore< Universe, StoreAllocator >

using	IProp = PIR< IStore, PropAllocator >

using	ISimplifier = Simplifier< IProp, BasicAllocator >

using	Split = SplitStrategy< IProp, BasicAllocator >

using	IST = SearchTree< IProp, Split, BasicAllocator >

using	IBAB = BAB< IST, LIStore >

using	basic_allocator_type = BasicAllocator

using	prop_allocator_type = PropAllocator

using	store_allocator_type = StoreAllocator

using	this_type = AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >

using	F = TFormula< basic_allocator_type >

using	FormulaPtr = battery::shared_ptr< TFormula< basic_allocator_type >, basic_allocator_type >

Public Member Functions
template<class U2 , class BasicAlloc2 , class PropAllocator2 , class StoreAllocator2 >
CUDA	AbstractDomains (const tag_gpu_block_copy &, bool enable_sharing, const AbstractDomains< U2, BasicAlloc2, PropAllocator2, StoreAllocator2 > &other, const BasicAllocator &basic_allocator=BasicAllocator(), const PropAllocator &prop_allocator=PropAllocator(), const StoreAllocator &store_allocator=StoreAllocator())

template<class U2 , class BasicAlloc2 , class PropAllocator2 , class StoreAllocator2 >
CUDA	AbstractDomains (const AbstractDomains< U2, BasicAlloc2, PropAllocator2, StoreAllocator2 > &other, const BasicAllocator &basic_allocator=BasicAllocator(), const PropAllocator &prop_allocator=PropAllocator(), const StoreAllocator &store_allocator=StoreAllocator(), const tag_copy_cons &tag=tag_copy_cons{})

CUDA	AbstractDomains (const this_type &other, const BasicAllocator &basic_allocator=BasicAllocator(), const PropAllocator &prop_allocator=PropAllocator(), const StoreAllocator &store_allocator=StoreAllocator())

template<class Alloc >
CUDA	AbstractDomains (const Configuration< Alloc > &config, const BasicAllocator &basic_allocator=BasicAllocator(), const PropAllocator &prop_allocator=PropAllocator(), const StoreAllocator &store_allocator=StoreAllocator())

	AbstractDomains (AbstractDomains &&other)=default

CUDA void	allocate (int num_vars, bool with_simplifier)

CUDA void	deallocate ()

template<class F >
CUDA bool	interpret (const F &f)

FormulaPtr	parse_cn ()

template<class F >
void	initialize_simplifier (const F &f)

void	preprocess_ipc (F &f)

void	add_minimize_objective_var (F &f, const F::Existential &max_var)

void	preprocess_tcn (F &f)

const char *	name_of_abstract_domain () const

const char *	name_of_entailed_removal () const

void	preprocess ()

CUDA bool	on_node ()

CUDA bool	is_printing_intermediate_sol ()

CUDA void	print_solution ()

template<class BestStore >
CUDA void	print_solution (const BestStore &best_store)

CUDA void	prune ()

CUDA bool	update_solution_stats ()

CUDA bool	on_solution_node ()

CUDA void	on_failed_node ()

CUDA void	print_final_solution ()

CUDA void	print_mzn_statistics ()

template<class U2 , class BasicAlloc2 , class PropAlloc2 , class StoreAlloc2 >
CUDA void	meet (AbstractDomains< U2, BasicAlloc2, PropAlloc2, StoreAlloc2 > &other)

Public Attributes
BasicAllocator	basic_allocator

PropAllocator	prop_allocator

StoreAllocator	store_allocator

abstract_ptr< IStore >	store

abstract_ptr< IProp >	iprop

abstract_ptr< ISimplifier >	simplifier

abstract_ptr< Split >	split

abstract_ptr< IST >	search_tree

abstract_ptr< LIStore >	best

abstract_ptr< IBAB >	bab

VarEnv< BasicAllocator >	env

SolverOutput< BasicAllocator >	solver_output

AVar	minimize_obj_var

Configuration< BasicAllocator >	config

Statistics< BasicAllocator >	stats

Detailed Description

template<class Universe, class BasicAllocator, class PropAllocator, class StoreAllocator>
struct AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >

This class is parametrized by a universe of discourse, which is the domain of the variables in the store and various allocators:

BasicAllocator: default allocator, used to allocate abstract domains, the environment, storing intermediate results, etc.
PropAllocator: allocator used for the PC abstract domain, to allocate the propagators.
StoreAllocator: allocator used for the store, to allocate the variables.

Normally, you should use the fastest memory for the store, then for the propagators and then for the rest.

Member Typedef Documentation

◆ universe_type

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::universe_type = typename Universe::local_type

◆ LIStore

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::LIStore = VStore<universe_type, BasicAllocator>

Version of the abstract domains with a simple allocator, to represent the best solutions.

◆ IStore

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::IStore = VStore<Universe, StoreAllocator>

◆ IProp

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::IProp = PIR<IStore, PropAllocator>

◆ ISimplifier

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::ISimplifier = Simplifier<IProp, BasicAllocator>

◆ Split

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::Split = SplitStrategy<IProp, BasicAllocator>

◆ IST

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::IST = SearchTree<IProp, Split, BasicAllocator>

◆ IBAB

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::IBAB = BAB<IST, LIStore>

◆ basic_allocator_type

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::basic_allocator_type = BasicAllocator

◆ prop_allocator_type

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::prop_allocator_type = PropAllocator

◆ store_allocator_type

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::store_allocator_type = StoreAllocator

◆ this_type

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::this_type = AbstractDomains<Universe, BasicAllocator, PropAllocator, StoreAllocator>

◆ F

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::F = TFormula<basic_allocator_type>

◆ FormulaPtr

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

using AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::FormulaPtr = battery::shared_ptr<TFormula<basic_allocator_type>, basic_allocator_type>

Constructor & Destructor Documentation

◆ AbstractDomains() [1/5]

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

template<class U2 , class BasicAlloc2 , class PropAllocator2 , class StoreAllocator2 >

CUDA AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::AbstractDomains	(	const tag_gpu_block_copy &	,
		bool	enable_sharing,
		const AbstractDomains< U2, BasicAlloc2, PropAllocator2, StoreAllocator2 > &	other,
		const BasicAllocator &	basic_allocator = `BasicAllocator()`,
		const PropAllocator &	prop_allocator = `PropAllocator()`,
		const StoreAllocator &	store_allocator = `StoreAllocator()`
	)

inline

We copy other in a new element, and ignore every variable not used in a GPU block. This is because copying everything in each block is very slow.

NOTE: It is not the allocation itself that is slow, I think it calling many copy constructors for atomic variables (note that in simplifier we have an atomic memory if the underlying domain has one).

◆ AbstractDomains() [2/5]

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

template<class U2 , class BasicAlloc2 , class PropAllocator2 , class StoreAllocator2 >

CUDA AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::AbstractDomains	(	const AbstractDomains< U2, BasicAlloc2, PropAllocator2, StoreAllocator2 > &	other,
		const BasicAllocator &	basic_allocator = `BasicAllocator()`,
		const PropAllocator &	prop_allocator = `PropAllocator()`,
		const StoreAllocator &	store_allocator = `StoreAllocator()`,
		const tag_copy_cons &	tag = `tag_copy_cons{}`
	)

inline

◆ AbstractDomains() [3/5]

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

CUDA AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::AbstractDomains	(	const this_type &	other,
		const BasicAllocator &	basic_allocator = `BasicAllocator()`,
		const PropAllocator &	prop_allocator = `PropAllocator()`,
		const StoreAllocator &	store_allocator = `StoreAllocator()`
	)

inline

◆ AbstractDomains() [4/5]

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

template<class Alloc >

CUDA AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::AbstractDomains	(	const Configuration< Alloc > &	config,
		const BasicAllocator &	basic_allocator = `BasicAllocator()`,
		const PropAllocator &	prop_allocator = `PropAllocator()`,
		const StoreAllocator &	store_allocator = `StoreAllocator()`
	)

inline

◆ AbstractDomains() [5/5]

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::AbstractDomains ( AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator > && other )

default

Member Function Documentation

◆ allocate()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

CUDA void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::allocate	(	int	num_vars,
		bool	with_simplifier
	)

inline

◆ deallocate()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

CUDA void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::deallocate ( )

inline

◆ interpret()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

template<class F >

CUDA bool AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::interpret ( const F & f )

inline

◆ parse_cn()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

FormulaPtr AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::parse_cn ( )

inline

Parse a constraint network in the FlatZinc or XCSP3 format. The parsed formula is then syntactically simplified (eval function).

◆ initialize_simplifier()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

template<class F >

void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::initialize_simplifier ( const F & f )

inline

◆ preprocess_ipc()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::preprocess_ipc ( F & f )

inline

◆ add_minimize_objective_var()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::add_minimize_objective_var	(	F &	f,
		const F::Existential &	max_var
	)

inline

◆ preprocess_tcn()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::preprocess_tcn ( F & f )

inline

◆ name_of_abstract_domain()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

const char * AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::name_of_abstract_domain ( ) const

inline

◆ name_of_entailed_removal()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

const char * AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::name_of_entailed_removal ( ) const

inline

◆ preprocess()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::preprocess ( )

inline

◆ on_node()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

CUDA bool AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::on_node ( )

inline

◆ is_printing_intermediate_sol()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

CUDA bool AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::is_printing_intermediate_sol ( )

inline

◆ print_solution() [1/2]

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

CUDA void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::print_solution ( )

inline

◆ print_solution() [2/2]

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

template<class BestStore >

CUDA void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::print_solution ( const BestStore & best_store )

inline

◆ prune()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

CUDA void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::prune ( )

inline

◆ update_solution_stats()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

CUDA bool AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::update_solution_stats ( )

inline

Return true if the search state must be pruned.

◆ on_solution_node()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

CUDA bool AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::on_solution_node ( )

inline

◆ on_failed_node()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

CUDA void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::on_failed_node ( )

inline

◆ print_final_solution()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

CUDA void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::print_final_solution ( )

inline

◆ print_mzn_statistics()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

CUDA void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::print_mzn_statistics ( )

inline

◆ meet()

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

template<class U2 , class BasicAlloc2 , class PropAlloc2 , class StoreAlloc2 >

CUDA void AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::meet ( AbstractDomains< U2, BasicAlloc2, PropAlloc2, StoreAlloc2 > & other )

inline

Extract in this the content of other.

Member Data Documentation

◆ basic_allocator

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

BasicAllocator AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::basic_allocator

◆ prop_allocator

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

PropAllocator AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::prop_allocator

◆ store_allocator

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

StoreAllocator AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::store_allocator

◆ store

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

abstract_ptr<IStore> AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::store

◆ iprop

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

abstract_ptr<IProp> AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::iprop

◆ simplifier

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

abstract_ptr<ISimplifier> AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::simplifier

◆ split

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

abstract_ptr<Split> AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::split

◆ search_tree

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

abstract_ptr<IST> AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::search_tree

◆ best

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

abstract_ptr<LIStore> AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::best

◆ bab

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

abstract_ptr<IBAB> AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::bab

◆ env

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

VarEnv<BasicAllocator> AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::env

◆ solver_output

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

SolverOutput<BasicAllocator> AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::solver_output

◆ minimize_obj_var

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

AVar AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::minimize_obj_var

◆ config

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

Configuration<BasicAllocator> AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::config

◆ stats

template<class Universe , class BasicAllocator , class PropAllocator , class StoreAllocator >

Statistics<BasicAllocator> AbstractDomains< Universe, BasicAllocator, PropAllocator, StoreAllocator >::stats

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

include/common_solving.hpp

Classes

Public Types

Public Member Functions

Public Attributes

Detailed Description

Member Typedef Documentation

◆ universe_type

◆ LIStore

◆ IStore

◆ IProp

◆ ISimplifier

◆ Split

◆ IST

◆ IBAB

◆ basic_allocator_type

◆ prop_allocator_type

◆ store_allocator_type

◆ this_type

◆ F

◆ FormulaPtr

Constructor & Destructor Documentation

◆ AbstractDomains() [1/5]

◆ AbstractDomains() [2/5]

◆ AbstractDomains() [3/5]

◆ AbstractDomains() [4/5]

◆ AbstractDomains() [5/5]

Member Function Documentation

◆ allocate()

◆ deallocate()

◆ interpret()

◆ parse_cn()

◆ initialize_simplifier()

◆ preprocess_ipc()

◆ add_minimize_objective_var()

◆ preprocess_tcn()

◆ name_of_abstract_domain()

◆ name_of_entailed_removal()

◆ preprocess()

◆ on_node()

◆ is_printing_intermediate_sol()

◆ print_solution() [1/2]

◆ print_solution() [2/2]

◆ prune()

◆ update_solution_stats()

◆ on_solution_node()

◆ on_failed_node()

◆ print_final_solution()

◆ print_mzn_statistics()

◆ meet()

Member Data Documentation

◆ basic_allocator

◆ prop_allocator

◆ store_allocator

◆ store

◆ iprop

◆ simplifier

◆ split

◆ search_tree

◆ best

◆ bab

◆ env

◆ solver_output

◆ minimize_obj_var

◆ config

◆ stats