AbsArr.h File Reference

#include <iostream>
#include <iomanip>
#include "wcpplib/stream/prstream.h"
#include "wcpplib/util/FunNameStack.h"
#include "wcpplib/util/emul_new_stand.h"
#include "wcpplib/util/String.h"
#include "wcpplib/safetl/AbsPtr.h"
#include "wcpplib/math/minmax.h"
#include "wcpplib/stream/definp.h"

Go to the source code of this file.

Classes
class	ArgInterp_Arr
class	ArgInterp_SingleAdr
class	ArgInterp_Val
class	DynLinArr< T >
class	IterDynLinArr< T >
class	DynArr< T >
class	DynArr< T >::IndexingProvider< D >
class	IterDynArr< T >

Macros
#define	ALR_CHECK_BOUND
#define	ALR_CHECK_EACH_BOUND
#define	Iprintdla_int(file, name)
#define	Iprintdla_long(file, name)
#define	Iprintdla_float(file, name)
#define	Iprintdla_double(file, name)
#define	Iprintda_double(file, name)

Functions
template<class T >
	macro_copy_body (DynLinArr< T >) template< class T > void apply1(DynLinArr< T > &ar
template<class T , class X >
void	apply2 (DynLinArr< T > &ar, void(*fun1)(T &f, void(*fun21)(X &f)), void(*fun2)(X &f))
template<class T >
long	append (const T &t, DynLinArr< T > &dla, long &qael, T *tempt=NULL, long new_qel=0)
template<class T >
std::ostream &	operator<< (std::ostream &file, const DynLinArr< T > &f)
template<class T >
std::istream &	operator>> (std::istream &file, DynLinArr< T > &f)
template<class T >
void	print_DynLinArr (std::ostream &file, const DynLinArr< T > &f, int l)
template<class T >
void	print_DynLinArr (std::ostream &file, const DynLinArr< T > &f, int l, long q)
template<class T >
void	print_adr_DynLinArr (std::ostream &file, const DynLinArr< T > &f, int l, long q)
void	print_DynLinArr_int (std::ostream &file, const DynLinArr< int > &f)
void	print_DynLinArr_long (std::ostream &file, const DynLinArr< long > &f)
void	print_DynLinArr_float (std::ostream &file, const DynLinArr< float > &f)
void	print_DynLinArr_double (std::ostream &file, const DynLinArr< double > &f)
void	print_DynLinArr_double2 (std::ostream &file, const DynLinArr< double > &f1, const DynLinArr< double > &f2)
void	print_DynLinArr_int_double (std::ostream &file, const DynLinArr< int > &iar, const DynLinArr< double > &dar)
void	print_DynLinArr_int_double3 (std::ostream &file, const DynLinArr< int > &iar, const DynLinArr< double > &dar1, const DynLinArr< double > &dar2, const DynLinArr< double > &dar3)
template<class T , class X >
void	copy_DynLinArr (const T &s, X &d)
template<class T , class X >
void	convert_DynLinArr (const T &s, X &d)
template<class T >
void	put_qel_1 (DynLinArr< T > &f, long fq)
template<class T , class T1 >
void	assignAll_1 (DynLinArr< T > &f, const T1 &ft)
int	gconfirm_ind (const DynLinArr< long > &qel, const DynLinArr< long > &ind)
int	gconfirm_ind_ext (const DynLinArr< long > &qel, const DynLinArr< long > &ind)
template<class T >
int	ifequal (const DynLinArr< T > &fd1, const DynLinArr< T > &fd2, long qfirst=-1)
template<class T >
int	ifequal (const DynLinArr< T > &fd1, const T *fd2, long qfirst=-1)
template<class T >
int	ifequal (T *fd1, T *fd2, long qfirst)
template<class T >
DynLinArr< T >	merge (const DynLinArr< T > &fd1, long qfd1, const DynLinArr< T > &fd2, long qfd2)
String	DynLinArr_char_we_to_String (DynLinArr< char > &ar)
template<class T >
void	apply1 (DynArr< T > &ar, void(*fun)(T &f))
template<class T , class X >
void	apply2 (DynArr< T > &ar, void(*fun1)(T &f, void(*fun21)(X &f)), void(*fun2)(X &f))
int	find_next_comb (const DynLinArr< long > &qel, DynLinArr< long > &f)
int	find_prev_comb (const DynLinArr< long > &qel, DynLinArr< long > &f)
int	find_next_comb_not_less (const DynLinArr< long > &qel, DynLinArr< long > &f)
template<class T >
int	operator== (const DynLinArr< T > &f1, const DynLinArr< T > &f2)
template<class T , class P >
int	apeq_mant (const DynLinArr< T > &f1, const DynLinArr< T > &f2, P prec)
template<class T >
int	operator!= (const DynLinArr< T > &f1, const DynLinArr< T > &f2)
template<class T >
int	operator== (const DynArr< T > &f1, const DynArr< T > &f2)
template<class T , class P >
int	apeq_mant (const DynArr< T > &f1, const DynArr< T > &f2, P prec)
template<class T >
int	operator!= (const DynArr< T > &f1, const DynArr< T > &f2)
template<class T , class X >
void	copy_DynArr (const DynArr< T > &s, DynArr< X > &d)
template<class T , class X >
void	convert_DynArr (const DynArr< T > &s, DynArr< X > &d)
template<class T >
std::ostream &	operator<< (std::ostream &file, const DynArr< T > &f)
template<class T >
std::istream &	operator>> (std::istream &file, DynArr< T > &f)
template<class T >
void	print_DynArr (std::ostream &file, const DynArr< T > &f, int l)
void	print_DynArr_int_w (std::ostream &file, const DynArr< int > &f, int w)
void	print_DynArr_float (std::ostream &file, const DynArr< float > &f)
void	print_DynArr_double (std::ostream &file, const DynArr< double > &f)

Variables
long	max_qel_DynLinArr
void(*	fun )(T &f))
const int	pq_arrelem_in_line = 5
DynLinArr< long >	qel_communicat

Macro Definition Documentation

ALR_CHECK_BOUND

#define ALR_CHECK_BOUND

Definition at line 76 of file AbsArr.h.

ALR_CHECK_EACH_BOUND

#define ALR_CHECK_EACH_BOUND

Definition at line 79 of file AbsArr.h.

Iprintda_double

#define Iprintda_double	(		file,
			name
	)

Value:

  file << indn << #name << "=" << noindent; \
  print_DynArr_double(file, name);

Definition at line 3248 of file AbsArr.h.

Iprintdla_double

#define Iprintdla_double	(		file,
			name
	)

Value:

  file << indn << #name << "=" << noindent; \
  print_DynLinArr_double(file, name);

Definition at line 1535 of file AbsArr.h.

Iprintdla_float

#define Iprintdla_float	(		file,
			name
	)

Value:

  file << indn << #name << "=" << noindent; \
  print_DynLinArr_float(file, name);

Definition at line 1532 of file AbsArr.h.

Iprintdla_int

#define Iprintdla_int	(		file,
			name
	)

Value:

  file << indn << #name << "=" << noindent; \
  print_DynLinArr_int(file, name);

Definition at line 1526 of file AbsArr.h.

Iprintdla_long

#define Iprintdla_long	(		file,
			name
	)

Value:

  file << indn << #name << "=" << noindent; \
  print_DynLinArr_long(file, name);

Definition at line 1529 of file AbsArr.h.

Function Documentation

apeq_mant() [1/2]

template<class T , class P >

int apeq_mant	(	const DynArr< T > &	f1,
		const DynArr< T > &	f2,
		P	prec
	)

Definition at line 2868 of file AbsArr.h.

                                                                {
  if (f1.get_qel() != f2.get_qel()) return 0;
  if (!apeq_mant(f1.get_el(), f2.get_el(), prec)) return 0;
  return 1;
}

apeq_mant() [2/2]

template<class T , class P >

int apeq_mant	(	const DynLinArr< T > &	f1,
		const DynLinArr< T > &	f2,
		P	prec
	)

Definition at line 2843 of file AbsArr.h.

                                                                      {
  if (f1.get_qel() != f2.get_qel()) return 0;
  long q = f1.get_qel();
  long n;
  for (n = 0; n < q; n++) {
    if (!apeq_mant(f1.acu(n), f2.acu(n), prec)) return 0;
  }
  return 1;
}

Referenced by apeq_mant().

append()

template<class T >

long append	(	const T &	t,
		DynLinArr< T > &	dla,
		long &	qael,
		T *	tempt = NULL,
		long	new_qel = 0
	)

Definition at line 1247 of file AbsArr.h.

              {
  if (dla.get_qel() < qael) {
    mcerr << "ERROR in long append(class DynLinArr& dla, ...): dla.get_qel() < "
             "qael\n"
          << "dla.get_qel()=" << dla.get_qel() << " qael=" << qael << '\n';
    mcerr << "Type of T is (in internal notations) " << typeid(T).name()
          << '\n';
    spexit(mcerr);
  }
  if (dla.get_qel() == qael) {
    if (new_qel <= qael) new_qel = find_max(3 * qael, long(3));
    dla.put_qel(new_qel, tempt, ArgInterp_SingleAdr());
  }
  dla[qael++] = t;
  return qael;
}

apply1()

template<class T >

void apply1	(	DynArr< T > &	ar,
		void(*)(T &f)	fun
	)

Definition at line 2743 of file AbsArr.h.

                                                                 {
  long q = ar.el.get_qel();
  long n;
  for (n = 0; n < q; n++)
    (*fun)(ar.el[n]);
}

apply2() [1/2]

template<class T , class X >

void apply2	(	DynArr< T > &	ar,
		void(*)(T &f, void(*fun21)(X &f))	fun1,
		void(*)(X &f)	fun2
	)

Definition at line 2750 of file AbsArr.h.

                                {
  long q = ar.el.get_qel();
  long n;
  for (n = 0; n < q; n++)
    (*fun1)(ar.el[n], fun2);
}

apply2() [2/2]

template<class T , class X >

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

Definition at line 602 of file AbsArr.h.

                                {
  long n;
  for (n = 0; n < ar.qel; n++)
    (*fun1)(ar.el[n], fun2);
}

assignAll_1()

template<class T , class T1 >

void assignAll_1	(	DynLinArr< T > &	f,
		const T1 &	ft
	)

Definition at line 1573 of file AbsArr.h.

    {
  long q = f.get_qel();
  long n;
  for (n = 0; n < q; n++)
    f[n].assignAll(ft);
}

convert_DynArr()

template<class T , class X >

void convert_DynArr	(	const DynArr< T > &	s,
		DynArr< X > &	d
	)

Definition at line 2910 of file AbsArr.h.

                                                      {
  mfunnamep("template<class T, class X> void convert_DynArr(const DynArr<T>& "
            "s, DynArr<X>& d)");
  s.check();
  d.check();
  d = DynArr<X>(s.get_qel(), NULL);
  IterDynArr<T> iter(&s);
  T* at;
  while ((at = iter.more()) != NULL) {
    const DynLinArr<long>& ncur = iter.get_ncur();
    d.ac(ncur) = X(*at);
  }
}

convert_DynLinArr()

template<class T , class X >

void convert_DynLinArr	(	const T &	s,
		X &	d
	)

Definition at line 1553 of file AbsArr.h.

                                                                     {
  long q = s.get_qel();
  d.put_qel(q);
  long n;
  for (n = 0; n < q; n++) {
    d[n] = X(s[n]);
  }
}

copy_DynArr()

template<class T , class X >

void copy_DynArr	(	const DynArr< T > &	s,
		DynArr< X > &	d
	)

Definition at line 2894 of file AbsArr.h.

                                                                               {
  mfunnamep("template<class T, class X> void copy_DynArr(const DynArr<T>& s, "
            "DynArr<X>& d)");
  s.check();
  d.check();
  d = DynArr<X>(s.get_qel(), NULL);
  IterDynArr<T> iter(&s);
  T* at;
  while ((at = iter.more()) != NULL) {
    const DynLinArr<long>& ncur = iter.get_ncur();
    d.ac(ncur) = *at;
  }
}

Referenced by inverse_DynArr().

copy_DynLinArr()

template<class T , class X >

void copy_DynLinArr	(	const T &	s,
		X &	d
	)

Definition at line 1540 of file AbsArr.h.

                                                                  {
  mfunnamep("template<class T, class X> void copy_DynLinArr(const T& s, X& d)");
  s.check();
  d.check();
  long q = s.get_qel();
  d.put_qel(q);
  long n;
  for (n = 0; n < q; n++) {
    d[n] = s[n];
  }
}

DynLinArr_char_we_to_String()

String DynLinArr_char_we_to_String

(

DynLinArr< char > &

ar

)

Definition at line 228 of file AbsArr.cpp.

                                                        {
  DynLinArr<char> ar_ext(ar.get_qel() + 1);
  long n;
  long q = ar.get_qel();
  for (n = 0; n < q; n++) {
    ar_ext[n] = ar[n];
  }
  ar_ext[n] = '\0';
  return String(&(ar_ext[0]));
}

find_next_comb()

int find_next_comb	(	const DynLinArr< long > &	qel,
		DynLinArr< long > &	f
	)

Definition at line 465 of file AbsArr.cpp.

                                                                   {
  long n;
  long qdim = qel.get_qel();
  if (qdim <= 0) return 0;
  if (qdim != f.get_qel()) return 0;  //@@
#ifdef DEBUG_DYNARR
  for (n = qdim - 1; n >= 0; n--) {
    if (f[n] < qel[n] - 1) {
      f[n]++;
      return 1;
    } else {
      f[n] = 0;
    }  // the first element
 
  }  // it was last combination
  for (n = 0; n < qdim - 1; n++)
    f[n] = qel[n] - 1;          // the last element
  f[qdim - 1] = qel[qdim - 1];  // next after last
#else
  for (n = qdim - 1; n >= 0; n--) {
    if (f.acu(n) < qel.acu(n) - 1) {
      f.acu(n)++;
      return 1;
    } else {
      f.acu(n) = 0;
    }  // the first element
 
  }  // it was last combination
  for (n = 0; n < qdim - 1; n++)
    f.acu(n) = qel.acu(n) - 1;          // the last element
  f.acu(qdim - 1) = qel.acu(qdim - 1);  // next after last
#endif
  return 0;
}

Referenced by IterDynArr< T >::more().

find_next_comb_not_less()

int find_next_comb_not_less	(	const DynLinArr< long > &	qel,
		DynLinArr< long > &	f
	)

Definition at line 500 of file AbsArr.cpp.

                                                                            {
  long n;
  long qdim = qel.get_qel();
  if (qdim <= 0) return 0;
  if (qdim != f.get_qel()) return 0;  //@@
  for (n = qdim - 1; n >= 0; n--) {
    if (f[n] < qel[n] - 1) {
      f[n]++;
      int n1;
      for (n1 = n + 1; n1 < qdim; n1++)
        f[n1] = f[n];
      return 1;
    }
  }  // it was last combination
  for (n = 0; n < qdim - 1; n++)
    f[n] = qel[n] - 1;          // the last element
  f[qdim - 1] = qel[qdim - 1];  // next after last
  return 0;
}

find_prev_comb()

int find_prev_comb	(	const DynLinArr< long > &	qel,
		DynLinArr< long > &	f
	)

Definition at line 520 of file AbsArr.cpp.

                                                                   {
  long n;
  long qdim = qel.get_qel();
  if (qdim <= 0) return 0;
  if (qdim != f.get_qel()) return 0;  //@@
  for (n = qdim - 1; n >= 0; n--) {
    if (f[n] >= 1) {
      f[n]--;
      return 1;
    } else {
      f[n] = qel[n] - 1;
    }  // the last element
  }
  for (n = 0; n < qdim - 1; n++)
    f[n] = 0;  // the first element
  f[qdim - 1] = -1;
  return 0;  // previous before first
}

Referenced by IterDynArr< T >::less().

gconfirm_ind()

int gconfirm_ind	(	const DynLinArr< long > &	qel,
		const DynLinArr< long > &	ind
	)

Definition at line 433 of file AbsArr.cpp.

                                                                         {
  if (qel.get_qel() != ind.get_qel()) {
    mcerr << "gconfirm_ind(...): "
          << "qel.get_qel()!= ind.get_qel()\n"
          << "qel.get_qel()=" << qel.get_qel()
          << "ind.get_qel()=" << ind.get_qel() << '\n';
    spexit(mcerr);
  }
  long qd = qel.get_qel();
  //if( ind.get_qel() < qd) qd=ind.get_qel();
  long n;
  for (n = 0; n < qd; n++)
    if (ind[n] < 0 || ind[n] >= qel[n]) return 0;
  return 1;
}

Referenced by DynArr< T >::confirm_ind().

gconfirm_ind_ext()

int gconfirm_ind_ext	(	const DynLinArr< long > &	qel,
		const DynLinArr< long > &	ind
	)

Definition at line 448 of file AbsArr.cpp.

                                                                             {
  if (qel.get_qel() > ind.get_qel()) {
    mcerr << "gconfirm_ind_ext(...): "
          << "qel.get_qel()> ind.get_qel()\n"
          << "qel.get_qel()=" << qel.get_qel()
          << " ind.get_qel()=" << ind.get_qel() << '\n';
    spexit(mcerr);
  }
  long qd = qel.get_qel();
  long n;
  for (n = 0; n < qd; n++)
    if (ind[n] < 0 || ind[n] >= qel[n]) return 0;
  for (n = qd; n < ind.get_qel(); n++)
    if (ind[n] != 0) return 0;
  return 1;
}

Referenced by DynArr< T >::confirm_ind_ext().

ifequal() [1/3]

template<class T >

int ifequal	(	const DynLinArr< T > &	fd1,
		const DynLinArr< T > &	fd2,
		long	qfirst = -1
	)

Definition at line 1631 of file AbsArr.h.

                              {
  long n;
  if (qfirst == -1) {
    if ((qfirst = fd1.get_qel()) != fd2.get_qel()) return 0;
    //qfirst=fd1.get_qel();
  } else {
    if (qfirst > fd1.get_qel() || qfirst > fd2.get_qel()) return 0;
  }
  //Iprintn(mcout, qfirst);
  for (n = 0; n < qfirst; n++) {
    //Iprint3n(mcout, n, fd1[n], fd2[n]);
    if (!(fd1[n] == fd2[n])) return 0;
  }
  return 1;
}

ifequal() [2/3]

template<class T >

int ifequal	(	const DynLinArr< T > &	fd1,
		const T *	fd2,
		long	qfirst = -1
	)

Definition at line 1650 of file AbsArr.h.

                                                                     {
  long n;
  if (qfirst == -1) {
    qfirst = fd1.get_qel();
  } else {
    if (qfirst > fd1.get_qel()) return 0;
  }
  for (n = 0; n < qfirst; n++)
    if (!(fd1[n] == fd2[n])) return 0;
  return 1;
}

ifequal() [3/3]

template<class T >

int ifequal	(	T *	fd1,
		T *	fd2,
		long	qfirst
	)

Definition at line 1662 of file AbsArr.h.

                                                            {
  long n;
  for (n = 0; n < qfirst; n++)
    if (!(fd1[n] == fd2[n])) return 0;
  return 1;
}

macro_copy_body()

template<class T >

macro_copy_body

(

DynLinArr< T >

)

&

merge()

template<class T >

DynLinArr< T > merge	(	const DynLinArr< T > &	fd1,
		long	qfd1,
		const DynLinArr< T > &	fd2,
		long	qfd2
	)

Definition at line 1670 of file AbsArr.h.

                              {
  long n;
  if (qfd1 < 0) {
    qfd1 = fd1.get_qel();
  }
  if (qfd2 < 0) {
    qfd2 = fd2.get_qel();
  }
  DynLinArr<T> ret(qfd1 + qfd2);
  if (qfd1 + qfd2 == 0) return ret;
  for (n = 0; n < qfd1; n++) {
    ret[n] = fd1[n];
  }
  for (n = 0; n < qfd2; n++) {
    ret[qfd1 + n] = fd2[n];
  }
  return ret;
}

operator!=() [1/2]

template<class T >

int operator!=	(	const DynArr< T > &	f1,
		const DynArr< T > &	f2
	)

Definition at line 2874 of file AbsArr.h.

                                                                            {
  if (f1.get_qel() == f2.get_qel()) return 0;
  if (f1.get_el() == f2.get_el()) return 0;
  return 1;
}

operator!=() [2/2]

template<class T >

int operator!=	(	const DynLinArr< T > &	f1,
		const DynLinArr< T > &	f2
	)

Definition at line 2854 of file AbsArr.h.

                                                                   {
  if (f1 == f2)
    return 0;
  else
    return 1;
}

operator<<() [1/2]

template<class T >

std::ostream & operator<<	(	std::ostream &	file,
		const DynArr< T > &	f
	)

Definition at line 3022 of file AbsArr.h.

                                                                 {
  //mfunnamep("template<class T> std::ostream& operator<<(std::ostream& file,
  //const DynArr<T>& f)");
  f.check();
  Ifile << "DynArr<T>: qdim=" << f.get_qdim() << '\n';
  indn.n += 2;
  if (s_short_output > 0) {
    Ifile << noindent << f.get_qel() << yesindent;
  } else {
    Ifile << "qel=" << noindent << f.get_qel() << yesindent;
    Ifile << "cum_qel=" << noindent << f.get_cum_qel() << yesindent;
  }
  if (f.get_s_non_emplty() == 1) {
    if (s_short_output == 0) {
      Ifile << "Content element by element:\n";
      Ifile << "(The first number is sequencial number, then there are "
               "indexes, the last is the element)\n";
      //DynArr<T>& ff(f);
    }
    long nseq = 0;
    IterDynArr<T> iter_f(&((DynArr<T>&)f));
    T* at;
    while ((at = iter_f.more()) != NULL) {
      std::ostringstream ost;
      if (s_short_output == 0) {
        //Ifile<<"ncur="<<noindent<<iter_f.get_ncur()<<yesindent;
        Ifile << "nseq=" << std::setw(5) << nseq << " ncur=";
        long n;
        for (n = 0; n < iter_f.get_ncur().get_qel(); n++) {
          file << ' ' << std::setw(5) << iter_f.get_ncur()[n];
        }
        ost << indn << " element=" << noindent << (*at) << yesindent;
      } else {
        ost << indn << noindent << (*at) << yesindent;
      }
      put_one_n(ost);
      file << ost.str();
      nseq++;
    }
    file << yesindent;
  } else {
    if (s_short_output == 0) {
      Ifile << "Content is empty.\n";
    }
  }
  indn.n -= 2;
  return file;
}

operator<<() [2/2]

template<class T >

std::ostream & operator<<	(	std::ostream &	file,
		const DynLinArr< T > &	f
	)

Definition at line 1320 of file AbsArr.h.

                                                                    {
  //mfunnamep("template<class T> std::ostream& operator<<(std::ostream& file,
  //const DynLinArr<T>& f)");
  //mcout<<"operator<<(std::ostream& file, const DynLinArr<T>& f) is started\n";
  Ifile << "DynLinArr<T>: qel=" << f.get_qel() << '\n';
  f.check();
  long n;
  indn.n += 2;
  for (n = 0; n < f.get_qel(); n++) {
    //Ifile<<"n="<<n<<" el[n]="<<noindent<<f[n]<<yesindent<<'\n';
    if (s_short_output == 0) {
      Ifile << "n=" << n << " el[n]=";
    }
    std::ostringstream ost;
    ost << indn << noindent << f[n] << yesindent;
    put_one_n(ost);
    file << ost.str();
  }
  //file<<yesindent;
  indn.n -= 2;
  return file;
}

operator==() [1/2]

template<class T >

int operator==	(	const DynArr< T > &	f1,
		const DynArr< T > &	f2
	)

Definition at line 2861 of file AbsArr.h.

                                                                            {
  if (f1.get_qel() != f2.get_qel()) return 0;
  if (f1.get_el() != f2.get_el()) return 0;
  return 1;
}

operator==() [2/2]

template<class T >

int operator==	(	const DynLinArr< T > &	f1,
		const DynLinArr< T > &	f2
	)

Definition at line 2832 of file AbsArr.h.

                                                                   {
  if (f1.get_qel() != f2.get_qel()) return 0;
  long q = f1.get_qel();
  long n;
  for (n = 0; n < q; n++) {
    if (!(f1.acu(n) == f2.acu(n))) return 0;
  }
  return 1;
}

operator>>() [1/2]

template<class T >

std::istream & operator>>	(	std::istream &	file,
		DynArr< T > &	f
	)

Definition at line 3099 of file AbsArr.h.

                                                                          {
  mfunnamep(
      "template<class T> istream& operator>>(istream& file, DynArr<T>& f)");
  definp_endpar dep(&file, 0, 1, 0, s_short_output);
  long qdim = 0;
  dep.s_short = 0;
  DEFINPAP(qdim);
  dep.s_short = s_short_output;
  check_econd11(qdim, < 0, mcerr);
  if (s_short_output == 0) {
    set_position("qel=DynLinArr<T>:", *dep.istrm, dep.s_rewind, dep.s_req_sep);
  } else {
    set_position("DynLinArr<T>:", *dep.istrm, dep.s_rewind, dep.s_req_sep);
  }
  DynLinArr<long> qel_loc;
  //mcout<<"now will read qel_loc\n";
  file >> qel_loc;
  //mcout<<"qel_loc is read\n";
  if (s_short_output == 0) {
    set_position("cum_qel=DynLinArr<T>:", *dep.istrm, dep.s_rewind,
                 dep.s_req_sep);
    DynLinArr<long> cum_qel_loc;
    file >> cum_qel_loc;  // this is in general unnecessary
  }
  if (qel_loc.get_qel() > 0) {
    f.pilfer(DynArr<T>(qel_loc, NULL));
    long nseq;
    long n;
    long qseq = qel_loc[0];
    for (n = 1; n < qel_loc.get_qel(); n++) {
      qseq *= qel_loc[n];
    }
    for (n = 0; n < qseq; n++) {
      if (s_short_output == 0) {
        DEFINPAP(nseq);
        check_econd12(nseq, !=, n, mcerr);
        DynLinArr<long> ncur(qel_loc.get_qel());
        set_position("ncur=", *dep.istrm, dep.s_rewind, dep.s_req_sep);
        long m;
        for (m = 0; m < qel_loc.get_qel(); m++) {
          file >> ncur[m];
        }
        //T element;
        //DEFINPAP(element);
        //f.ac(ncur) = element;
        set_position("element=", *dep.istrm, dep.s_rewind, dep.s_req_sep);
      }
      file >> f.ac_lin(n);
    }
  } else {
    if (s_short_output == 0) {
      // just pass to end
      set_position("Content is empty.", *dep.istrm, dep.s_rewind,
                   dep.s_req_sep);
    }
    f.pilfer(DynArr<T>());
 
  }
  return file;
}

operator>>() [2/2]

template<class T >

std::istream & operator>>	(	std::istream &	file,
		DynLinArr< T > &	f
	)

Definition at line 1346 of file AbsArr.h.

                                                              {
  mfunnamep(
      "template<class T> istream& operator>>(istream& file, DynLinArr<T>& f)");
  //mcout<<"operator<<(std::ostream& file, const DynLinArr<T>& f) is started\n";
  definp_endpar dep(&file, 0, 1, 0, s_short_output);
  long qel = 0;
  dep.s_short = 0;
  DEFINPAP(qel);
  dep.s_short = s_short_output;
  check_econd11(qel, < 0, mcerr);
  f.clear();
  f.put_qel(qel);
  long fn;
  for (fn = 0; fn < qel; fn++) {
    if (s_short_output == 0) {
      long n = 0;
      DEFINPAP(n);
      check_econd12(fn, !=, n, mcerr);
    }
    //set_position("el[n]=", *dep.istrm, dep.s_rewind, dep.s_req_sep);
    //file >> f[n];
    definp_any_par(f[fn], "el[n]=", dep);
  }
  return file;
}

print_adr_DynLinArr()

template<class T >

void print_adr_DynLinArr	(	std::ostream &	file,
		const DynLinArr< T > &	f,
		int	l,
		long	q
	)

Definition at line 1474 of file AbsArr.h.

                                 {
  //mfunnamep("template<class T> void print_adr_DynLinArr(std::ostream& file,
  //const DynLinArr<T>& f, int l, long q)");
  Ifile << "DynLinArr<T>: qel=" << f.get_qel() << " q to print is " << q
        << '\n';
  f.check();
  if (q > f.get_qel()) {
    mcerr << "print_adr_DynLinArr(...): q>f.get_qel(), q=" << q
          << " f.get_qel()=" << f.get_qel() << '\n';
    mcerr << "Type of T is (in internal notations) " << typeid(T).name()
          << '\n';
    spexit(mcerr);
  }
  long n;
  indn.n += 2;
  for (n = 0; n < q; n++) {
    //Ifile<<"n="<<n<<" el[n]="<<noindent; f[n]->print(file, l);
    //file<<yesindent;
    Ifile << "n=" << n << " el[n]=" << noindent;
    std::ostringstream ost;
    f[n]->print(ost, l);
    ost << yesindent;
    put_one_n(ost);
    file << ost.str();
  }
  indn.n -= 2;
}

print_DynArr()

template<class T >

void print_DynArr	(	std::ostream &	file,
		const DynArr< T > &	f,
		int	l
	)

Definition at line 3198 of file AbsArr.h.

                                                               {
  //mfunnamep("template<class T> oid print_DynArr(std::ostream& file, const
  //DynArr<T>& f, int l)");
  f.check();
  //Ifile<<"DynArr<T>: qdim="<<f.get_qdim()
  //     <<" qel="<<noindent<<f.get_qel()<<yesindent<<'\n';
  Ifile << "DynArr<T>: qdim=" << f.get_qdim() << '\n';
  indn.n += 2;
  Ifile << "qel=" << noindent << f.get_qel() << yesindent;
  Ifile << "cum_qel=" << noindent << f.get_cum_qel() << yesindent;
  Ifile << "Content element by element:\n";
  Ifile << "(The first number is sequencial number, then there are indexes, "
           "the last is the element)\n";
  //DynArr<T>& ff(f);
  long nseq = 0;
  IterDynArr<T> iter_f(&((DynArr<T>&)f));
  T* at;
  while ((at = iter_f.more()) != NULL) {
    //Ifile<<"ncur="<<noindent<<iter_f.get_ncur()<<yesindent;
    Ifile << "nseq=" << std::setw(5) << nseq << " ncur=";
    long n;
    for (n = 0; n < iter_f.get_ncur().get_qel(); n++) {
      file << ' ' << std::setw(5) << iter_f.get_ncur()[n];
    }
    //file<<'\n';
    //Ifile<<"element="<<noindent; at->print(file, l);
    //file<<yesindent<<'\n';
    std::ostringstream ost;
    ost << indn << " element=" << noindent;
    at->print(ost, l);
    ost << yesindent;
    put_one_n(ost);
    file << ost.str();
  }
  file << yesindent;
  indn.n -= 2;
 
}

print_DynArr_double()

void print_DynArr_double	(	std::ostream &	file,
		const DynArr< double > &	f
	)

print_DynArr_float()

void print_DynArr_float	(	std::ostream &	file,
		const DynArr< float > &	f
	)

print_DynArr_int_w()

void print_DynArr_int_w	(	std::ostream &	file,
		const DynArr< int > &	f,
		int	w
	)

print_DynLinArr() [1/2]

template<class T >

void print_DynLinArr	(	std::ostream &	file,
		const DynLinArr< T > &	f,
		int	l
	)

Definition at line 1405 of file AbsArr.h.

                                                                     {
  //mfunnamep("template<class T> void print_DynLinArr(std::ostream& file, const
  //DynLinArr<T>& f, int l)");
  Ifile << "DynLinArr<T>: qel=" << f.get_qel() << '\n';
  f.check();
  long n;
  indn.n += 2;
  for (n = 0; n < f.get_qel(); n++) {
    //Ifile<<"n="<<n<<" el[n]="<<noindent; f[n].print(file, l);
    //file<<yesindent;
    Ifile << "n=" << n << " el[n]=" << noindent;
    std::ostringstream ost;
    f[n].print(ost, l);
    ost << yesindent;
    put_one_n(ost);
    file << ost.str();
  }
  indn.n -= 2;
}

print_DynLinArr() [2/2]

template<class T >

void print_DynLinArr	(	std::ostream &	file,
		const DynLinArr< T > &	f,
		int	l,
		long	q
	)

Definition at line 1445 of file AbsArr.h.

                                                                             {
  //mfunnamep("template<class T> void print_DynLinArr(std::ostream& file, const
  //DynLinArr<T>& f, int l, long q)");
  Ifile << "DynLinArr<T>: qel=" << f.get_qel() << " q to print is " << q
        << '\n';
  f.check();
  if (q > f.get_qel()) {
    mcerr << "print_DynLinArr(...): q>f.get_qel(), q=" << q
          << " f.get_qel()=" << f.get_qel() << '\n';
    mcerr << "Type of T is (in internal notations) " << typeid(T).name()
          << '\n';
    spexit(mcerr);
  }
  long n;
  indn.n += 2;
  for (n = 0; n < q; n++) {
    //Ifile<<"n="<<n<<" el[n]="<<noindent; f[n].print(file, l);
    //file<<yesindent;
    Ifile << "n=" << n << " el[n]=" << noindent;
    std::ostringstream ost;
    f[n].print(ost, l);
    ost << yesindent;
    put_one_n(ost);
    file << ost.str();
  }
  indn.n -= 2;
}

print_DynLinArr_double()

void print_DynLinArr_double	(	std::ostream &	file,
		const DynLinArr< double > &	f
	)

print_DynLinArr_double2()

void print_DynLinArr_double2	(	std::ostream &	file,
		const DynLinArr< double > &	f1,
		const DynLinArr< double > &	f2
	)

print_DynLinArr_float()

void print_DynLinArr_float	(	std::ostream &	file,
		const DynLinArr< float > &	f
	)

print_DynLinArr_int()

void print_DynLinArr_int	(	std::ostream &	file,
		const DynLinArr< int > &	f
	)

print_DynLinArr_int_double()

void print_DynLinArr_int_double	(	std::ostream &	file,
		const DynLinArr< int > &	iar,
		const DynLinArr< double > &	dar
	)

print_DynLinArr_int_double3()

void print_DynLinArr_int_double3	(	std::ostream &	file,
		const DynLinArr< int > &	iar,
		const DynLinArr< double > &	dar1,
		const DynLinArr< double > &	dar2,
		const DynLinArr< double > &	dar3
	)

print_DynLinArr_long()

void print_DynLinArr_long	(	std::ostream &	file,
		const DynLinArr< long > &	f
	)

put_qel_1()

template<class T >

void put_qel_1	(	DynLinArr< T > &	f,
		long	fq
	)

Definition at line 1563 of file AbsArr.h.

    {
  long q = f.get_qel();
  long n;
  for (n = 0; n < q; n++)
    f[n].put_qel(fq);
}

Variable Documentation

fun

void(* fun) (T &f))

(

T &

f

)

Definition at line 591 of file AbsArr.h.

                                                 {
  long n;
  for (n = 0; n < ar.qel; n++)
    (*fun)(ar.el[n]);
}

Referenced by apply1(), t_integ_generic_point_ar(), and t_integ_generic_step_ar().

max_qel_DynLinArr

long max_qel_DynLinArr

extern

Definition at line 17 of file AbsArr.cpp.

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

pq_arrelem_in_line

const int pq_arrelem_in_line = 5

Definition at line 1503 of file AbsArr.h.

Referenced by print_DynArr_double(), print_DynArr_float(), print_DynLinArr_double(), print_DynLinArr_double2(), print_DynLinArr_float(), print_DynLinArr_int(), and print_DynLinArr_long().

qel_communicat

DynLinArr<long> qel_communicat

extern

Definition at line 539 of file AbsArr.cpp.

Referenced by DynArr< T >::put_qel().