HsSchemaVector Class Reference

Collaboration diagram for HsSchemaVector:

Public Member Functions
	~HsSchemaVector ()
HsSchema *	operator[] (int index) const
size_t	size () const
void	add (HsSchema *s)
void	clear ()
void	print (bool print_tags=true) const
HsSchema *	find_event (const char *event_name, const time_t timestamp, int debug=0)

Protected Attributes
std::vector< HsSchema * >	fData

Detailed Description

Definition at line 448 of file history_schema.cxx.

Constructor & Destructor Documentation

~HsSchemaVector()

HsSchemaVector::~HsSchemaVector ( )

inline

Definition at line 454 of file history_schema.cxx.

                     { // dtor
      clear();
   }

Here is the call graph for this function:

Member Function Documentation

add()

void HsSchemaVector::add

(

HsSchema *

s

)

Definition at line 503 of file history_schema.cxx.

{
   // schema list "data" is sorted by decreasing "fTimeFrom", newest schema first
 
   //printf("add: %s..%s %s\n", TimeToString(s->fTimeFrom).c_str(), TimeToString(s->fTimeTo).c_str(), s->fEventName.c_str());
 
   bool added = false;
 
   for (auto it = fData.begin(); it != fData.end(); it++) {
      if (event_name_cmp((*it)->fEventName, s->fEventName.c_str())==0) {
         if (s->fTimeFrom == (*it)->fTimeFrom) {
            // duplicate schema, keep the last one added (for file schema it is the newer file)
            s->fTimeTo = (*it)->fTimeTo;
            delete (*it);
            (*it) = s;
            return;
         }
      }
 
      if (s->fTimeFrom > (*it)->fTimeFrom) {
         fData.insert(it, s);
         added = true;
         break;
      }
   }
 
   if (!added) {
      fData.push_back(s);
   }
 
   //time_t oldest_time_from = fData.back()->fTimeFrom;
 
   time_t time_to = 0;
 
   for (auto it = fData.begin(); it != fData.end(); it++) {
      if (event_name_cmp((*it)->fEventName, s->fEventName.c_str())==0) {
         (*it)->fTimeTo = time_to;
         time_to = (*it)->fTimeFrom;
 
         //printf("vvv: %s..%s %s\n", TimeToString((*it)->fTimeFrom-oldest_time_from).c_str(), TimeToString((*it)->fTimeTo-oldest_time_from).c_str(), (*it)->fEventName.c_str());
      }
   }
}

Here is the call graph for this function:

Here is the caller graph for this function:

clear()

void HsSchemaVector::clear ( )

inline

Definition at line 468 of file history_schema.cxx.

                {
      for (size_t i=0; i<fData.size(); i++)
         if (fData[i]) {
            delete fData[i];
            fData[i] = NULL;
         }
      fData.clear();
   }

Here is the call graph for this function:

Here is the caller graph for this function:

find_event()

HsSchema * HsSchemaVector::find_event	(	const char *	event_name,
		const time_t	timestamp,
		int	debug = 0
	)

Definition at line 547 of file history_schema.cxx.

{
   HsSchema* ss = NULL;
 
   if (debug) {
      printf("find_event: All schema for event %s: (total %zu)\n", event_name, fData.size());
      int found = 0;
      for (size_t i=0; i<fData.size(); i++) {
         HsSchema* s = fData[i];
         printf("find_event: schema %zu name [%s]\n", i, s->fEventName.c_str());
         if (event_name)
            if (event_name_cmp(s->fEventName, event_name)!=0)
               continue;
         s->print();
         found++;
      }
      printf("find_event: Found %d schemas for event %s\n", found, event_name);
 
      //if (found == 0)
      //   abort();
   }
 
   for (size_t i=0; i<fData.size(); i++) {
      HsSchema* s = fData[i];
 
      // wrong event
      if (event_name)
         if (event_name_cmp(s->fEventName, event_name)!=0)
            continue;
 
      // schema is from after the time we are looking for
      if (s->fTimeFrom > t)
         continue;
 
      if (!ss)
         ss = s;
 
      // remember the newest schema
      if (s->fTimeFrom > ss->fTimeFrom)
         ss = s;
   }
 
   // try to find
   for (size_t i=0; i<fData.size(); i++) {
      HsSchema* s = fData[i];
 
      // wrong event
      if (event_name)
         if (event_name_cmp(s->fEventName, event_name)!=0)
            continue;
 
      // schema is from after the time we are looking for
      if (s->fTimeFrom > t)
         continue;
 
      if (!ss)
         ss = s;
 
      // remember the newest schema
      if (s->fTimeFrom > ss->fTimeFrom)
         ss = s;
   }
 
   if (debug) {
      if (ss) {
         printf("find_event: for time %s, returning:\n", TimeToString(t).c_str());
         ss->print();
      } else {
         printf("find_event: for time %s, nothing found:\n", TimeToString(t).c_str());
      }
   }
 
   return ss;
}

Here is the call graph for this function:

Here is the caller graph for this function:

operator[]()

HsSchema * HsSchemaVector::operator[] ( int  index ) const

inline

Definition at line 458 of file history_schema.cxx.

                                         {
      return fData[index];
   }

print()

void HsSchemaVector::print ( bool  print_tags = true ) const

inline

Definition at line 477 of file history_schema.cxx.

                                            {
      for (size_t i=0; i<fData.size(); i++)
         fData[i]->print(print_tags);
   }

Here is the call graph for this function:

Here is the caller graph for this function:

size()

size_t HsSchemaVector::size ( ) const

inline

Definition at line 462 of file history_schema.cxx.

                       {
      return fData.size();
   }

Here is the caller graph for this function:

Member Data Documentation

fData

std::vector<HsSchema*> HsSchemaVector::fData

protected

Definition at line 451 of file history_schema.cxx.

---

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

• src/history_schema.cxx