Turbo Constraint Solver
Loading...
Searching...
No Matches
UniqueAlloc< Alloc, n > Struct Template Reference

#include <common_solving.hpp>

Public Member Functions

 UniqueAlloc ()=default
 
CUDA UniqueAlloc (const Alloc &alloc)
 
 UniqueAlloc (const UniqueAlloc &alloc)=default
 
 UniqueAlloc (UniqueAlloc &&alloc)=default
 
UniqueAllocoperator= (const UniqueAlloc &alloc)=default
 
UniqueAllocoperator= (UniqueAlloc &&alloc)=default
 
CUDA void * allocate (size_t bytes)
 
CUDA void deallocate (void *data)
 

Public Attributes

Alloc allocator
 

Detailed Description

template<class Alloc, size_t n>
struct UniqueAlloc< Alloc, n >

This is a simple wrapper aimed at giving a unique type to the allocator, to use them in AbstractDeps.

Constructor & Destructor Documentation

◆ UniqueAlloc() [1/4]

template<class Alloc , size_t n>
UniqueAlloc< Alloc, n >::UniqueAlloc ( )
default

◆ UniqueAlloc() [2/4]

template<class Alloc , size_t n>
CUDA UniqueAlloc< Alloc, n >::UniqueAlloc ( const Alloc & alloc)
inline

◆ UniqueAlloc() [3/4]

template<class Alloc , size_t n>
UniqueAlloc< Alloc, n >::UniqueAlloc ( const UniqueAlloc< Alloc, n > & alloc)
default

◆ UniqueAlloc() [4/4]

template<class Alloc , size_t n>
UniqueAlloc< Alloc, n >::UniqueAlloc ( UniqueAlloc< Alloc, n > && alloc)
default

Member Function Documentation

◆ operator=() [1/2]

template<class Alloc , size_t n>
UniqueAlloc & UniqueAlloc< Alloc, n >::operator= ( const UniqueAlloc< Alloc, n > & alloc)
default

◆ operator=() [2/2]

template<class Alloc , size_t n>
UniqueAlloc & UniqueAlloc< Alloc, n >::operator= ( UniqueAlloc< Alloc, n > && alloc)
default

◆ allocate()

template<class Alloc , size_t n>
CUDA void * UniqueAlloc< Alloc, n >::allocate ( size_t bytes)
inline

◆ deallocate()

template<class Alloc , size_t n>
CUDA void UniqueAlloc< Alloc, n >::deallocate ( void * data)
inline

Member Data Documentation

◆ allocator

template<class Alloc , size_t n>
Alloc UniqueAlloc< Alloc, n >::allocator

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