mspass::utility::ProcessingHistory Class Reference

Lightweight class to preserve procesing chain of atomic objects. More...

#include <ProcessingHistory.h>

Inheritance diagram for mspass::utility::ProcessingHistory:

Public Member Functions
	ProcessingHistory ()
	ProcessingHistory (const std::string jobnm, const std::string jid)
	ProcessingHistory (const ProcessingHistory &parent)
bool	is_empty () const
bool	is_raw () const
bool	is_origin () const
bool	is_volatile () const
bool	is_saved () const
size_t	number_of_stages () override
	Return number of processing stages that have been applied to this object. More...
void	set_as_origin (const std::string alg, const std::string algid, const std::string uuid, const AtomicType typ, bool define_as_raw=false)
std::string	new_ensemble_process (const std::string alg, const std::string algid, const AtomicType typ, const std::vector< ProcessingHistory * > parents, const bool create_newid=true)
void	add_one_input (const ProcessingHistory &data_to_add)
	Add one datum as an input for current data. More...
void	add_many_inputs (const std::vector< ProcessingHistory * > &d)
	Define several data objects as inputs. More...
void	merge (const ProcessingHistory &data_to_add)
	Merge the history nodes from another. More...
void	accumulate (const std::string alg, const std::string algid, const AtomicType typ, const ProcessingHistory &newinput)
	Method to use with a spark reduce algorithm. More...
std::string	clean_accumulate_uuids ()
	Clean up inconsistent uuids that can be produced by reduce. More...
std::string	new_map (const std::string alg, const std::string algid, const AtomicType typ, const ProcessingStatus newstatus=ProcessingStatus::VOLATILE)
	Define this algorithm as a one-to-one map of same type data. More...
std::string	new_map (const std::string alg, const std::string algid, const AtomicType typ, const ProcessingHistory &data_to_clone, const ProcessingStatus newstatus=ProcessingStatus::VOLATILE)
	Define this algorithm as a one-to-one map. More...
std::string	map_as_saved (const std::string alg, const std::string algid, const AtomicType typ)
	Prepare the current data for saving. More...
void	clear ()
std::multimap< std::string, mspass::utility::NodeData >	get_nodes () const
int	stage () const
ProcessingStatus	status () const
std::string	id () const
std::pair< std::string, std::string >	created_by () const
NodeData	current_nodedata () const
std::string	newid ()
int	number_inputs () const
int	number_inputs (const std::string uuidstr) const
void	set_id (const std::string newid)
std::list< mspass::utility::NodeData >	inputs (const std::string id_to_find) const
	Return a list of data that define the inputs to a give uuids. More...
ProcessingHistory &	operator= (const ProcessingHistory &parent)
Public Member Functions inherited from mspass::utility::BasicProcessingHistory
	BasicProcessingHistory (const std::string jobname, const std::string jobid)
	BasicProcessingHistory (const BasicProcessingHistory &parent)
std::string	jobid () const
void	set_jobid (const std::string &newjid)
std::string	jobname () const
void	set_jobname (const std::string jobname)
BasicProcessingHistory &	operator= (const BasicProcessingHistory &parent)

Public Attributes
ErrorLogger	elog

Protected Attributes
std::multimap< std::string, mspass::utility::NodeData >	nodes
Protected Attributes inherited from mspass::utility::BasicProcessingHistory
std::string	jid
std::string	jnm

Detailed Description

Lightweight class to preserve procesing chain of atomic objects.

This class is intended to be used as a parent for any data object in MsPASS that should be considered atomic. It is designed to completely preserve the chain of processing algorithms applied to any atomic data to put it in it's current state. It is designed to save that information during processing with the core information that can then be saved to define the state. Writers for atomic objects inheriting this class should arrange to save the data contained in it to history collection in MongoDB. Note that actually doing the inverse is a different problem that are expected to be implemented as extesions of this class to be used in special programs used to reconstrut a data workflow and the processing chain applied to produce any final output.

The design was complicated by the need to keep the history data from causing memory bloat. A careless implementation could be prone to that problem even for modest chains, but we were particularly worried about iterative algorithms that could conceivably multiply the size of out of control. There was also the fundamental problem of dealing with transient versus data stored in longer term storage instead of just in memory. Our implementation was simplified by using the concept of a unique id with a Universal Unique IDentifier. (UUID) Our history mechanism assumes each data object has a uuid assigned to it on creation by an implementation id of the one object this particular record is associated with on dependent mechanism. That is, whenever a new object is created in MsPASS using the history feature one of these records will be created for each data object that is defined as atomic. This string defines unique key for the object it could be connected to with the this pointer. The parents of the current object are defined by the inputs data structure below.

In the current implementation id is string representation of a uuid maintained by each atomic object. We use a string to maximize flexibility at a minor cost for storage.

Names used imply the following concepts: raw - means the data is new input to mspass (raw data from data center, field experiment, or simulation). That tag means no prior history can be reconstructed. origin - top-level ancestor of current data. The top of a processing chain is always tagged as an origin. A top level can also be "raw" but not necessarily. In particular, readers that load partially processed data should mark the data read as an origin, but not raw. stage - all processed data objects that are volatile elements within a workflow are defined as a stage. They are presumed to leave their existence known only through ancestory preserved in the processing chain. A stage becomes a potential root only when it is saved by a writer where the writer will mark that position as a save. Considered calling this a branch, but that doesn't capture the concept right since we require this mechanism to correctly perserve splits into multiple outputs. We preserve that cleanly for each data object. That is, the implementation make it easy to reconstruct the history of a single final data object, but reconstructing interlinks between objects in an overall processing flow will be a challenge. That was a necessary compomise to avoid memory bloat. The history is properly viewed as a tree branching from a single root (the final output) to leaves that define all it's parents.

The concepts of raw, origin, and stage are implemented with the enum class defined above called ProcessingStatus. Each history record has that as an attribute, but each call to new_stage updates a copy kept inside this object to simplify the python wrappers.

Constructor & Destructor Documentation

ProcessingHistory() [1/3]

mspass::utility::ProcessingHistory::ProcessingHistory

(

)

Default constructor.

                                    :elog()
{
  current_status=ProcessingStatus::UNDEFINED;
  current_id="UNDEFINED";
  current_stage=-1;  //illegal value that could be used as signal for uninitalized
  mytype=AtomicType::UNDEFINED;
  algorithm="UNDEFINED";
  algid="UNDEFINED";
}

ProcessingHistory() [2/3]

mspass::utility::ProcessingHistory::ProcessingHistory	(	const std::string	jobnm,
		const std::string	jid
	)

Construct and fill in BasicProcessingHistory job attributes.

Parameters

jobnm	- set as jobname
jid	- set as jobid

ProcessingHistory() [3/3]

mspass::utility::ProcessingHistory::ProcessingHistory

(

const ProcessingHistory &

parent

)

Standard copy constructor.

  : BasicProcessingHistory(parent),elog(parent.elog),nodes(parent.nodes),
      algorithm(parent.algorithm),algid(parent.algid)
{
  current_status=parent.current_status;
  current_id=parent.current_id;
  current_stage=parent.current_stage;
  mytype=parent.mytype;
}

Member Function Documentation

accumulate()

void mspass::utility::ProcessingHistory::accumulate	(	const std::string	alg,
		const std::string	algid,
		const AtomicType	typ,
		const ProcessingHistory &	newinput
	)

Method to use with a spark reduce algorithm.

A reduce operator in spark utilizes a binary function where two inputs are used to generate a single output object. Because the inputs could be scattered on multiple processor nodes this operation must be associative. The new_ensemble_process method does not satisfy that constraint so this method was necessary to handle that type of algorithm correctly.

The way this algorithm works is it fundamentally branches on two different cases: (1) initialization, which is detected by testing if the node data map is empty or (2) secondary calls. This should work even if multiple inputs are combined at the end of the reduce operation because the copies being merged will not be empty. Note an empty input will create a complaint entry in the error log.

{
  ProcessingHistory newinput(ni);
  if((newinput.algorithm != algin) || (newinput.algid != algidin)
    || (newinput.jid  != newinput.jobid()) || (newinput.jnm != newinput.jobname()))
  {
    NodeData nd;
    nd=newinput.current_nodedata();
    newinput.newid();
    pair<string,NodeData> pn(newinput.current_id,nd);
    newinput.nodes.insert(pn);
    newinput.jid=newinput.jobid();
    newinput.jnm=newinput.jobname();
    newinput.algorithm=algin;
    newinput.algid=algidin;
    newinput.current_status=ProcessingStatus::VOLATILE;
    newinput.current_stage=nd.stage+1;
    newinput.mytype=typ;
  }
  /* We have to detect an initialization condition without losing the
  stored history.   There are two conditions we need to handle.  First,
  if we create an empty container to hold the accmulator and put it on the
  left hand side we will want to clear the history chain or we will
  accumulate random junk.   The second condition is if we accumulate in
  a way were the left hand side is some existing data where we do want to
  preserve the history.   For the is_empty logic:   we just copy the
  newinput's history and add make its current node data the connection
  backward - i.e. we have to make a new uuid and add an entry. */
  if(this->is_empty())
  {
    this->newid();
    nodes=ni.get_nodes();
    NodeData nd;
    nd=ni.current_nodedata();
    pair<string,NodeData> pn(current_id,nd);
    this->nodes.insert(pn);
    this->set_jobid(ni.jobid());
    this->set_jobname(ni.jobname());
    algorithm=algin;
    algid=algidin;
    current_status=ProcessingStatus::VOLATILE;
    current_stage=nd.stage+1;
    mytype=typ;
  }
  /* This is the condition for a left hand side that is not empty but not
  yet initialized.   We detect this condition by a mismatch in all the unique
  names and ids that mark the current process define this reduce operation*/
  else if((this->algorithm != algin) || (this->algid != algidin)
    || (this->jid  != newinput.jobid()) || (this->jnm != newinput.jobname()))
  {
    /* This is similar to the block above, but the key difference here is we
    have to push this's history data to convert it's current data to define an input.
    That means getting a new uuid and pushing current node data to the nodes map
    as an input */
    NodeData nd;
    nd=this->current_nodedata();
    this->newid();
    pair<string,NodeData> pn(current_id,nd);
    this->nodes.insert(pn);
    this->jid=newinput.jobid();
    this->jnm=newinput.jobname();
    this->algorithm=algin;
    this->algid=algidin;
    this->current_status=ProcessingStatus::VOLATILE;
    this->current_stage=nd.stage+1;
    this->mytype=typ;
    this->merge(newinput);
  }
  else
  {
    this->merge(newinput);
  }
}

References current_nodedata(), and newid().

add_many_inputs()

void mspass::utility::ProcessingHistory::add_many_inputs

(

const std::vector< ProcessingHistory * > &

d

)

Define several data objects as inputs.

This method acts like add_one_input in that it alters only the inputs chain. In fact it is nothing more than a loop over the components of the vector calling add_one_input for each component.

Parameters

d	is the vector of data to define as inputs

{
  vector<ProcessingHistory*>::const_iterator dptr;
  for(dptr=d.begin();dptr!=d.end();++dptr)
  {
    ProcessingHistory *ptr;
    ptr=(*dptr);
    this->add_one_input(*ptr);
  }
}

References add_one_input().

add_one_input()

void mspass::utility::ProcessingHistory::add_one_input

(

const ProcessingHistory &

data_to_add

)

Add one datum as an input for current data.

This method MUST ONLY be called after a call to new_ensemble_process in the situation were additional inputs need to be defined that were not available at the time new_ensemble_process was called. An example might be a stack that was created within the scope of "algorithm" and then used in some way to create the output data. In any case it differs fundamentally from new_ensemble_process in that it does not touch attributes that define the current state of "this". It simply says this is another input to the data "this" contains.

Parameters

data_to_add

is the ProcessingHistory of the data object to be defined as input. Note the type of the data to which it is linked will be saved as the base of the input chain from data_to_add. It can be different from the type of "this".

{
 
  if(data_to_add.is_empty())
  {
    stringstream ss;
    ss<<"Data with uuid="<<data_to_add.id()<<" has an empty history chain"<<endl
      << "At best this will leave ProcessingHistory incomplete"<<endl;
    elog.log_error("ProcessingHistory::add_one_input",ss.str(),
      ErrorSeverity::Complaint);
  }
  else
  {
    multimap<string,NodeData>::iterator nptr;
    multimap<string,NodeData> newhistory = data_to_add.get_nodes();
    multimap<string,NodeData>::iterator nl,nu;
    /* As above this one needs check for duplicates and only add
    a node if the data are unique.  This is simple compared to new_ensemble_process
    because we just have to check one object's history at a time. */
    for(nptr=newhistory.begin();nptr!=newhistory.end();++nptr)
    {
      string key(nptr->first);
      if(this->nodes.count(key)>0)
      {
        nl=this->nodes.lower_bound(key);
        nu=this->nodes.upper_bound(key);
        for(auto ptr=nl;ptr!=nu;++ptr)
        {
          NodeData ndtest(ptr->second);
          if(ndtest != (nptr->second))
          {
            this->nodes.insert(*nptr);
          }
        }
      }
      else
      {
        this->nodes.insert(*nptr);
      }
    }
    /* Don't forget head node data*/
    NodeData nd=data_to_add.current_nodedata();
    NodeData ndhere=this->current_nodedata();
    pair<string,NodeData> pnd(current_id,nd);
    this->nodes.insert(pnd);
  }
}

References id(), is_empty(), and mspass::utility::ErrorLogger::log_error().

clean_accumulate_uuids()

string mspass::utility::ProcessingHistory::clean_accumulate_uuids

(

)

Clean up inconsistent uuids that can be produced by reduce.

In a spark reduce operation it is possible to create multiple uuid keys for inputs to the same algorithm instance. That happpens because the mechanism used by ProcessingHistory to define the process history tree is not associative. When a reduce gets sprayed across multiple nodes multiple initializations can occur that make artifical inconsitent uuids. This method should normally be called after a reduce operator if history is being preserved or the history chain may be foobarred - no invalid just mess up with extra branches in the processing tree.

A VERY IMPORTANT limitation of the algorithm used by this method is that the combination of algorithm and algid in "this" MUST be unique for a given job run when a reduce is called. i.e. if an earlier workflow had used alg and algid but with a different jobid and jobname the distintion cannot be detected with this algorithm. This means our global history handling must guarantee algid is unique for each run.

Returns

unique uuid for alg,algid match set in the history chain. Note if there are no duplicates it simply returns the only one it finds. If there are duplicates it returns the lexically smallest (first in alphabetic order) uuid. Most importantly if there is no match or if history is empty it returns the string UNDEFINED.

{
  /* Return undefined immediately if the history chain is empty */
  if(this->is_empty()) return string("UNDEFINED");
  NodeData ndthis=this->current_nodedata();
  string alg(ndthis.algorithm);
  string algidtest(ndthis.algid);
  /* The algorithm here finds all entries for which algorithm is alg and
  algid matches aldid.  We build a list of uuids (keys) linked to that unique
  algorithm.  We then use the id in ndthis as the master*/
  set<string> matching_ids;
  matching_ids.insert(ndthis.uuid);
  /* this approach of pushing iterators to this list that match seemed to
  be the only way I could make this work correctly.   Not sure why, but
  the added cost over handling this correctly in the loops is small. */
  std::list<multimap<string,NodeData>::iterator> need_to_erase;
  for(auto nptr=this->nodes.begin();nptr!=this->nodes.end();++nptr)
  {
    /* this copy operation is somewhat inefficient, but the cost is small
    compared to how obscure the code will look if we directly manipulate the
    second value */
    NodeData nd(nptr->second);
    /* this depends upon the distinction between set and multiset.  i.e. an insert
    of a duplicate does nothing*/
    if((alg==nd.algorithm) && (algidtest==nd.algid))
    {
      matching_ids.insert(nd.uuid);
      need_to_erase.push_back(nptr);
    }
  }
  // handle no match situation gracefully
  if(matching_ids.empty())
    return string("UNDEFINED");
  /* Nothing more to do but return the uuid if there is only one*/
  if(matching_ids.size()==1)
    return *(matching_ids.begin());
  else
  {
    for(auto sptr=need_to_erase.begin();sptr!=need_to_erase.end();++sptr)
    {
      nodes.erase(*sptr);
    }
    need_to_erase.clear();
  }
  /* Here is the complicated case.  We use the uuid from ndthis as the master
  and change all the others.   This operation works ONLY because in a multimap
  erase only invalidates the iterator it points to and others remain valid.
  */
  string master_uuid=ndthis.uuid;
  for(auto sptr=matching_ids.begin();sptr!=matching_ids.end();++sptr)
  {
    /* Note this test is necessary to stip the master_uuid - no else needed*/
    if((*sptr)!=master_uuid)
    {
      multimap<string,NodeData>::iterator nl,nu;
      nl=this->nodes.lower_bound(*sptr);
      nu=this->nodes.upper_bound(*sptr);
      for(auto nptr=nl;nptr!=nu;++nptr)
      {
        NodeData nd;
        nd=(nptr->second);
        need_to_erase.push_back(nptr);
        nodes.insert(pair<string,NodeData>(master_uuid,nd));
      }
    }
  }
  for(auto sptr=need_to_erase.begin();sptr!=need_to_erase.end();++sptr)
  {
    nodes.erase(*sptr);
  }
 
  return master_uuid;
}

References mspass::utility::NodeData::algid, mspass::utility::NodeData::algorithm, current_nodedata(), is_empty(), and mspass::utility::NodeData::uuid.

clear()

void mspass::utility::ProcessingHistory::clear

(

)

Clear this history chain - use with caution.

{
  nodes.clear();
  current_status=ProcessingStatus::UNDEFINED;
  current_stage=0;
  mytype=AtomicType::UNDEFINED;
  algorithm="UNDEFINED";
  algid="UNDEFINED";
}

created_by()

std::pair<std::string,std::string> mspass::utility::ProcessingHistory::created_by ( ) const

inline

Return the algorithm name and id that created current node.

  {
    std::pair<std::string,std::string> result(algorithm,algid);
    return result;
  }

current_nodedata()

NodeData mspass::utility::ProcessingHistory::current_nodedata

(

)

const

Return all the attributes of current.

This is a convenience method strictly for the C++ interface (it too nonpythonic to be useful to wrap for python). It returns a NodeData class containing the attributes of the head of the chain. Like the getters above that is needed to save that data.

{
  NodeData nd;
  nd.status=current_status;
  nd.uuid=current_id;
  nd.type=mytype;
  nd.stage=current_stage;
  nd.algorithm=algorithm;
  nd.algid=algid;
  return nd;
}

References mspass::utility::NodeData::algid, mspass::utility::NodeData::algorithm, mspass::utility::NodeData::stage, mspass::utility::NodeData::status, mspass::utility::NodeData::type, and mspass::utility::NodeData::uuid.

get_nodes()

multimap< string, NodeData > mspass::utility::ProcessingHistory::get_nodes

(

)

const

Retrieve the nodes multimap that defines the tree stucture branches.

This method does more than just get the protected multimap called nodes. It copies the map and then pushes the "current" contents to the map before returning the copy. This allows the data defines as current to not be pushed into the tree until they are needed.

{
  /* Return empty map if it has no data - necessary or the logic
  below will insert an empty head to the chain. */
  if(this->is_empty())
      return nodes;  // a way to return an empty container
  /* This is wrong, I think, but retained to test before removing.
  remove this once current idea is confirmed. Note if that
  proves true we can also remove the two lines above as they do
  nothing useful*/
  /*
  NodeData nd;
  nd=this->current_nodedata();
  pair<string,NodeData> pn(current_id,nd);
  multimap<string,NodeData> result(this->nodes);
  result.insert(pn);
  return result;
  */
  return nodes;
}

References is_empty().

id()

std::string mspass::utility::ProcessingHistory::id ( ) const

inline

Return the id of this object set for this history chain.

We maintain the uuid for a data object inside this class. This method fetches the string representation of the uuid of this data object.

  {
    return current_id;
  };

inputs()

list< NodeData > mspass::utility::ProcessingHistory::inputs

(

const std::string

id_to_find

)

const

Return a list of data that define the inputs to a give uuids.

This low level getter returns the NodeData objects that define the inputs to the uuid of some piece of data that was used as input at some stage for the current object.

Parameters

id_to_find

is the uuid for which input data is desired.

Returns

list of NodeData that define the inputs. Will silently return empty list if the key is not found.

{
  list<NodeData> result;
  // Return empty list immediately if key not found
  if(nodes.count(id_to_find)<=0) return result;
  /* Note these have to be const_iterators because method is tagged const*/
  multimap<string,NodeData>::const_iterator upper,lower;
  lower=nodes.lower_bound(id_to_find);
  upper=nodes.upper_bound(id_to_find);
  multimap<string,NodeData>::const_iterator mptr;
  for(mptr=lower;mptr!=upper;++mptr)
  {
    result.push_back(mptr->second);
  }
  return result;
};

is_empty()

bool mspass::utility::ProcessingHistory::is_empty

(

)

const

Return true if the processing chain is empty.

This method provides a standard test for an invalid, empty processing chain. Constructors except the copy constructor will all put this object in an invalid state that will cause this method to return true. Only if the chain is initialized properly with a call to set_as_origin will this method return a false.

{
  if( (current_status==ProcessingStatus::UNDEFINED)
     && (nodes.empty()) )return true;
  return false;
}

is_origin()

bool mspass::utility::ProcessingHistory::is_origin

(

)

const

Return true if the current data is in state defined as "origin" - see class description

{
  if(current_status==ProcessingStatus::RAW || current_status==ProcessingStatus::ORIGIN)
    return true;
  else
    return false;
}

is_raw()

bool mspass::utility::ProcessingHistory::is_raw

(

)

const

Return true if the current data is in state defined as "raw" - see class description

{
  if(current_status==ProcessingStatus::RAW)
    return true;
  else
    return false;
}

is_saved()

bool mspass::utility::ProcessingHistory::is_saved

(

)

const

Return true if the current data is in state defined as "saved" - see class description

{
  if(current_status==ProcessingStatus::SAVED)
    return true;
  else
    return false;
}

is_volatile()

bool mspass::utility::ProcessingHistory::is_volatile

(

)

const

Return true if the current data is in state defined as "volatile" - see class description

{
  if(current_status==ProcessingStatus::VOLATILE)
    return true;
  else
    return false;
}

map_as_saved()

string mspass::utility::ProcessingHistory::map_as_saved	(	const std::string	alg,
		const std::string	algid,
		const AtomicType	typ
	)

Prepare the current data for saving.

Saving data is treated as a special form of map operation. That is because a save by our definition is always a one-to-one operation with an index entry for each atomic object. This method pushes a new entry in the history chain tagged by the algorithm/algid field for the writer. It differs from new_map in the important sense that the uuid is not changed. The record this sets in the nodes multimap will then have the same uuid for the key as the that in NodeData. That along with the status set SAVED can be used downstream to recognize save records.

It is VERY IMPORTANT for use of this method to realize this method saves nothing. It only preps the history chain data so calls that follow will retrieve the right information to reconstruct the full history chain. Writers should follow this sequence:

1. call map_as_saved with the writer name for algorithm definition
2. save the data and history chain to MongoDB.
3. be sure you have a copy of the uuid string of the data just saved and call the clear method.
4. call the set_as_origin method using the uuid saved with the algorithm/id the same as used for earlier call to map_as_saved. This makes the put ProcessingHistory in a state identical to that produced by a reader.

Parameters

alg	is the algorithm names to assign to the ouput. This would normally be name defining the writer.
algid	is an id designator to uniquely define an instance of algorithm. Note that algid must itself be a unique keyword or the history chains will get scrambled. alg is mostly carried as baggage to make output more easily comprehended without additional lookups. Note one model to distinguish records of actual save and redefinition of the data as an origin (see above) is to use a different id for the call to map_as_saved and later call to set_as_origin. This code doesn't care, but that is an implementation detail in how this will work with MongoDB.
typ	defines the data type (C++ class) that was just saved.

{
  if(this->is_empty())
  {
    stringstream ss;
    ss << "Attempt to call this method on an empty history chain for uuid="
       << this->id()<<endl
       << "Cannot preserve history for writer="<<alg<<" with id="<<algid<<endl;
    elog.log_error("ProcessingHistory::map_as_saved",ss.str(),ErrorSeverity::Complaint);
    return current_id;
  }
  /* This is essentially pushing current data to the end of the history chain
  but using a special id that may or may not be saved by the caller.
  We use a fixed keyword defined in ProcessingHistory.h assuming saves
  are always a one-to-one operation (definition of atomic really)*/
  NodeData nd(this->current_nodedata());
  pair<string,NodeData> pn(SAVED_ID_KEY,nd);
  this->nodes.insert(pn);
  /* Now we reset current to define it as the saver.  Then calls to the
  getters for the multimap will properly insert this data as the end of the
  chain.  Note a key difference from new_map is we don't create a new uuid.
  I don't think that will cause an ambiguity, but it might be better to
  just create a new one here - will do it this way unless that proves a problem
  as the equality of the two might be a useful test for other purposes */
  algorithm=alg;
  algid=algid_in;
  current_status=ProcessingStatus::SAVED;
  current_id=SAVED_ID_KEY;
  if(current_stage>=0)
    ++current_stage;
  else
  {
    elog.log_error("ProcessingHistory::map_as_saved",
      "current_stage on entry had not been initialized\nImproper usage will create an invalid history chain that may cause downstream problems",
       ErrorSeverity::Complaint);
    current_stage=0;
  }
  mytype=typ;
  return current_id;
}

References id(), is_empty(), and mspass::utility::ErrorLogger::log_error().

merge()

void mspass::utility::ProcessingHistory::merge

(

const ProcessingHistory &

data_to_add

)

Merge the history nodes from another.

Parameters

data_to_add

is the ProcessingHistory of the data object to be merged.

{
 
  if(data_to_add.is_empty())
  {
    stringstream ss;
    ss<<"Data with uuid="<<data_to_add.id()<<" has an empty history chain"<<endl
      << "At best this will leave ProcessingHistory incomplete"<<endl;
    elog.log_error("ProcessingHistory::merge",ss.str(),
      ErrorSeverity::Complaint);
  }
  else
  {
    multimap<string,NodeData>::iterator nptr;
    multimap<string,NodeData> newhistory = data_to_add.get_nodes();
    multimap<string,NodeData>::iterator nl,nu;
    for(nptr=newhistory.begin();nptr!=newhistory.end();++nptr)
    {
      string key(nptr->first);
      /* if the data_to_add's key matches its current id,
      we merge all the nodes under the current id of *this. */
      if(key == data_to_add.current_id)
      {
        this->nodes.insert(std::make_pair(this->current_id, nptr->second));
      }
      else if(this->nodes.count(key)>0)
      {
        nl=this->nodes.lower_bound(key);
        nu=this->nodes.upper_bound(key);
        for(auto ptr=nl;ptr!=nu;++ptr)
        {
          NodeData ndtest(ptr->second);
          if(ndtest != (nptr->second))
          {
            this->nodes.insert(*nptr);
          }
        }
      }
      else
      {
        this->nodes.insert(*nptr);
      }
    }
  }
}

References id(), is_empty(), and mspass::utility::ErrorLogger::log_error().

new_ensemble_process()

string mspass::utility::ProcessingHistory::new_ensemble_process	(	const std::string	alg,
		const std::string	algid,
		const AtomicType	typ,
		const std::vector< ProcessingHistory * >	parents,
		const bool	create_newid = true
	)

Define history chain for an algorithm with multiple inputs in an ensemble.

Use this method to define the history chain for an algorithm that has multiple inputs for each output. Each output needs to call this method to build the connections that define how all inputs link to the the new data being created by the algorithm that calls this method. Use this method for map operators that have an ensemble object as input and a single data object as output. This method should be called in creation of the output object. If the algorthm builds multiple outputs to build an output ensemble call this method for each output before pushing it to the output ensemble container.

This method should not be used for a reduce operation in spark. It does not satisfy the associative rule for reduce. Use accumulate for reduce operations.

Normally, it makes sense to have the boolean create_newid true so it is guaranteed the current_id is unique. There is little cost in creating a new one if there is any doubt the current_id is not a duplicate. The false option is there only for rare cases where the current id value needs to be preserved.

Note the vector of data passed is raw pointers for efficiency to avoid excessive copying. For normal use this should not create memory leaks but make sure you don't try to free what the pointers point to or problems are guaranteed. It is VERY IMPORTANT to realize that all the pointers are presumed to point to the ProcessingHistory component of a set of larger data object (Seismogram or TimeSeries). The parents do not all have be a common type as if they have valid history data within them their current type will be defined.

This method ALWAYS marks the status as VOLATILE.

Parameters

alg	is the algorithm names to assign to the origin node. This would normally be name defining the algorithm that makes sense to a human.
algid	is an id designator to uniquely define an instance of algorithm. Note that algid must itself be a unique keyword or the history chains will get scrambled. alg is mostly carried as baggage to make output more easily comprehended without additional lookups.
typ	defines the data type (C++ class) the algorithm that is generating this data will create.
create_newid	is a boolean defining how the current id is handled. As described above, if true the method will call newid and set that as the current id of this data object. If false the current value is left intact.

Returns

a string representation of the uuid of the data to which this ProcessingHistory is now attached.

{
  if(create_newid)
  {
    this->newid();
  }
  /* We need to clear the tree contents because all the parents will
  branch from this.  Hence, we have to put the node data into an empty
  container */
  this->clear();
  algorithm=alg;
  algid=algid_in;
  mytype=typ;
  /* Initialize current stage but assume it will be updated as max of
  parents below */
  current_stage=0;
  multimap<string,NodeData>::const_iterator nptr,nl,nu;
  size_t i;
  /* current_stage can be ambiguous from multiple inputs.  We define
  the current stage from a reduce as the largest stage value found
  in all inputs.  Note we only test the stage value at the head for
  each parent */
  int max_stage(0);
  for(i=0;i<parents.size();++i)
  {
    if(parents[i]->is_empty())
    {
      stringstream ss;
      ss << "Vector member number "<<i<<" with uuid="<<parents[i]->id()
         << " has an empty history chain"<<endl
         << "At best the processing history data will be incomplete"<<endl;
      elog.log_error("ProcessingHistory::new_ensemble_process",ss.str(),
        ErrorSeverity::Complaint);
      continue;
    }
    multimap<string,NodeData> parent_node_data(parents[i]->get_nodes());
    /* We also have to get the head data with this method now */
    NodeData nd=parents[i]->current_nodedata();
    if(nd.stage>max_stage) max_stage=nd.stage;
    for(nptr=parent_node_data.begin();nptr!=parent_node_data.end();++nptr)
    {
      /*Adding to nodes multimap has a complication.  It is possible in
      some situations to have duplicate node data coming from different
      inputs.  The method we use to reconstruct the processing history tree
      will be confused by such duplicates so we need to test for pure
      duplicates in NodeData values. This algorithm would not scale well
      if the number of values with a common key is large for either
      this or parent[i]*/
      string key(nptr->first);
      if(this->nodes.count(key)>0)
      {
        nl=this->nodes.lower_bound(key);
        nu=this->nodes.upper_bound(key);
        for(auto ptr=nl;ptr!=nu;++ptr)
        {
          NodeData ndtest(ptr->second);
          if(ndtest != (nptr->second))
          {
            this->nodes.insert(*nptr);
          }
        }
      }
      else
      {
        /* No problem just inserting a node if there were no previous
        entries*/
        this->nodes.insert(*nptr);
      }
    }
    /* Also insert the head data */
    pair<string,NodeData> pnd(current_id,nd);
    this->nodes.insert(pnd);
  }
  current_stage=max_stage;
  /* Now reset the current contents to make it the base of the history tree.
  Be careful of uninitialized current_stage*/
  if(current_stage>=0)
    ++current_stage;
  else
  {
    elog.log_error("ProcessingHistory::new_ensemble_process",
      "current_stage for none of the parents was initialized\nImproper usage will create an invalid history chain that may cause downstream problems",
       ErrorSeverity::Complaint);
    current_stage=0;
  }
  algorithm=alg;
  algid=algid_in;
  // note this is output type - inputs can be variable and defined by nodes
  mytype=typ;
  current_status=ProcessingStatus::VOLATILE;
  return current_id;
}

References clear(), is_empty(), mspass::utility::ErrorLogger::log_error(), and newid().

new_map() [1/2]

std::string mspass::utility::ProcessingHistory::new_map	(	const std::string	alg,
		const std::string	algid,
		const AtomicType	typ,
		const ProcessingHistory &	data_to_clone,
		const ProcessingStatus	newstatus = ProcessingStatus::VOLATILE
	)

Define this algorithm as a one-to-one map.

Many algorithms define a one-to-one map where each one input data object creates one output data object. This class allows the input and output to be different data types requiring only that one input will map to one output. It differs from the overloaded method with fewer arguments in that it should be used if you need to clear and refresh the history chain for any reason. Known examples are creating simulation waveforms for testing within a workflow that have no prior history data loaded but which clone some properties of another piece of data. This method should be used in any situation where the history chain in the current data is wrong but the contents are the linked to some other process chain. It is supplied to cover odd cases, but use will likely be rare.

Parameters

alg	is the algorithm names to assign to the origin node. This would normally be name defining the algorithm that makes sense to a human.
algid	is an id designator to uniquely define an instance of algorithm. Note that algid must itself be a unique keyword or the history chains will get scrambled. alg is mostly carried as baggage to make output more easily comprehended without additional lookups.
typ	defines the data type (C++ class) the algorithm that is generating this data will create.
data_to_clone	is reference to the ProcessingHistory section of a parent data object that should be used to override the existing history chain.
newstatus	is how the status marking for the output. Normal (default) would be VOLATILE. This argument was included mainly for flexibility in case we wanted to extend the allowed entries in ProcessingStatus.

new_map() [2/2]

std::string mspass::utility::ProcessingHistory::new_map	(	const std::string	alg,
		const std::string	algid,
		const AtomicType	typ,
		const ProcessingStatus	newstatus = ProcessingStatus::VOLATILE
	)

Define this algorithm as a one-to-one map of same type data.

Many algorithms define a one-to-one map where each one input data object creates one output data object. This (overloaded) version of this method is most appropriate when input and output are the same type and the history chain (ProcessingHistory) is what the new algorithm will alter to make the result when it finishes. Use the overloaded version with a separate ProcessingHistory copy if the current object's data are not correct. In this algorithm the chain for this algorithm is simply appended with new definitions.

Parameters

alg	is the algorithm names to assign to the origin node. This would normally be name defining the algorithm that makes sense to a human.
algid	is an id designator to uniquely define an instance of algorithm. Note that algid must itself be a unique keyword or the history chains will get scrambled. alg is mostly carried as baggage to make output more easily comprehended without additional lookups.
typ	defines the data type (C++ class) the algorithm that is generating this data will create.
newstatus	is how the status marking for the output. Normal (default) would be VOLATILE. This argument was included mainly for flexibility in case we wanted to extend the allowed entries in ProcessingStatus.

newid()

string mspass::utility::ProcessingHistory::newid

(

)

Create a new id.

This creates a new uuid - how is an implementation detail but here we use boost's random number generator uuid generator that has some absurdly small probability of generating two equal ids. It returns the string representation of the id created.

{
  boost::uuids::random_generator gen;
  boost::uuids::uuid uuidval;
  uuidval=gen();
  this->current_id=boost::uuids::to_string(uuidval);
  return current_id;
}

number_inputs() [1/2]

int mspass::utility::ProcessingHistory::number_inputs

(

)

const

Return the number of inputs used to create current data.

In a number of contexts it can be useful to know the number of inputs defined for the current object. This returns that count.

{
  return this->number_inputs(current_id);
}

number_inputs() [2/2]

int mspass::utility::ProcessingHistory::number_inputs

(

const std::string

uuidstr

)

const

Return the number of inputs defined for any data in the process chain.

This overloaded version of number_inputs asks for the number of inputs defined for an arbitrary uuid. This is useful only if backtracing the ancestory of a child.

Parameters

uuidstr

is the uuid string to check in the ancestory record.

number_of_stages()

size_t mspass::utility::ProcessingHistory::number_of_stages ( )

overridevirtual

Return number of processing stages that have been applied to this object.

One might want to know how many processing steps have been previously applied to produce the current data. For linear algorithms that would be useful only in debugging, but for an iterative algorithm it can be essential to avoid infinite loops with a loop limit parameter. This method returns how many times something has been done to alter the associated data. It returns 0 if the data are raw.

Important note is that the number return is the number of processing steps since the last save. Because a save operation is assumed to save the history chain then flush it there is not easy way at present to keep track of the total number of stages. If we really need this functionality it could be easily retrofitted with another private variable that is not reset when the clear method is called.

Reimplemented from mspass::utility::BasicProcessingHistory.

{
  return current_stage;
}

operator=()

ProcessingHistory & mspass::utility::ProcessingHistory::operator=

(

const ProcessingHistory &

parent

)

Assignment operator.

{
  if(this!=(&parent))
  {
    this->BasicProcessingHistory::operator=(parent);
    nodes=parent.nodes;
    current_status=parent.current_status;
    current_id=parent.current_id;
    current_stage=parent.current_stage;
    mytype=parent.mytype;
    algorithm=parent.algorithm;
    algid=parent.algid;
    elog=parent.elog;
  }
  return *this;
}

set_as_origin()

void mspass::utility::ProcessingHistory::set_as_origin	(	const std::string	alg,
		const std::string	algid,
		const std::string	uuid,
		const AtomicType	typ,
		bool	define_as_raw = false
	)

Set to define this as the top origin of a history chain.

This method should be called when a new object is created to initialize the history as an origin. Note again an origin may be raw but not all origins are define as raw. This interface controls that through the boolean define_as_raw (false by default). python wrappers should define an alternate set_as_raw method that calls this method with define_as_raw set true.

It is VERY IMPORTANT to realize that the uuid argument passed to this method is if fundamental importance. That string is assumed to be a uuid that can be linked to either a parent data object read from storage and/or linked to a history chain saved by a prior run. It becomes the current_id for the data to which this object is a parent. This method also always does two things that define how the contents can be used. current_stage is ALWAYS set 0. We distinguish a pure origin from an intermediate save ONLY by the status value saved in the history chain. That is, only uuids with status set to RAW are viewed as guaranteed to be stored. A record marked ORIGIN is assumed to passed through save operation. To retrieve the history chain from multiple runs the pieces have to be pieced together by history data stored in MongoDB.

The contents of the history data structures should be empty when this method is called. That would be the norm for any constructor except those that make a deep copy. If unsure the clear method should be called before this method is called. If it isn't empty it will be cleared anyway and a complaint message will be posted to elog.

Parameters

alg	is the algorithm names to assign to the origin node. This would normally be a reader name, but it could be a synthetic generator.
algid	is an id designator to uniquely define an instance of algorithm. Note that algid must itself be a unique keyword or the history chains will get scrambled.
uuid	unique if for this data object (see note above)
typ	defines the data type (C++ class) "this" points to. It might be possible to determine this dynamically, but a design choice was to only allow registered classes through this mechanism. i.e. the enum class typ implements has a finite number of C++ classes it accepts. The type must be a child ProcessingHistory.
define_as_raw	sets status as RAW if true and ORIGIN otherwise.

Exceptions

Never

throws an exception BUT this method will post a complaint to elog if the history data structures are not empty and it the clear method needs to be called internally.

{
  const string base_error("ProcessingHistory::set_as_origin:  ");
  if( nodes.size()>0 )
  {
    elog.log_error(alg+":"+algid_in,
      base_error + "Illegal usage.  History chain was not empty.   Calling clear method and continuing",
       ErrorSeverity::Complaint);
    this->clear();
  }
  if(define_as_raw)
  {
    current_status=ProcessingStatus::RAW;
  }
  else
  {
    current_status=ProcessingStatus::ORIGIN;
  }
  algorithm=alg;
  algid=algid_in;
  current_id=uuid;
  mytype=typ;
  /* Origin/raw are always defined as stage 0 even after a save. */
  current_stage=0;
}

References mspass::utility::ErrorLogger::log_error().

set_id()

void mspass::utility::ProcessingHistory::set_id

(

const std::string

newid

)

Set the uuid manually.

It may occasionally be necessary to create a uuid by some other mechanism. This allows that, but this method should be used with caution and only if you understand the consequences.

Parameters

newid

is string definition to use for the id.

{
  this->current_id=newid;
}

References newid().

stage()

int mspass::utility::ProcessingHistory::stage ( ) const

inline

Return the current stage count for this object.

We maintain a counter of the number of processing steps that have been applied to produce this data object. This simple method returns that counter. With this implementation this is identical to number_of_stages. We retain it in the API in the event we want to implement an accumulating counter.

  {
    return current_stage;
  };

status()

ProcessingStatus mspass::utility::ProcessingHistory::status ( ) const

inline

Return the current status definition (an enum).

  {
    return current_status;
  };

---

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

• /home/runner/work/mspass/mspass/cxx/include/mspass/utility/ProcessingHistory.h
• /home/runner/work/mspass/mspass/cxx/src/lib/utility/ProcessingHistory.cc