#include <sparse_polynom.hpp>
Inheritance diagram for Arageli::type_traits< monom< F, I > >:
Public Types | |
typedef F | element_type |
Type of each element. | |
Static Public Attributes | |
static const bool | is_specialized |
static const bool | is_integer_number = false |
static const bool | is_polynom = false |
static const bool | is_real_number = false |
static const bool | is_rational_number = false |
static const bool | is_complex_number = false |
static const bool | is_ring = false |
static const bool | is_field = false |
static const bool | is_finite |
static const bool | is_additive_group = type_traits<F>::is_ring |
static const bool | is_multiplicative_group = false |
static const bool | has_zero_divisor |
static const bool | is_integer_modulo_ring = false |
static const bool | is_matrix = false |
static const bool | is_vector = false |
static const bool | has_commutative_multiplication |
static const bool | has_commutative_addition |
static const bool | has_null |
static const bool | has_unit |
static const bool | has_opposite_unit |
static const bool | is_aggregate = true |
True iff type is composite type consists another elements. |
Definition at line 339 of file sparse_polynom.hpp.
typedef F Arageli::type_traits< monom< F, I > >::element_type |
Type of each element.
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 392 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::has_commutative_addition [static] |
Initial value:
type_traits<F>::has_commutative_addition
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 373 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::has_commutative_multiplication [static] |
Initial value:
type_traits<F>::has_commutative_multiplication && type_traits<I>::has_commutative_addition
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 369 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::has_null [static] |
Initial value:
type_traits<F>::has_null && type_traits<I>::has_null
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 376 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::has_opposite_unit [static] |
Initial value:
type_traits<F>::has_opposite_unit && type_traits<I>::has_null
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 384 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::has_unit [static] |
Initial value:
type_traits<F>::has_unit && type_traits<I>::has_null
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 380 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::has_zero_divisor [static] |
Initial value:
type_traits<F>::has_zero_divisor && type_traits<I>::has_null
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 361 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_additive_group = type_traits<F>::is_ring [static] |
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 358 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_aggregate = true [static] |
True iff type is composite type consists another elements.
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 389 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_complex_number = false [static] |
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 350 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_field = false [static] |
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 352 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_finite [static] |
Initial value:
type_traits<F>::is_finite && type_traits<I>::is_finite
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 354 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_integer_modulo_ring = false [static] |
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 365 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_integer_number = false [static] |
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 346 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_matrix = false [static] |
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 366 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_multiplicative_group = false [static] |
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 359 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_polynom = false [static] |
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 347 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_rational_number = false [static] |
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 349 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_real_number = false [static] |
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 348 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_ring = false [static] |
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 351 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_specialized [static] |
Initial value:
type_traits<F>::is_specialized && type_traits<I>::is_specialized
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 342 of file sparse_polynom.hpp.
const bool Arageli::type_traits< monom< F, I > >::is_vector = false [static] |
Reimplemented from Arageli::type_traits_default< T >.
Definition at line 367 of file sparse_polynom.hpp.