Lattice Land Core Library
|
#include <sort.hpp>
Public Types | |
enum | Tag { Bool , Int , Real , Set } |
using | allocator_type = Allocator |
using | this_type = Sort<allocator_type> |
Public Member Functions | |
CUDA | Sort (Tag tag) |
CUDA NI | Sort (Tag tag, Sort &&sub_ty, const allocator_type &alloc=allocator_type()) |
template<class Alloc2 > | |
CUDA NI | Sort (const Sort< Alloc2 > &other, const allocator_type &alloc=allocator_type()) |
CUDA | Sort (const this_type &other) |
Sort & | operator= (const this_type &other)=default |
Sort (Sort &&)=default | |
Sort & | operator= (Sort &&)=default |
CUDA bool | is_bool () const |
CUDA bool | is_int () const |
CUDA bool | is_real () const |
CUDA bool | is_set () const |
CUDA NI void | print () const |
template<class U > | |
CUDA NI void | print_value (const U &u) const |
Public Attributes | |
Tag | tag |
battery::unique_ptr< this_type, allocator_type > | sub |
The concrete type of variables, called sort
, introduced by existential quantification. More concrete types could be added later.
using lala::Sort< Allocator >::allocator_type = Allocator |
using lala::Sort< Allocator >::this_type = Sort<allocator_type> |
enum lala::Sort::Tag |
|
inline |
|
inline |
|
inline |
|
inline |
|
default |
|
default |
|
default |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
Tag lala::Sort< Allocator >::tag |
battery::unique_ptr<this_type, allocator_type> lala::Sort< Allocator >::sub |