BlkArr< T > Class Template Reference

#include <BlkArr.h>

Inheritance diagram for BlkArr< T >:

Public Member Functions
	BlkArr (void)
	BlkArr (long fqel)
	BlkArr (long fqel, const T &val)
	BlkArr (long fqel, const T *ar, ArgInterp_Arr t)
BlkArr< T > &	operator= (const BlkArr< T > &f)
	BlkArr (const BlkArr< T > &f)
	BlkArr (PILF_CONST BlkArr< T > &f, Pilfer)
void	pilfer (PILF_CONST BlkArr< T > &f)
BlkArr &	assignAll (const T &f)
T &	operator[] (long n)
const T &	operator[] (long n) const
T &	last_el (void)
const T &	last_el (void) const
long	get_qel (void) const
void	put_qel (long fqel)
void	increment (void)
void	decrement (void)
void	append (const T &val)
void	print_struct (std::ostream &file) const
void	allocate_block (long fqel)
void	clear (void)
	macro_copy_total (BlkArr)
virtual	~BlkArr (void)

Detailed Description

template<class T>
class BlkArr< T >

Definition at line 80 of file BlkArr.h.

Constructor & Destructor Documentation

BlkArr() [1/6]

template<class T >

BlkArr< T >::BlkArr ( void  )

inline

Definition at line 86 of file BlkArr.h.

: qel(0), la(), size_of_element(sizeof(T)) { ; }

BlkArr() [2/6]

template<class T >

BlkArr< T >::BlkArr ( long  fqel )

inlineexplicit

Definition at line 87 of file BlkArr.h.

      : qel(fqel), la(DynLinArr<T>(0)), size_of_element(sizeof(T)) {
    if (qel > 0) la.get_first_node()->el.put_qel(qel);
  }

BlkArr() [3/6]

template<class T >

BlkArr< T >::BlkArr ( long  fqel, const T &  val  )

inline

Definition at line 91 of file BlkArr.h.

      : qel(fqel), la(DynLinArr<T>(0)), size_of_element(sizeof(T)) {
    if (qel > 0) la.get_first_node()->el.put_qel(qel, val);
  }

BlkArr() [4/6]

template<class T >

BlkArr< T >::BlkArr ( long  fqel, const T *  ar, ArgInterp_Arr  t  )

inline

Definition at line 95 of file BlkArr.h.

      : qel(fqel), la(DynLinArr<T>(0)), size_of_element(sizeof(T)) {
    if (qel > 0)
      // la.get_first_node()->el.put_qel(qel, ar, interp_as_arr); error
      la.get_first_node()->el.pilfer(DynLinArr<T>(qel, ar, t));
  }

BlkArr() [5/6]

template<class T >

BlkArr< T >::BlkArr ( const BlkArr< T > &  f )

inline

Definition at line 125 of file BlkArr.h.

      :
#ifndef DONT_USE_ABSPTR
        RegPassivePtr(),
#endif
        qel(0),
        la() {
#ifdef DEBUG_BLKARR
    mcout << "BlkArr(const BlkArr<T>& f) is working\n";
#endif
    *this = f;
  }

BlkArr() [6/6]

template<class T >

BlkArr< T >::BlkArr ( PILF_CONST BlkArr< T > &  f, Pilfer    )

inline

Definition at line 137 of file BlkArr.h.

      : qel(f.qel), size_of_element(f.size_of_element), la(f.la, steal) {
#ifdef DEBUG_BLKARR
    mcout << "BlkArr( BlkArr<T>& f, Pilfer) is working\n";
#endif
    f.qel = 0;
    f.size_of_element = 0;
  }

~BlkArr()

template<class T >

virtual BlkArr< T >::~BlkArr ( void  )

inlinevirtual

Definition at line 245 of file BlkArr.h.

{}

Member Function Documentation

allocate_block()

template<class T >

void BlkArr< T >::allocate_block ( long  fqel )

inline

Definition at line 231 of file BlkArr.h.

      {
    la.clear();
    qel = 0;
    put_qel(fqel);
    qel = 0;
  }

Referenced by Heed::HeedParticle::HeedParticle(), Heed::HeedParticle_BGM::HeedParticle_BGM(), Heed::HeedParticle::physics(), and Heed::HeedParticle_BGM::physics().

append()

template<class T >

void BlkArr< T >::append ( const T &  val )

inline

Definition at line 205 of file BlkArr.h.

                            {
    increment();
    operator[](qel - 1) = val;
  }

Referenced by Heed::HeedParticle::physics(), and Heed::HeedParticle_BGM::physics().

assignAll()

template<class T >

BlkArr & BlkArr< T >::assignAll ( const T &  f )

inline

Definition at line 170 of file BlkArr.h.

                                {
    long n;
    for (n = 0; n < qel; n++)
      operator[](n) = f;
    return *this;
  }

clear()

template<class T >

void BlkArr< T >::clear ( void  )

inline

Definition at line 238 of file BlkArr.h.

                   {
    la.clear();
    qel = 0;
  }

decrement()

template<class T >

void BlkArr< T >::decrement ( void  )

inline

Definition at line 201 of file BlkArr.h.

                       {
    long q = qel - 1;
    put_qel(q);
  }

get_qel()

template<class T >

long BlkArr< T >::get_qel ( void  ) const

inline

Definition at line 181 of file BlkArr.h.

{ return qel; }

Referenced by apeq_mant(), convert(), operator<<(), and operator==().

increment()

template<class T >

void BlkArr< T >::increment ( void  )

inline

Definition at line 197 of file BlkArr.h.

                       {
    long q = qel + 1;
    put_qel(q);
  }

Referenced by BlkArr< T >::append().

last_el() [1/2]

template<class T >

T & BlkArr< T >::last_el

(

void

)

Definition at line 304 of file BlkArr.h.

                                             {
  if (qel <= 0) {
    mcerr << "T& BlkArr::last_el(): no elements in array\n"
          << " qel=" << qel << '\n';
    spexit(mcerr);
  }
  long q;
  AbsListNode<DynLinArr<T> >* aln(la.get_first_node());
  long n = qel - 1;
  do {
    if ((q = aln->el.get_qel()) > n)
      return aln->el.acu(n);
    else
      n -= q;
    aln = aln->get_next_node();
  } while (aln != NULL);
  mcerr << "T& BlkArr::::last_el(): should never happen, n=" << n
        << " qel=" << qel << '\n';
  spexit(mcerr);
#ifdef INS_CRETURN    // Insert calming return
  return aln->el[0];  // to quiet Microsoft Visial Studio compiler against
                      // "not all control paths return a value"
#endif
}

last_el() [2/2]

template<class T >

const T & BlkArr< T >::last_el

(

void

)

const

Definition at line 329 of file BlkArr.h.

                                                         {
  if (qel <= 0) {
    mcerr << "const T& BlkArr::last_el(): no elements in array\n"
          << " qel=" << qel << '\n';
    spexit(mcerr);
  }
  long q;
  AbsListNode<DynLinArr<T> >* aln(la.get_first_node());
  long n = qel - 1;
  do {
    if ((q = aln->el.get_qel()) > n)
      return aln->el.acu(n);
    else
      n -= q;
    aln = aln->get_next_node();
  } while (aln != NULL);
  mcerr << "T& BlkArr::::last_el(): should never happen, n=" << n
        << " qel=" << qel << '\n';
  spexit(mcerr);
#ifdef INS_CRETURN    // Insert calming return
  return aln->el[0];  // to quiet Microsoft Visial Studio compiler against
                      // "not all control paths return a value"
#endif
}

macro_copy_total()

template<class T >

BlkArr< T >::macro_copy_total

(

BlkArr< T >

)

operator=()

template<class T >

BlkArr< T > & BlkArr< T >::operator= ( const BlkArr< T > &  f )

inline

Definition at line 113 of file BlkArr.h.

                                           {
#ifdef DEBUG_BLKARR
    mcout << "BlkArr<T>& operator=(const BlkArr<T>& f) is called\n";
#endif
    if (this != &f) {
      qel = f.qel;
      size_of_element = f.size_of_element;
      la = f.la;
    }
    return *this;
  }

operator[]() [1/2]

template<class T >

T & BlkArr< T >::operator[]

(

long

n

)

Definition at line 256 of file BlkArr.h.

                                                  {
  if (n < 0 || n >= qel) {
    mcerr << "T& BlkArr::operator[](long n): n is out of bounds, n=" << n
          << " qel=" << qel << '\n';
    spexit(mcerr);
  }
  long q;
  AbsListNode<DynLinArr<T> >* aln(la.get_first_node());
  do {
    if ((q = aln->el.get_qel()) > n)
      return aln->el.acu(n);
    else
      n -= q;
    aln = aln->get_next_node();
  } while (aln != NULL);
  mcerr << "T& BlkArr::operator[](long n): should never happen, n=" << n
        << " qel=" << qel << '\n';
  spexit(mcerr);
#ifdef INS_CRETURN    // Insert calming return
  return aln->el[0];  // to quiet Microsoft Visial Studio compiler against
                      // "not all control paths return a value"
#endif
}

Referenced by BlkArr< T >::append().

operator[]() [2/2]

template<class T >

const T & BlkArr< T >::operator[]

(

long

n

)

const

Definition at line 280 of file BlkArr.h.

                                                              {
  if (n < 0 || n >= qel) {
    mcerr << "const T& BlkArr::operator[](long n): n is out of bounds, n=" << n
          << " qel=" << qel << '\n';
    spexit(mcerr);
  }
  long q;
  AbsListNode<DynLinArr<T> >* aln(la.get_first_node());
  do {
    if ((q = aln->el.get_qel()) > n)
      return aln->el.acu(n);
    else
      n -= q;
    aln = aln->get_next_node();
  } while (aln != NULL);
  mcerr << "T& BlkArr::operator[](long n): should never happen, n=" << n
        << " qel=" << qel << '\n';
  spexit(mcerr);
#ifdef INS_CRETURN    // Insert calming return
  return aln->el[0];  // to quiet Microsoft Visial Studio compiler against
                      // "not all control paths return a value"
#endif
}

pilfer()

template<class T >

void BlkArr< T >::pilfer ( PILF_CONST BlkArr< T > &  f )

inline

Definition at line 145 of file BlkArr.h.

                                       {
#ifdef DEBUG_BLKARR
    mcout << "BlkArr::pilfer is called\n";
#endif
    if (this != &f) {
      if (qel != 0) {
        if (f.qel != 0) {
          mcerr << "ERROR in BlkArr::pilfer(...):\n";
          mcerr << "Both the destination and source arrays are not empty\n";
          // For explanations why it is dengerous, see similar function
          // of ActivePtr.
          spexit(mcerr);
        } else {
          la.clear();
          size_of_element = 0;
          qel = 0;
        }
      }
      qel = f.qel;
      size_of_element = f.size_of_element;
      la.pilfer(f.la);
      f.qel = 0;
      f.size_of_element = 0;
    }
  }

print_struct()

template<class T >

void BlkArr< T >::print_struct

(

std::ostream &

file

)

const

Definition at line 493 of file BlkArr.h.

                                                                      {
  Ifile << "structure: qel=" << qel << " size_of_element=" << size_of_element
        << "\n";
  indn.n += 2;
  long total_q = 0;
  long n = 0;
  AbsListNode<DynLinArr<T> >* aln(la.get_first_node());
  if (aln != NULL) {
    do {
      Ifile << "n=" << n << " qel=" << aln->el.get_qel() << '\n';
      total_q += aln->el.get_qel();
      aln = aln->get_next_node();
    } while (aln != NULL);
  }
  Ifile << "total_q=" << total_q << '\n';
  Ifile << "end of structure.\n";
  indn.n -= 2;
}

Referenced by operator<<().

put_qel()

template<class T >

void BlkArr< T >::put_qel

(

long

fqel

)

Definition at line 354 of file BlkArr.h.

                                                    {
  //mcout<<"BlkArr<T>::put_qel: fqel="<<fqel<<'\n';
  if (fqel == qel) return;
  /*
  if(fqel == 0)
  {
    qel = 0;
    la.clear();
  }
  else
  {
  */
  //long n;
  AbsListNode<DynLinArr<T> >* aln(la.get_first_node());
  if (aln == NULL) {
    la.insert_after(NULL, DynLinArr<T>(0));
    la.get_first_node()->el.put_qel(fqel);
    qel = fqel;
    return;
  } else {
    if (fqel > qel)  // the case of increase
        {
      long fqel_res = fqel;  // space to reserve
                             // fqel_res should be more than fqel
      // But remember, both are the total number of elements, not the increase
      if (fqel_res < 2 * qel)  // then consider more space to reserve
          {
        long ex = 2 * qel * size_of_element;   // compute the memory expense
        if (ex < max_size_of_extra_increment)  // check whether it is not large
          fqel_res = 2 * qel;                  // OK
        else {                                 // No, too large
          long q = max_size_of_extra_increment / size_of_element;  //less number
          if (q <= 0) q = 1;                                       // 1 at least
          if (fqel_res - qel < q) fqel_res = qel + q;              // increase
        }
      }
      long q;
      long left_old_qel = qel;
      long left_new_qel = fqel;
      long left_new_qel_res = fqel_res;
      //Iprintn(mcout, left_new_qel);
      //Iprintn(mcout, left_new_qel_res);
      AbsListNode<DynLinArr<T> >* aln(la.get_first_node());
      do {
        q = aln->el.get_qel();
        //Iprintn(mcout, q);
        //Iprintn(mcout, left_old_qel);
        //Iprintn(mcout, left_new_qel);
        if (q >= left_old_qel)  // this node, there is space
            {
          if (q >= left_new_qel)  // that's enough, nothing to do
              {                   // and no reservation additional space
            qel = fqel;
            return;
          } else  // No, the new requested space is larger then the available
              {  // in the current node. But there may be next ones inited
                 // already
            left_new_qel -= q;
            left_new_qel_res -= q;
            AbsListNode<DynLinArr<T> >* aln1;  // pointer to block
            while (
                (aln1 = aln->get_next_node()) !=
                NULL) {  // scanning next blocks, which may be present already
              aln = aln1;
              q = aln->el.get_qel();
              if (q >= left_new_qel)  // Good, existing space is enogh
                  {
                qel = fqel;
                return;
              }
              left_new_qel -= q;
              left_new_qel_res -= q;
            }  // No, is not enough
               // then make new node with reservation
            la.insert_after(aln, DynLinArr<T>(0));
            la.get_last_node()->el.put_qel(left_new_qel_res);
            qel = fqel;
            //Iprintn(mcout, qel);
            return;
          }
        }
        left_old_qel -= q;
        left_new_qel -= q;
        aln = aln->get_next_node();
      } while (aln != NULL);
      mcout << "BlkArr<T>::put_qel: should never happen\n";
    } else  // the case of decrease
        {
      long q;
      long left_old_qel = qel;
      long left_new_qel = fqel;
      AbsListNode<DynLinArr<T> >* aln(la.get_first_node());
      do {
        q = aln->el.get_qel();
        if (q >= left_new_qel)  // this node, there is space
            {
          // initialize by dummy constructor so as to get rid of garbage,
          // that is of elements at the end of this block
          long n;
          for (n = left_new_qel; n < q; n++) {
            aln->el[n] = T();
          }
          left_old_qel -= q;
          //left_new_qel -= q;
          AbsListNode<DynLinArr<T> >* aln1 = aln->get_next_node();
          if (aln1 != NULL)  // so preserving next node as histeresis
              {
            if (left_new_qel != 0)  // possible if fqel=0
                {  // if fqel=0, all the next nodes will be deleted in total
                   // later
              aln = aln1;
              q = aln->el.get_qel();
              if (left_old_qel > 0)  // then getting rid of garbage
                  {
                long l = left_old_qel;
                if (q < l) l = q;
                for (n = 0; n < l; n++) {
                  aln->el[n] = T();
                }
              }
            }
            while ((aln1 = aln->get_next_node()) != NULL)  // deleting all next
                // nodes
                {
              la.erase(aln1);
            }
          }
          qel = fqel;
          return;
        }
        left_old_qel -= q;
        left_new_qel -= q;
        aln = aln->get_next_node();
      } while (aln != NULL);
      qel = fqel;
    }
  }
}

Referenced by BlkArr< T >::allocate_block(), BlkArr< T >::decrement(), BlkArr< T >::increment(), and Heed::SimpleTablePhotoAbsCS::SimpleTablePhotoAbsCS().

---

The documentation for this class was generated from the following file:

• BlkArr.h