DynLinArr< T > Class Template Reference

#include <AbsArr.h>

Inheritance diagram for DynLinArr< T >:

Public Member Functions
	DynLinArr (void)
	DynLinArr (long fqel)
	DynLinArr (long fqel, const T &val)
	DynLinArr (long fqel, const T *ar, ArgInterp_Arr)
DynLinArr< T > &	operator= (const DynLinArr< T > &f)
template<class D >
DynLinArr< T > &	operator= (const DynLinArr< D > &f)
void	pass (long fqel, T *fel)
	DynLinArr (const DynLinArr< T > &f)
	DynLinArr (PILF_CONST DynLinArr< T > &f, Pilfer)
	DynLinArr (const DynArr< T > &f)
	DynLinArr (const DynArr< T > &f, int n_of_dim, long roc_number)
DynLinArr &	assignAll (const T &f)
template<class X >
DynLinArr< T > &	assignAll1 (const X &f)
T &	operator[] (long n)
const T &	operator[] (long n) const
T &	acu (long n)
const T &	acu (long n) const
T &	last_el (void)
const T &	last_el (void) const
long	get_qel (void) const
void	put_qel (long fqel)
void	put_qel (long fqel, const T *val, ArgInterp_SingleAdr t)
void	put_qel (long fqel, const T &val)
void	increment (const T *val=NULL)
void	increment (const T &val)
void	clear (void)
void	pilfer (PILF_CONST DynLinArr< T > &f)
void	check (void) const
DynArr< T >	top (void)
void	sort (long q_to_sort=0)
void	sort (DynLinArr< long > &sort_ind, long q_to_sort=0) const
void	sort_select_increasing (DynLinArr< long > &sort_ind, long q_to_sort=0) const
void	sort_select_decreasing (DynLinArr< long > &sort_ind, long q_to_sort=0) const
	macro_copy_header (DynLinArr)
virtual	~DynLinArr ()

Friends
template<class P >
void	apply1 (DynLinArr< P > &ar, void(*fun)(P &f))
template<class P , class X >
void	apply2 (DynLinArr< P > &ar, void(*fun1)(P &f, void(*fun21)(X &f)), void(*fun2)(X &f))

Detailed Description

template<class T>
class DynLinArr< T >

Definition at line 151 of file AbsArr.h.

Constructor & Destructor Documentation

DynLinArr() [1/8]

template<class T >

DynLinArr< T >::DynLinArr ( void  )

inline

Definition at line 159 of file AbsArr.h.

: qel(0), el(NULL) { ; }

DynLinArr() [2/8]

template<class T >

DynLinArr< T >::DynLinArr ( long  fqel )

inlineexplicit

Definition at line 160 of file AbsArr.h.

                                : qel(fqel), el(NULL) {
    if (qel > max_qel_DynLinArr) {
      mcerr << "ERROR in DynLinArr(long fqel):\n";
      mcerr << "qel > max_qel_DynLinArr:\n";
      Iprint2n(mcout, qel, max_qel_DynLinArr);
      mcerr << "Type of T is (in internal notations) " << typeid(T).name()
            << '\n';
      spexit(mcerr);
    }
    if (qel < 0) {
      mcerr << "ERROR in DynLinArr(long fqel):\n";
      mcerr << "qel < 0:\n";
      Iprintn(mcout, qel);
      mcerr << "Type of T is (in internal notations) " << typeid(T).name()
            << '\n';
      spexit(mcerr);
    }
#ifdef USE_REPLACE_ALLOC
    if (fqel > 0) {
      el = (T*)malloc(sizeof(T) * fqel);
      long n;
      for (n = 0; n < fqel; n++)
        new (&(el[n])) T;
    }
#else
    el = (fqel > 0) ? (new T[fqel]) : (T*)NULL;
#endif
  }

DynLinArr() [3/8]

template<class T >

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

inline

Definition at line 189 of file AbsArr.h.

                                     : qel(fqel), el(NULL) {
    if (qel > max_qel_DynLinArr) {
      mcerr << "ERROR in DynLinArr(long fqel, const T& val):\n";
      mcerr << "qel > max_qel_DynLinArr:\n";
      Iprint2n(mcout, qel, max_qel_DynLinArr);
      mcerr << "Type of T is (in internal notations) " << typeid(T).name()
            << '\n';
      spexit(mcerr);
    }
    if (qel < 0) {
      mcerr << "ERROR in DynLinArr(long fqel, const T& val):\n";
      mcerr << "qel < 0:\n";
      Iprintn(mcout, qel);
      mcerr << "Type of T is (in internal notations) " << typeid(T).name()
            << '\n';
      spexit(mcerr);
    }
#ifdef USE_REPLACE_ALLOC
    if (fqel > 0) {
      el = (T*)malloc(sizeof(T) * fqel);
      long n;
      for (n = 0; n < fqel; n++)
        new (&(el[n])) T;
    }
#else
    el = (fqel > 0) ? (new T[fqel]) : (T*)NULL;
#endif
    assignAll(val);
  }

DynLinArr() [4/8]

template<class T >

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

inline

Definition at line 218 of file AbsArr.h.

                                                     : qel(fqel), el(NULL) {
    if (qel > max_qel_DynLinArr) {
      mcerr << "ERROR in DynLinArr(long fqel, const T* ar, ArgInterp_Arr):\n";
      mcerr << "qel > max_qel_DynLinArr:\n";
      Iprint2n(mcout, qel, max_qel_DynLinArr);
      mcerr << "Type of T is (in internal notations) " << typeid(T).name()
            << '\n';
      spexit(mcerr);
    }
    if (qel < 0) {
      mcerr << "ERROR in DynLinArr(long fqel, const T* ar, ArgInterp_Arr):\n";
      mcerr << "qel < 0:\n";
      Iprintn(mcout, qel);
      mcerr << "Type of T is (in internal notations) " << typeid(T).name()
            << '\n';
      spexit(mcerr);
    }
#ifdef USE_REPLACE_ALLOC
    if (fqel > 0) {
      el = (T*)malloc(sizeof(T) * fqel);
      long n;
      for (n = 0; n < fqel; n++)
        new (&(el[n])) T;
    }
#else
    el = (fqel > 0) ? (new T[fqel]) : (T*)NULL;
#endif
    long n;
    for (n = 0; n < qel; n++)
      el[n] = ar[n];
  }

DynLinArr() [5/8]

template<class T >

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

inline

Definition at line 761 of file AbsArr.h.

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

DynLinArr() [6/8]

template<class T >

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

inline

Definition at line 274 of file AbsArr.h.

                                                : qel(f.qel), el(f.el) {
#ifdef DEBUG_DYNLINARR
    mcout << "DynLinArr( DynLinArr<T>& f, Pilfer) is working\n";
#endif
    f.qel = 0;
    f.el = 0;
  }

DynLinArr() [7/8]

template<class T >

DynLinArr< T >::DynLinArr

(

const DynArr< T > &

f

)

Definition at line 2948 of file AbsArr.h.

                                                             {
  //mcout<<"template<class T> DynLinArr<T>::DynLinArr(const DynArr<T>& f):\n";
  f.check();
  long qdim = f.get_qdim();
  if (qdim != 1) {
    mcerr << "ERROR in DynLinArr<T>::DynLinArr(const DynArr<T>& f):\n"
          << "f.get_qdim() != 1, f.get_qdim()=" << f.get_qdim() << '\n';
    mcerr << "Type of T is (in internal notations) " << typeid(T).name()
          << '\n';
    spexit(mcerr);
  }
  const DynLinArr<long>& qelem = f.get_qel();
  qel = qelem[0];
  //mcout<<"qel="<<qel<<'\n';
  if (qel > 0) {
#ifdef USE_REPLACE_ALLOC
    el = (T*)malloc(sizeof(T) * qel);
    long n;
    for (n = 0; n < qel; n++)
      new (&(el[n])) T;
#else
    el = new T[qel];
#endif
    long n;
    for (n = 0; n < qel; n++)
      el[n] = f.ac(n);
  } else
    el = NULL;
}

DynLinArr() [8/8]

template<class T >

DynLinArr< T >::DynLinArr	(	const DynArr< T > &	f,
		int	n_of_dim,
		long	roc_number
	)

Definition at line 2979 of file AbsArr.h.

    {
  f.check();
  long qdim = f.get_qdim();
  if (qdim != 2) {
    mcerr << "ERROR in DynLinArr<T>::DynLinArr(const DynArr<T>& f, int "
             "n_of_dim,long roc_number):\n"
          << "f.get_qdim() != 2, f.get_qdim()=" << f.get_qdim() << '\n';
    mcerr << "Type of T is (in internal notations) " << typeid(T).name()
          << '\n';
    spexit(mcerr);
  }
  const DynLinArr<long>& qelem = f.get_qel();
  if (n_of_dim == 0) {
    qel = qelem[1];
  } else {
    qel = qelem[0];
  }
  //mcout<<"qel="<<qel<<'\n';
  if (qel > 0) {
#ifdef USE_REPLACE_ALLOC
    el = (T*)malloc(sizeof(T) * qel);
    long n;
    for (n = 0; n < qel; n++)
      new (&(el[n])) T;
#else
    el = new T[qel];
#endif
    long n;
    if (n_of_dim == 0) {
      for (n = 0; n < qel; n++)
        el[n] = f.ac(roc_number, n);
    } else {
      for (n = 0; n < qel; n++)
        el[n] = f.ac(n, roc_number);
    }
  }
}

~DynLinArr()

template<class T >

virtual DynLinArr< T >::~DynLinArr ( )

inlinevirtual

Definition at line 562 of file AbsArr.h.

                       {
    check();
    if (el != NULL)
#ifdef USE_REPLACE_ALLOC
        {
      long n;
      for (n = 0; n < qel; n++) {
        (&(el[n]))->~T();
      }
      free(el);
    }
#else
    delete[] el;
#endif
  }

Member Function Documentation

acu() [1/2]

template<class T >

T & DynLinArr< T >::acu ( long  n )

inline

Definition at line 372 of file AbsArr.h.

      {
    return el[n];
  }

Referenced by DynArr< T >::ac(), DynArr< T >::acp(), DynArr< T >::acu(), apeq_mant(), change_sign(), find_next_comb(), norm_DynLinArr(), norm_DynLinArr_part(), normsq_DynLinArr(), normsq_DynLinArr_part(), DynArr< T >::IndexingProvider< D >::operator D&(), operator*(), operator*=(), operator+(), operator+=(), operator-(), operator-=(), operator/(), operator/=(), operator==(), DynArr< T >::IndexingProvider< D >::operator[](), DynArr< T >::operator[](), and DynLinArr< T >::sort().

acu() [2/2]

template<class T >

const T & DynLinArr< T >::acu ( long  n ) const

inline

Definition at line 376 of file AbsArr.h.

      {
    return el[n];
  }

assignAll()

template<class T >

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

inline

Definition at line 289 of file AbsArr.h.

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

Referenced by DynLinArr< T >::assignAll1(), and DynLinArr< T >::DynLinArr().

assignAll1()

template<class T >

template<class X >

DynLinArr< T > & DynLinArr< T >::assignAll1 ( const X &  f )

inline

Definition at line 297 of file AbsArr.h.

      {
    check();
    long n;
    for (n = 0; n < qel; n++)
      el[n].assignAll(f);
    return *this;
  }

check()

template<class T >

void DynLinArr< T >::check

(

void

)

const

Definition at line 615 of file AbsArr.h.

                                                      {
  if (qel < 0) {
    mcerr << "ERROR in template<class T> void DynLinArr<T>::check(void):\n";
    mcerr << "qel < 0, qel=" << qel << '\n';
    mcerr << "Type of T is (in internal notations) " << typeid(T).name()
          << '\n';
    spexit(mcerr);
  }
  if (qel == 0 && el != NULL) {
    mcerr << "ERROR in template<class T> void DynLinArr<T>::check(void):\n";
    //mcerr<<"qel == 0 && el != NULL: long(el)="<<long(el)<<'\n';
    mcerr << "qel == 0 && el != NULL: el=" << el << '\n';
    mcerr << "Type of T is (in internal notations) " << typeid(T).name()
          << '\n';
    spexit(mcerr);
  }
  if (qel > 0) {
    if (el == NULL) {
      mcerr << "ERROR in template<class T> void DynLinArr<T>::check(void):\n";
      mcerr << "qel > 0 && el == NULL: qel=" << qel << '\n';
      mcerr << "Type of T is (in internal notations) " << typeid(T).name()
            << '\n';
      spexit(mcerr);
    }
    if (qel > max_qel_DynLinArr) {
      mcerr << "ERROR in template<class T> void DynLinArr<T>::check(void):\n";
      mcerr << "qel > max_qel_DynLinArr: \n";
      Iprint2n(mcout, qel, max_qel_DynLinArr);
      mcerr << "Type of T is (in internal notations) " << typeid(T).name()
            << '\n';
      spexit(mcerr);
    }
  }
}

Referenced by DynLinArr< T >::assignAll(), DynLinArr< T >::assignAll1(), DynArr< T >::check(), DynLinArr< T >::increment(), operator<<(), DynLinArr< T >::operator=(), print_adr_DynLinArr(), print_DynArr_double(), print_DynArr_float(), print_DynArr_int_w(), print_DynLinArr(), print_DynLinArr_double(), print_DynLinArr_double2(), print_DynLinArr_float(), print_DynLinArr_int(), print_DynLinArr_int_double(), print_DynLinArr_int_double3(), print_DynLinArr_long(), and DynLinArr< T >::~DynLinArr().

clear()

template<class T >

void DynLinArr< T >::clear ( void  )

inline

Definition at line 450 of file AbsArr.h.

                   {
    put_qel(0);
  }  // Not only clears the content,

Referenced by DynArr< T >::clear(), Heed::EnTransfCS::EnTransfCS(), operator>>(), DynLinArr< T >::pass(), DynArr< T >::pilfer(), DynLinArr< T >::sort(), DynLinArr< T >::sort_select_decreasing(), and DynLinArr< T >::sort_select_increasing().

get_qel()

template<class T >

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

inline

Definition at line 420 of file AbsArr.h.

{ return qel; }

Referenced by absref_transmit_absvol::absref_transmit_absvol(), absref_transmit_fixsyscoor::absref_transmit_fixsyscoor(), absref_transmit_manip::absref_transmit_manip(), DynArr< T >::ac(), DynArr< T >::acp(), DynArr< T >::acu(), Heed::AtomicSecondaryProducts::add_channel(), apeq_mant(), append(), assignAll_1(), Heed::AtomMixDef::AtomMixDef(), change_sign(), chispre(), chisran(), IterDynArr< T >::current(), determinant_DynArr(), DynArr< T >::DynArr(), DynLinArr_char_we_to_String(), Heed::ExAtomPhotoAbsCS::ExAtomPhotoAbsCS(), Heed::ElElasticScat::fill_hist_low_scat(), absvol::find_embed_vol(), find_next_comb(), find_next_comb_not_less(), find_prev_comb(), gconfirm_ind(), gconfirm_ind_ext(), Heed::MolecPhotoAbsCS::get_ACS(), Heed::AtomicSecondaryProducts::get_channel(), Heed::SimpleTablePhotoAbsCS::get_CS(), Heed::AtomPhotoAbsCS::get_escape_particles(), Heed::MolecPhotoAbsCS::get_ICS(), Heed::MolecPhotoAbsCS::get_integral_ACS(), Heed::SimpleTablePhotoAbsCS::get_integral_CS(), Heed::MolecPhotoAbsCS::get_integral_ICS(), DynArr< T >::get_qdim(), DynArr< T >::get_s_non_emplty(), Heed::MolecPhotoAbsCS::get_total_Z(), ifequal(), inverse_DynArr(), inverse_DynArr_prot(), IterDynArr< T >::IterDynArr(), merge(), norm_DynLinArr(), norm_DynLinArr_part(), normsq_DynLinArr(), normsq_DynLinArr_part(), DynArr< T >::IndexingProvider< D >::operator D&(), operator*(), operator*=(), operator+(), operator+=(), operator-(), operator-=(), operator/(), operator/=(), operator<<(), DynArr< T >::IndexingProvider< D >::operator=(), DynLinArr< T >::operator=(), operator==(), operator>>(), DynArr< T >::IndexingProvider< D >::operator[](), DynArr< T >::operator[](), Heed::HeedPhoton::physics_after_new_speed(), DynArr< T >::pilfer(), PointsRan::PointsRan(), PointsRan::print(), Heed::SimpleTablePhotoAbsCS::print(), Heed::AtomicSecondaryProducts::print(), Heed::AtomPhotoAbsCS::print(), Heed::MolecPhotoAbsCS::print(), absvol::print(), print_adr_DynLinArr(), print_BlkArr(), print_DynLinArr(), print_DynLinArr_double(), print_DynLinArr_double2(), print_DynLinArr_float(), print_DynLinArr_int(), print_DynLinArr_int_double(), print_DynLinArr_int_double3(), print_DynLinArr_long(), put_qel_1(), absvol::range(), remove_end_comments(), Heed::SimpleTablePhotoAbsCS::remove_leading_tiny(), Heed::SimpleTablePhotoAbsCS::remove_leading_zeros(), Heed::SimpleTablePhotoAbsCS::scale(), and Heed::SimpleTablePhotoAbsCS::SimpleTablePhotoAbsCS().

increment() [1/2]

template<class T >

void DynLinArr< T >::increment ( const T &  val )

inline

Definition at line 445 of file AbsArr.h.

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

increment() [2/2]

template<class T >

void DynLinArr< T >::increment ( const T *  val = NULL )

inline

Definition at line 440 of file AbsArr.h.

                                      {
    check();
    long q = qel + 1;
    put_qel(q, *val);
  }

Referenced by Heed::ExAtomPhotoAbsCS::ExAtomPhotoAbsCS().

last_el() [1/2]

template<class T >

T & DynLinArr< T >::last_el ( void  )

inline

Definition at line 380 of file AbsArr.h.

                          {
#ifdef ALR_CHECK_BOUND
    if (qel > 0) {
      return el[qel - 1];
    } else {
      mcerr << "ERROR in const T& DynLinArr::last_el(void) const: qel <=0:"
            << " qel" << qel << '\n';
      mcerr << "Type of T is (in internal notations) " << typeid(T).name()
            << '\n';
      spexit(mcerr);
#ifdef INS_CRETURN   // Insert calming return
      return el[0];  // to quiet Microsoft Visial Studio compiler against
                     // "not all control paths return a value"
#endif
    }
#else
    return el[qel];
#endif
  }

last_el() [2/2]

template<class T >

const T & DynLinArr< T >::last_el ( void  ) const

inline

Definition at line 400 of file AbsArr.h.

                                      {
#ifdef ALR_CHECK_BOUND
    if (qel > 0) {
      return el[qel - 1];
    } else {
      mcerr << "ERROR in const T& DynLinArr::last_el(void) const: qel <=0:"
            << " qel" << qel << '\n';
      mcerr << "Type of T is (in internal notations) " << typeid(T).name()
            << '\n';
      spexit(mcerr);
#ifdef INS_CRETURN   // Insert calming return
      return el[0];  // to quiet Microsoft Visial Studio compiler against
                     // "not all control paths return a value"
#endif
    }
#else
    return el[qel];
#endif
  }

macro_copy_header()

template<class T >

DynLinArr< T >::macro_copy_header

(

DynLinArr< T >

)

operator=() [1/2]

template<class T >

template<class D >

DynLinArr< T > & DynLinArr< T >::operator=

(

const DynLinArr< D > &

f

)

Definition at line 710 of file AbsArr.h.

                                                           {
#ifdef DEBUG_DYNLINARR
  mcout << "DynLinArr<T>& DynLinArr<T>::operator=(const DynLinArr<D>& f) is "
           "working\n";
#endif
  //if(this != &f)
  //{
  //mcout<<"DynLinArr<T>& operator=(const DynLinArr<T>& f): long(el)="
  //<<long(el)<<'\n';
  check();
  f.check();
  // First of all we allocate memory and copy to there
  // all elements from f, because f can be part of this array,
  // for example, one of its elements.
  long q = f.get_qel();
#ifdef USE_REPLACE_ALLOC
  T* temp_el;
  if (q > 0) {
    temp_el = (T*)malloc(sizeof(T) * q);
    //long n; for(n=0; n<q; n++) T* t = new(&(temp_el[n])) T;
    // What is this (above)? Perhaps I did not debug this.
 
    long n;
    for (n = 0; n < q; n++)
      new (&(temp_el[n])) T(f.el[n]);  // here
    // we call copy constructor instead of creating default as for above
    // and then to copy to it.
  } else
    temp_el = NULL;
#else
  //T* temp_el = (q > 0) ? (new T[q]) : (T*)NULL;
  T* temp_el = (T*)NULL;
  if (q > 0) {
    //mcout<<"operator=:  sizeof(T)="<<std::setw(10)<<sizeof(T)<<" q="<<q<<'\n';
    temp_el = new T[q];
    //long n; for( n=0; n<q; n++) temp_el[n]=f.el[n];
    long n;
    for (n = 0; n < q; n++)
      temp_el[n] = f[n];
  }
 
#endif
  //long n; for( n=0; n<q; n++) temp_el[n] = f.acu(n);
  pass(q, temp_el);
  //el = (qel > 0) ? (new T[qel]) : (T*)NULL;
  //long n; for( n=0; n<qel; n++) el[n]=f.el[n];
  //}
  return *this;
}

operator=() [2/2]

template<class T >

DynLinArr< T > & DynLinArr< T >::operator=

(

const DynLinArr< T > &

f

)

Definition at line 651 of file AbsArr.h.

                                                           {
#ifdef DEBUG_DYNLINARR
  mcout << "DynLinArr<T>& DynLinArr<T>::operator=(const DynLinArr<T>& f) is "
           "working\n";
#endif
  if (this != &f) {
    //mcout<<"DynLinArr<T>& operator=(const DynLinArr<T>& f): long(el)="
    //<<long(el)<<'\n';
    check();
    f.check();
    // First of all we allocate memory and copy to there
    // all elements from f, because f can be part of this array,
    // for example, one of its elements.
    long q = f.get_qel();
#ifdef USE_REPLACE_ALLOC
    T* temp_el;
    if (q > 0) {
      temp_el = (T*)malloc(sizeof(T) * q);
      //long n; for(n=0; n<q; n++) new(&(temp_el[n])) T;
      long n;
      for (n = 0; n < q; n++)
        new (&(temp_el[n])) T(f.el[n]);  // here
      // we call copy constructor instead of creating default as for above
      // and then to copy to it.
    } else
      temp_el = NULL;
#else
    //mcout<<"operator=:  sizeof(T)="<<std::setw(10)<<sizeof(T)<<" q="<<q<<'\n';
    //T* temp_el = (q > 0) ? (new T[q]) : (T*)NULL;
    T* temp_el = (T*)NULL;
    if (q > 0) {
      //mcout<<"operator=:  sizeof(T)="<<std::setw(10)<<sizeof(T)<<"
      //q="<<q<<'\n';
      temp_el = new T[q];
      long n;
      for (n = 0; n < q; n++)
        temp_el[n] = f.el[n];
    }
#endif
    //long n; for( n=0; n<q; n++) temp_el[n]=f.el[n];
    /*
#ifdef USE_REPLACE_ALLOC
    for(n=0; n<q; n++) el[n].~T();
    free(el);
#else
    delete[] el;
#endif
    qel = q;
    el = temp_el;
    */
    pass(q, temp_el);
    //el = (qel > 0) ? (new T[qel]) : (T*)NULL;
    //long n; for( n=0; n<qel; n++) el[n]=f.el[n];
  }
  return *this;
}

operator[]() [1/2]

template<class T >

T & DynLinArr< T >::operator[] ( long  n )

inline

Definition at line 308 of file AbsArr.h.

                               {
#ifdef ALR_CHECK_BOUND
    if (n >= 0 && n < qel) {
      return el[n];
    } else {
      mcerr << "ERROR in const T& DynLinArr::operator[](long n) const: "
            << "n is out of bounds, n=" << n << " qel=" << qel << '\n';
      mcerr << "Type of T is (in internal notations) " << typeid(T).name()
            << '\n';
      spexit(mcerr);
#ifdef INS_CRETURN
      return el[0];  // to quiet Microsoft Visial Studio compiler against
                     // "not all control paths return a value"
#endif
    }
#else
    return el[n];
#endif
    /*
#ifdef ALR_CHECK_BOUND
      if(n<0 || n>=qel)
      {
    mcerr<<"ERROR in T& DynLinArr::operator[](long n): "
         <<"n is out of bounds, n="<<n
         <<" qel="<<qel<<'\n';
    mcerr<<"Type of T is (in internal notations) "<<typeid(T).name()<<'\n';
    spexit(mcerr);
      }
#endif
      return el[n];
      */
  }

operator[]() [2/2]

template<class T >

const T & DynLinArr< T >::operator[] ( long  n ) const

inline

Definition at line 340 of file AbsArr.h.

                                           {
#ifdef ALR_CHECK_BOUND
    if (n >= 0 && n < qel) {
      return el[n];
    } else {
      mcerr << "ERROR in const T& DynLinArr::operator[](long n) const: "
            << "n is out of bounds, n=" << n << " qel=" << qel << '\n';
      mcerr << "Type of T is (in internal notations) " << typeid(T).name()
            << '\n';
      spexit(mcerr);
#ifdef INS_CRETURN   // Insert calming return
      return el[0];  // to quiet Microsoft Visial Studio compiler against
                     // "not all control paths return a value"
#endif
    }
#else
    return el[n];
#endif
    /* // it is more simple to read but might be slower to execute
#ifdef ALR_CHECK_BOUND
    if(n<0 || n>=qel)
    {
      mcerr<<"ERROR in const T& DynLinArr::operator[](long n) const: "
       <<"n is out of bounds, n="<<n
       <<" qel="<<qel<<'\n';
      mcerr<<"Type of T is (in internal notations) "<<typeid(T).name()<<'\n';
      spexit(mcerr);
    }
#endif
    return el[n];
    */
  }

pass()

template<class T >

void DynLinArr< T >::pass ( long  fqel, T *  fel  )

inline

Definition at line 265 of file AbsArr.h.

                               {
    // Do not call directly! Is to be used only
    // from assignment operator above
    clear();
    qel = fqel;
    el = fel;
  }

Referenced by Heed::ExAtomPhotoAbsCS::ExAtomPhotoAbsCS(), Heed::ExAtomPhotoAbsCS::replace_shells_by_overage(), and Heed::SimpleAtomPhotoAbsCS::SimpleAtomPhotoAbsCS().

pilfer()

template<class T >

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

inline

Definition at line 454 of file AbsArr.h.

                                          {
#ifdef DEBUG_DYNLINARR
    mcout << "DynLinArr::pilfer is called\n";
#endif
    if (this != &f) {
      if (qel != 0) {
        if (f.qel != 0) {
          mcerr << "ERROR in DynLinArr::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 {
#ifdef USE_REPLACE_ALLOC
          {
            long n;
            for (n = 0; n < qel; n++)
              el[n].~T();
            free(el);
          }
#else
          delete[] el;
#endif
          qel = 0;
        }
      }
      el = f.el;
      qel = f.qel;
      f.el = NULL;
      f.qel = 0;
    }
  }

Referenced by DynArr< T >::pilfer(), DynLinArr< T >::sort(), DynLinArr< T >::sort_select_decreasing(), and DynLinArr< T >::sort_select_increasing().

put_qel() [1/3]

template<class T >

void DynLinArr< T >::put_qel

(

long

fqel

)

Definition at line 774 of file AbsArr.h.

                                                       {
  //
  // creates array with size fqel
  // If old array existed, then
  //   If it was less than fqel, it all is copied to new array
  //       and the other elements either assigned *val or
  //       remains not inited.
  //   else its fqel part is copyed to new array.
  //mcout<<"put_qel: *this="<<(*this);
  if (fqel < 0) {
    mcerr << "ERROR in template<class T> void DynLinArr<T>::put_qel(long "
             "fqel):\n";
    mcerr << "fqel < 0, fqel=" << fqel << '\n';
    mcerr << "Type of T is (in internal notations) " << typeid(T).name()
          << '\n';
    spexit(mcerr);
  }
  check();
  if (el == NULL) {
    qel = fqel;
    if (qel > 0) {
#ifdef USE_REPLACE_ALLOC
      el = (T*)malloc(sizeof(T) * fqel);
      for (long n = 0; n < fqel; ++n)
        new (&(el[n])) T;
#else
      el = new T[fqel];
#endif
    }
  } else {
    if (qel != fqel) {
      if (fqel <= 0) {
        qel = 0;
#ifdef USE_REPLACE_ALLOC
        for (long n = 0; n < qel; ++n)
          el[n].~T();
        free(el);
#else
        delete[] el;
#endif
        el = NULL;
      } else {
        T* elh;
#ifdef USE_REPLACE_ALLOC
        elh = (T*)malloc(sizeof(T) * fqel);
        for (n = 0; n < fqel; ++n)
          new (&(elh[n])) T;
#else
        elh = new T[fqel];  // long q = find_min(qel,fqel);
#endif
        for (long n = 0; n < fqel; ++n) {
          if (n < qel) elh[n] = el[n];
        }
#ifdef USE_REPLACE_ALLOC
        for (long n = 0; n < qel; ++n)
          el[n].~T();
        free(el);
#else
        delete[] el;
#endif
        el = elh;
        qel = fqel;
      }
    }
  }
}

Referenced by Heed::AtomicSecondaryProducts::add_channel(), append(), DynLinArr< T >::clear(), DynArr< T >::DynArr(), Heed::EnTransfCS::EnTransfCS(), Heed::ExAtomPhotoAbsCS::ExAtomPhotoAbsCS(), Heed::generate_Argon_PACS_mod_esc(), Heed::AtomPhotoAbsCS::get_escape_particles(), DynLinArr< T >::increment(), Heed::MolecPhotoAbsCS::MolecPhotoAbsCS(), operator>>(), DynLinArr< T >::put_qel(), remove_end_comments(), Heed::SimpleAtomPhotoAbsCS::SimpleAtomPhotoAbsCS(), Heed::SimpleTablePhotoAbsCS::SimpleTablePhotoAbsCS(), DynLinArr< T >::sort_select_decreasing(), and DynLinArr< T >::sort_select_increasing().

put_qel() [2/3]

template<class T >

void DynLinArr< T >::put_qel ( long  fqel, const T &  val  )

inline

Definition at line 437 of file AbsArr.h.

                                        {
    put_qel(fqel, &val, ArgInterp_SingleAdr());
  }

put_qel() [3/3]

template<class T >

void DynLinArr< T >::put_qel	(	long	fqel,
		const T *	val,
		ArgInterp_SingleAdr	t
	)

Definition at line 842 of file AbsArr.h.

                                                                         {
  // By default val == NULL
  // creates array with size fqel
  // If old array existed, then
  //   If it was less than fqel, it all is copied to new array
  //       and the other elements either assigned *val or
  //       remains not inited.
  //   else its fqel part is copyed to new array.
  //mcout<<"put_qel: *this="<<(*this);
  if (fqel < 0) {
    mcerr << "ERROR in template<class T> void DynLinArr<T>::put_qel(long fqel, "
             "const T* val, ArgInterp_SingleAdr):\n";
    mcerr << "fqel < 0, fqel=" << fqel << '\n';
    mcerr << "Type of T is (in internal notations) " << typeid(T).name()
          << '\n';
    spexit(mcerr);
    // Avoid compiler warning because of unused variable t (HS).
    mcerr << sizeof(t) << "\n";
  }
  check();
  if (el == NULL) {
    qel = fqel;
    if (qel > 0) {
#ifdef USE_REPLACE_ALLOC
      el = (T*)malloc(sizeof(T) * fqel);
      for (long n = 0; n < fqel; ++n)
        new (&(el[n])) T;
#else
      el = new T[fqel];
#endif
    }
    if (val != NULL) for (long n = 0; n < qel; ++n)
        el[n] = *val;
  } else {
    if (qel != fqel) {
      if (fqel <= 0) {
        qel = 0;
#ifdef USE_REPLACE_ALLOC
        for (long n = 0; n < qel; ++n)
          el[n].~T();
        free(el);
#else
        delete[] el;
#endif
        el = NULL;
      } else {
        T* elh;
#ifdef USE_REPLACE_ALLOC
        elh = (T*)malloc(sizeof(T) * fqel);
        for (long n = 0; n < fqel; ++n)
          new (&(elh[n])) T;
#else
        elh = new T[fqel];  // long q = find_min(qel,fqel);
#endif
        for (long n = 0; n < fqel; ++n) {
          if (n < qel)
            elh[n] = el[n];
          else if (val != NULL)
            elh[n] = *val;
        }
#ifdef USE_REPLACE_ALLOC
        for (long n = 0; n < qel; ++n)
          el[n].~T();
        free(el);
#else
        delete[] el;
#endif
        el = elh;
        qel = fqel;
      }
    }
  }
}

sort() [1/2]

template<class T >

void DynLinArr< T >::sort	(	DynLinArr< long > &	sort_ind,
		long	q_to_sort = 0
	)		const

Definition at line 985 of file AbsArr.h.

                                                                       {
  mfunnamep("void DynLinArr<T>::sort(DynLinArr< long >& sort_ind, long "
            "q_to_sort = 0) const");
 
  check_econd12(q_to_sort, >, qel, mcerr);
  if (q_to_sort <= 0) q_to_sort = qel;
  //if(q_to_sort <= 1) return;
 
  sort_ind.clear();
  sort_ind.pilfer(DynLinArr<long>(q_to_sort));
  long n, m;
  for (n = 0; n < q_to_sort; n++) {
    sort_ind.acu(n) = n;
  }
  if (q_to_sort <= 1) return;
 
  long n_possible_next = 1;
 
  for (n = 0; n < q_to_sort - 1; n++) {
    // first it finds the minimum along the rest and replaces if it is less
    long nmin = n_possible_next;
    long ind_nmin = sort_ind.acu(nmin);
    int s_change_possible_next = 0;
 
    //for(m=n+2; m<q_to_sort; m++)
    for (m = n_possible_next + 1; m < q_to_sort; m++) {
      if (el[ind_nmin] > el[sort_ind.acu(m)])
          //if(el[sort_ind.acu(nmin)] > el[sort_ind.acu(m)])
          {
        n_possible_next = nmin;
        s_change_possible_next = 1;
        nmin = m;
        ind_nmin = sort_ind.acu(nmin);
      }
    }
    if (s_change_possible_next == 0 || n_possible_next < n + 2) {
      n_possible_next = n + 2;
    }
    if (el[sort_ind.acu(n)] > el[ind_nmin])
        //if(el[sort_ind.acu(n)] > el[sort_ind.acu(nmin)])
        {
      if (s_change_possible_next == 1) {
        if (n_possible_next < q_to_sort &&
            el[sort_ind.acu(n)] < el[sort_ind.acu(n_possible_next)]) {
          n_possible_next = nmin;
        }
      }
      //long t = sort_ind.acu(nmin);
      sort_ind.acu(nmin) = sort_ind.acu(n);
      sort_ind.acu(n) = ind_nmin;
    }
  }
}

sort() [2/2]

template<class T >

void DynLinArr< T >::sort

(

long

q_to_sort = 0

)

Definition at line 923 of file AbsArr.h.

                                                         {
  mfunnamep("void DynLinArr<T>::sort(long q_to_sort = 0)");
 
  check_econd12(q_to_sort, >, qel, mcerr);
  if (q_to_sort <= 0) q_to_sort = qel;
  if (q_to_sort <= 1) return;
 
  long n_possible_next = 1;
  long q_comp = 0;
  long n, m;
  for (n = 0; n < q_to_sort - 1; n++) {
    //Iprint2n(mcout, n, n_possible_next);
    // first it finds the minimum along the rest and replaces if it is less
    //long nmin = n+1;
    long nmin = n_possible_next;
    T el_min = el[nmin];
    int s_change_possible_next = 0;
 
    //for(m=n+2; m<q_to_sort; m++)
    for (m = n_possible_next + 1; m < q_to_sort; m++) {
      q_comp++;
      //if(el[nmin] > el[m])
      if (el_min > el[m]) {
        n_possible_next = nmin;
        s_change_possible_next = 1;
        nmin = m;
        el_min = el[nmin];
      }
    }
    //Iprint4n(mcout, n_possible_next, s_change_possible_next, nmin, el_min);
    if (s_change_possible_next == 0 || n_possible_next < n + 2) {
      n_possible_next = n + 2;
    }
    //if(el[n] > el[nmin])
    //{
    //  T t = el[nmin];
    //  el[nmin] = el[n];
    //  el[n] = t;
    //}
    //Iprintn(mcout, n_possible_next);
    //Iprint2n(mcout, el[n], el_min);
    if (el[n] > el_min) {
      if (s_change_possible_next == 1) {
        //if(n_possible_next < q_to_sort)
        if (n_possible_next < q_to_sort && el[n] < el[n_possible_next]) {
          n_possible_next = nmin;
        }
      }
      //mcout<<"replacing el[n] and el_min\n";
      T t = el_min;
      el[nmin] = el[n];
      el[n] = t;
    }
    //Iprintn(mcout, (*this));
 
  }
  //Iprintn(mcout, q_comp);
}

sort_select_decreasing()

template<class T >

void DynLinArr< T >::sort_select_decreasing	(	DynLinArr< long > &	sort_ind,
		long	q_to_sort = 0
	)		const

Definition at line 1103 of file AbsArr.h.

                                                                {
  mfunnamep("void DynLinArr<T>::sort_select_decreasing(DynLinArr< long >& "
            "sort_ind, long q_to_sort = 0) const");
 
  check_econd12(q_to_sort, >, qel, mcerr);
  long s_last_noninc = 0;
  if (q_to_sort <= 0) {
    q_to_sort = qel;
    s_last_noninc = 1;
  } else if (q_to_sort == qel) {
    s_last_noninc = 1;
  }
  //Iprintn(mcout, q_to_sort);
 
  //if(qel <= 1) return;
  sort_ind.clear();
  sort_ind.pilfer(DynLinArr<long>(qel));
  long n, m;
  for (n = 0; n < qel; n++) {
    sort_ind[n] = n;
  }
  if (q_to_sort <= 1) return;
 
  long n_possible_next = 1;
 
  for (n = 0; n < q_to_sort - s_last_noninc; n++) {
    //Iprintn(mcout, n);
    // first it finds the minimum along the rest and replaces if it is less
    long nmax = n_possible_next;
    //Iprintn(mcout, nmax);
    long ind_nmax = sort_ind[nmax];
    int s_change_possible_next = 0;
 
    //for(m=n+2; m<q_to_sort; m++)
    for (m = n_possible_next + 1; m < qel; m++) {
      //Iprint3n(mcout, ind_nmax, m, sort_ind[m]);
      if (el[ind_nmax] < el[sort_ind[m]]) {
        n_possible_next = nmax;
        s_change_possible_next = 1;
        nmax = m;
        //Iprintn(mcout, nmax);
        ind_nmax = sort_ind[nmax];
      }
    }
    if (s_change_possible_next == 0 || n_possible_next < n + 2) {
      n_possible_next = n + 2;
    }
    //Iprint4n(mcout, n, sort_ind[n], ind_nmax, el[ind_nmax]);
    if (el[sort_ind[n]] < el[ind_nmax]) {
      if (s_change_possible_next == 1) {
        if (n_possible_next < q_to_sort &&
            el[sort_ind[n]] > el[sort_ind[n_possible_next]]) {
          n_possible_next = nmax;
        }
      }
      //long t = sort_ind.acu(nmin);
      sort_ind[nmax] = sort_ind[n];
      sort_ind[n] = ind_nmax;
    }
  }
  sort_ind.put_qel(qel);
}

sort_select_increasing()

template<class T >

void DynLinArr< T >::sort_select_increasing	(	DynLinArr< long > &	sort_ind,
		long	q_to_sort = 0
	)		const

Definition at line 1040 of file AbsArr.h.

                                                                {
  mfunnamep("void DynLinArr<T>::sort_select_increasing(DynLinArr< long >& "
            "sort_ind, long q_to_sort = 0) const");
 
  check_econd12(q_to_sort, >, qel, mcerr);
  long s_last_noninc = 0;
  if (q_to_sort <= 0) {
    q_to_sort = qel;
    s_last_noninc = 1;
  } else if (q_to_sort == qel) {
    s_last_noninc = 1;
  }
 
  //if(qel <= 1) return;
  sort_ind.clear();
  sort_ind.pilfer(DynLinArr<long>(qel));
  long n, m;
  for (n = 0; n < qel; n++) {
    sort_ind[n] = n;
  }
  if (q_to_sort <= 1) return;
 
  long n_possible_next = 1;
 
  for (n = 0; n < q_to_sort - s_last_noninc; n++) {
    // first it finds the minimum along the rest and replaces if it is less
    long nmin = n_possible_next;
    long ind_nmin = sort_ind[nmin];
    int s_change_possible_next = 0;
 
    //for(m=n+2; m<q_to_sort; m++)
    for (m = n_possible_next + 1; m < qel; m++) {
      if (el[ind_nmin] > el[sort_ind[m]])
          //if(el[sort_ind.acu(nmin)] > el[sort_ind.acu(m)])
          {
        n_possible_next = nmin;
        s_change_possible_next = 1;
        nmin = m;
        ind_nmin = sort_ind[nmin];
      }
    }
    if (s_change_possible_next == 0 || n_possible_next < n + 2) {
      n_possible_next = n + 2;
    }
    if (el[sort_ind[n]] > el[ind_nmin])
        //if(el[sort_ind.acu(n)] > el[sort_ind.acu(nmin)])
        {
      if (s_change_possible_next == 1) {
        if (n_possible_next < q_to_sort &&
            el[sort_ind[n]] < el[sort_ind[n_possible_next]]) {
          n_possible_next = nmin;
        }
      }
      //long t = sort_ind.acu(nmin);
      sort_ind[nmin] = sort_ind[n];
      sort_ind[n] = ind_nmin;
    }
  }
  sort_ind.put_qel(qel);
}

top()

template<class T >

DynArr< T > DynLinArr< T >::top

(

void

)

Definition at line 2924 of file AbsArr.h.

                                                   {
  check();
  DynArr<T> r(1, qel);
  long n;
  for (n = 0; n < qel; n++) {
    r.ac(0, n) = el[n];
  }
  return r;
}

Friends And Related Function Documentation

apply1

template<class T >

template<class P >

void apply1 ( DynLinArr< P > &  ar, void(*)(P &f)  fun  )

friend

apply2

template<class T >

template<class P , class X >

void apply2 ( DynLinArr< P > &  ar, void(*)(P &f, void(*fun21)(X &f))  fun1, void(*)(X &f)  fun2  )

friend

---

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

• AbsArr.h