Fiber::PolynomialArray< T > Class Template Reference [Multidimensional arrays whose values are direct products.]

light-weight An object with neglible overhead when copying. More...

#include <DirectProductArray.hpp>

List of all members.

Public Types

• typedef MemArray< 1, T > Base_t
• typedef Base_t::MultiArray_t MultiArray_t

  Export multiarray type.
  

Public Member Functions

• PolynomialArray (const MultiIndex< 1 > &M, index_t max_idx, const MemBase::Creator_t &C)

  Construct a polynomial array.
  

• T operator() (index_t i) const

  The element access function.
  

• index_t Length () const
• void resize (index_t newSize)
• bool locate (T &value) const

  Find the index location of the given (most likely floating point) value within this polynomial array.
  

Public Attributes

• MultiIndex< 1 > max_index

---

Detailed Description

template<class T>
class Fiber::PolynomialArray< T >

light-weight An object with neglible overhead when copying.

An implementation of the one-dimensional virtual array that computes its elements as an polynomial expression of the index.

Parameters:

Storage

The class holding the polynomial coefficients; it must provide an element access operator [] and a size() member function, similar to the STL vector class or VecAl::FixedArray<>.

---

Member Function Documentation

template<class T >

bool Fiber::PolynomialArray< T >::locate

(

T &

value

)

const [inline]

Find the index location of the given (most likely floating point) value within this polynomial array.

Returns:

false if this value is not contained.

Todo:

Expand to cover non-linear polynomials (currently implementation is trivially just for linear expressions).