Arageli::type_traits< sparse_polynom< F, I, REFCNT > >

Arageli::type_traits< sparse_polynom< F, I, REFCNT > > Struct Template Reference

#include <sparse_polynom.hpp>

Inheritance diagram for Arageli::type_traits< sparse_polynom< F, I, REFCNT > >:

Arageli::type_traits_default< T > List of all members.

Public Types

typedef F element_type
 Type of each element.
typedef type_category::sparse_polynom category_type

Static Public Attributes

static const bool is_specialized
static const bool is_integer_number = false
static const bool is_polynom = true
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 = type_traits<F>::is_ring
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.
static const category_type category_value

Detailed Description

template<typename F, typename I, bool REFCNT>
struct Arageli::type_traits< sparse_polynom< F, I, REFCNT > >

Definition at line 2340 of file sparse_polynom.hpp.

Member Typedef Documentation

template<typename F, typename I, bool REFCNT>
typedef type_category::sparse_polynom Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::category_type

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2395 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
typedef F Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::element_type

Type of each element.

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2393 of file sparse_polynom.hpp.

Member Data Documentation

template<typename F, typename I, bool REFCNT>
const type_category::sparse_polynom Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::category_value [static]

Initial value:

    type_category::sparse_polynom()

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2396 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::has_commutative_addition [static]

Initial value:

                        type_traits<F>::has_commutative_addition

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2374 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::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 2370 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::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 2377 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::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 2385 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::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 2381 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::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 2362 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::is_additive_group = type_traits<F>::is_ring [static]

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2359 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::is_aggregate = true [static]

True iff type is composite type consists another elements.

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2390 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::is_complex_number = false [static]

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2351 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::is_field = false [static]

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2353 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::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 2355 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::is_integer_modulo_ring = false [static]

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2366 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::is_integer_number = false [static]

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2347 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::is_matrix = false [static]

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2367 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::is_multiplicative_group = false [static]

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2360 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::is_polynom = true [static]

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2348 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::is_rational_number = false [static]

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2350 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::is_real_number = false [static]

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2349 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::is_ring = type_traits<F>::is_ring [static]

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2352 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::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 2343 of file sparse_polynom.hpp.

template<typename F, typename I, bool REFCNT>
const bool Arageli::type_traits< sparse_polynom< F, I, REFCNT > >::is_vector = false [static]

Reimplemented from Arageli::type_traits_default< T >.

Definition at line 2368 of file sparse_polynom.hpp.

The documentation for this struct was generated from the following file:
Generated on Thu Aug 31 17:38:28 2006 for Arageli by  doxygen 1.4.7