Service class (array of manip_absvol). More...

#include <volume.h>

Public Member Functions
	manip_absvol_treeid ()
	Constructor.

manip_absvol *	G_lamvol () const
	Get last address of manipulator.

absvol *	G_lavol () const
	Get last address of volume.

void	down_absref (absref *f)

void	up_absref (absref *f)

int	check_manip_absvol_registered (manip_absvol *amvol)

int	check_absvol_registered (absvol *avol)

void	print (std::ostream &file, int l) const

Public Attributes
std::vector< manip_absvol * >	eid
	List of volumes.

Friends
int	operator== (manip_absvol_treeid &tid1, manip_absvol_treeid &tid2)

int	operator!= (manip_absvol_treeid &tid1, manip_absvol_treeid &tid2)

Detailed Description

Service class (array of manip_absvol).

Definition at line 32 of file volume.h.

Constructor & Destructor Documentation

◆ manip_absvol_treeid()

Heed::manip_absvol_treeid::manip_absvol_treeid ( )

inline

Constructor.

Definition at line 35 of file volume.h.

35{}

Member Function Documentation

◆ check_absvol_registered()

int Heed::manip_absvol_treeid::check_absvol_registered ( absvol * avol )

Definition at line 37 of file volume.cpp.

                                                             {
  for (auto vol : eid) if (vol->Gavol() == avol) return 1;
  return 0;
}

◆ check_manip_absvol_registered()

int Heed::manip_absvol_treeid::check_manip_absvol_registered ( manip_absvol * amvol )

Definition at line 32 of file volume.cpp.

                                                                          {
  for (auto vol : eid) if (vol == amvol) return 1;
  return 0;
}

◆ down_absref()

void Heed::manip_absvol_treeid::down_absref ( absref * f )

Definition at line 22 of file volume.cpp.

                                               {
  const int qeid = eid.size();
  for (int n = qeid - 1; n >= 1; n--) eid[n]->down_absref(f);
}

Referenced by down_absref(), and Heed::stvpoint::stvpoint().

◆ G_lamvol()

manip_absvol * Heed::manip_absvol_treeid::G_lamvol ( ) const

inline

Get last address of manipulator.

Definition at line 39 of file volume.h.

                                 {
    return eid.empty() ? nullptr : eid.back();
  }

◆ G_lavol()

absvol * Heed::manip_absvol_treeid::G_lavol ( ) const

Get last address of volume.

Definition at line 18 of file volume.cpp.

                                           {
  return eid.empty() ? nullptr : eid.back()->Gavol();
}

Referenced by Heed::stvpoint::volume().

◆ print()

void Heed::manip_absvol_treeid::print	(	std::ostream &	file,
		int	l
	)		const

Definition at line 55 of file volume.cpp.

                                                             {
  if (l < 0) return;
  if (eid.empty()) {
    Ifile << "no volume defined\n";
  } else {
    // TODO!
    /*
    const int qeid = eid.size();
    if (l > 0) {
      for (int n = 0; n < qeid - 1; ++n) {
        Ifile << "n=" << n;
        eid[n]->print(file, 0);
      }
    }
    Ifile << "n=" << qeid - 1;
    eid.back()->print(file, 0);
    */
  }
  file.flush();
}

Referenced by Heed::stvpoint::print().

◆ up_absref()

void Heed::manip_absvol_treeid::up_absref ( absref * f )

Definition at line 27 of file volume.cpp.

                                             {
  const int qeid = eid.size();
  for (int n = 1; n < qeid; ++n) eid[n]->up_absref(f);
}

Referenced by Heed::gparticle::calc_step_to_bord(), Heed::mparticle::curvature(), Heed::gparticle::gparticle(), Heed::HeedPhoton::physics(), Heed::HeedDeltaElectron::physics_after_new_speed(), Heed::stvpoint::stvpoint(), and up_absref().

Friends And Related Function Documentation

◆ operator!=

int operator!=	(	manip_absvol_treeid &	tid1,
		manip_absvol_treeid &	tid2
	)

friend

Definition at line 61 of file volume.h.

                                                                            {
  if (tid1 == tid2) return 0;
  return 1;
}

◆ operator==

int operator==	(	manip_absvol_treeid &	tid1,
		manip_absvol_treeid &	tid2
	)

friend

Definition at line 42 of file volume.cpp.

                                                                     {
  // First a quick check.
  if (tid1.eid.size() != tid2.eid.size()) return 0;
  // Check the last volume.
  if (tid1.G_lamvol() != tid2.G_lamvol()) return 0;
  // Check all volumes.
  const int qeid = tid1.eid.size();
  for (int n = 0; n < qeid - 1; ++n) {
    if (tid1.eid[n] != tid2.eid[n]) return 0;
  }
  return 1;
}

Member Data Documentation

◆ eid

std::vector<manip_absvol*> Heed::manip_absvol_treeid::eid

List of volumes.

Definition at line 37 of file volume.h.

Referenced by Heed::gparticle::calc_step_to_bord(), check_absvol_registered(), check_manip_absvol_registered(), down_absref(), Heed::absvol::find_embed_vol(), G_lamvol(), G_lavol(), Heed::gparticle::gparticle(), Heed::manip_absvol::m_find_embed_vol(), Heed::HeedParticle::physics(), Heed::HeedParticle_BGM::physics(), Heed::HeedPhoton::physics_after_new_speed(), Heed::stvpoint::print(), print(), Heed::gparticle::switch_new_vol(), and up_absref().

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

Public Member Functions

Public Attributes

Friends