Commit 50917012 authored by thomas.forbriger's avatar thomas.forbriger Committed by thomas.forbriger
Browse files

proceeding

This is a legacy commit from before 2015-03-01.
It may be incomplete as well as inconsistent.
See COPYING.legacy and README.history for details.


SVN Path:     http://gpitrsvn.gpi.uni-karlsruhe.de/repos/TFSoftware/trunk
SVN Revision: 1190
SVN UUID:     67feda4a-a26e-11df-9d6e-31afc202ad0c
parent 56296e94
......@@ -3,7 +3,7 @@
*
* ----------------------------------------------------------------------------
*
* $Id: strided.h,v 1.5 2002-12-12 22:08:20 forbrig Exp $
* $Id: strided.h,v 1.6 2002-12-13 14:56:03 forbrig Exp $
* \author Thomas Forbriger
* \since 08/12/2002
*
......@@ -30,6 +30,8 @@
* - 12/12/2002 V1.2 (thof)
* - basic functionality is complete
* - documentation is still missing
* - 13/12/2002 V1.3 (thof)
* - correct definition of mapping formula
*
* ============================================================================
*/
......@@ -38,9 +40,9 @@
#ifndef AFF_STRIDED_H_VERSION
#define AFF_STRIDED_H_VERSION \
"AFF_STRIDED_H V1.2"
"AFF_STRIDED_H V1.3"
#define AFF_STRIDED_H_CVSID \
"$Id: strided.h,v 1.5 2002-12-12 22:08:20 forbrig Exp $"
"$Id: strided.h,v 1.6 2002-12-13 14:56:03 forbrig Exp $"
#include<aff/lib/types.h>
#include<aff/lib/simplearray.h>
......@@ -51,13 +53,6 @@ namespace aff {
namespace prebuilt {
#endif
// do we need this?
// #ifdef AFF_PREBUILT
// using namespace aff::prebuilt::util;
// #else
// using namespace aff::util;
// #endif
/*! \brief Shape for a rectangular array layout.
*
* A rectangular array layout is the usual layout for multi-dimensional
......@@ -79,6 +74,25 @@ namespace prebuilt {
*
* \todo
* do we need using namespace util?
*
* \internal
* \par Mapping of index values into linear representation range
* The shape class defines how index values \a i0, \a i1, etc. are mapped
* into the linear adressing range used by the memory representation (see
* SharedHeap).
* The adress in the linear array is
* \f[
* a=o+\sum\limits_{k=0}^{M-1}\;(i_k-f_k)\,s_k
* =\sum\limits_{k=0}^{M-1}\;i_k\,s_k+
* \underbrace{o-\sum_{k=0}^{M-1}f_k\,s_k}_{=b_{M-1}},
* \f]
* if \a M is the number of index values \f$ i_k \f$ passed to the access
* operator. In formula \f$ f_k \f$ are the elements of \c Mfirst,
* \f$ s_k \f$ are the elements of \c Mstride,
* \f$ b_l \f$ are the elements of \c Mbase, and
* \f$ o \f$ is \c Moffset (i.e. the first accessible position within the
* representation.
*
*/
class Strided {
public:
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment