dunedaq::oks::OksIndex Class Reference

#include <index.hpp>

Inheritance diagram for dunedaq::oks::OksIndex:

Collaboration diagram for dunedaq::oks::OksIndex:

Classes
struct	SortByName

Public Types
typedef std::map< const OksAttribute *, OksIndex *, SortByName >	Map
typedef std::multiset< OksObject *, OksObjectSortBy >::iterator	Position
typedef std::multiset< OksObject *, OksObjectSortBy >::const_iterator	ConstPosition

Public Member Functions
	OksIndex (OksClass *, OksAttribute *)
	~OksIndex ()
OksObject *	FindFirst (OksData *d) const
OksObject::List *	FindEqual (OksData *d) const
OksObject::List *	FindLessEqual (OksData *d) const
OksObject::List *	FindGreatEqual (OksData *d) const
OksObject::List *	FindLess (OksData *d) const
OksObject::List *	FindGreat (OksData *d) const
OksObject::List *	FindLessAndGreat (OksData *d1, OksData *d2) const
OksObject::List *	FindLessAndGreatEqual (OksData *d1, OksData *d2) const
OksObject::List *	FindLessEqualAndGreat (OksData *d1, OksData *d2) const
OksObject::List *	FindLessEqualAndGreatEqual (OksData *d1, OksData *d2) const
OksObject::List *	FindEqualAndEqual (OksData *d1, OksData *d2) const
OksObject::List *	FindEqualAndLess (OksData *d1, OksData *d2) const
OksObject::List *	FindEqualAndLessEqual (OksData *d1, OksData *d2) const
OksObject::List *	FindEqualAndGreat (OksData *d1, OksData *d2) const
OksObject::List *	FindEqualAndGreatEqual (OksData *d1, OksData *d2) const
OksObject::List *	FindLessOrGreat (OksData *d1, OksData *d2) const
OksObject::List *	FindLessOrGreatEqual (OksData *d1, OksData *d2) const
OksObject::List *	FindLessEqualOrGreat (OksData *d1, OksData *d2) const
OksObject::List *	FindLessEqualOrGreatEqual (OksData *d1, OksData *d2) const
OksObject::List *	FindEqualOrEqual (OksData *d1, OksData *d2) const
OksObject::List *	FindEqualOrLess (OksData *d1, OksData *d2) const
OksObject::List *	FindEqualOrLessEqual (OksData *d1, OksData *d2) const
OksObject::List *	FindEqualOrGreat (OksData *d1, OksData *d2) const
OksObject::List *	FindEqualOrGreatEqual (OksData *d1, OksData *d2) const

Private Member Functions
OksObject *	remove_obj (OksObject *)
OksObject::List *	find_all (OksData *, OksQuery::Comparator) const
OksObject::List *	find_all (bool, OksData *, OksQuery::Comparator, OksData *, OksQuery::Comparator) const
void	find_interval (OksData *, OksQuery::Comparator, ConstPosition &, ConstPosition &) const

Static Private Member Functions
static size_t	get_offset (OksClass *, OksAttribute *)

Private Attributes
OksClass *	c
OksAttribute *	a
size_t	offset

Friends
class	OksClass
class	OksObject

Detailed Description

Definition at line 35 of file index.hpp.

Member Typedef Documentation

ConstPosition

typedef std::multiset<OksObject*,OksObjectSortBy>::const_iterator dunedaq::oks::OksIndex::ConstPosition

Definition at line 53 of file index.hpp.

Map

typedef std::map<const OksAttribute *, OksIndex *, SortByName> dunedaq::oks::OksIndex::Map

Definition at line 50 of file index.hpp.

Position

typedef std::multiset<OksObject*,OksObjectSortBy>::iterator dunedaq::oks::OksIndex::Position

Definition at line 52 of file index.hpp.

Constructor & Destructor Documentation

OksIndex()

dunedaq::oks::OksIndex::OksIndex	(	OksClass *	cl,
		OksAttribute *	attr )

Definition at line 23 of file index.cpp.

                                                   :
  std::multiset<OksObject *, OksObjectSortBy> (get_offset(cl, attr)),
  c (cl),
  a (attr)
{
  const char * fname = "OksIndex::OksIndex(OksClass *, OksAttribute *";
 
  if(!c) {
    Oks::error_msg(fname) << "Can't build index for NIL class\n";
    return;
  }
  
  if(c->get_is_abstract()) {
    Oks::error_msg(fname)
      << "Can't build index for ABSTRACT class \"" << c->get_name() << "\"\n";
    return;
  }
 
  if(!a) {
    Oks::error_msg(fname) << "Can't build index for NIL attribute\n";
    return;
  }
 
  if(c->find_attribute(a->get_name()) == 0) {
    Oks::error_msg(fname)
      << "Can't find attribute \"" << a->p_name << "\" in class \""
      << c->get_name() << "\" to build index.\n";
    return;
  }
 
  if(c->p_indices && c->p_indices->find(a) != c->p_indices->end()) {
    Oks::error_msg(fname)
      << "Class \"" << c->get_name() << "\" already has index for attribute \""
      << a->p_name << "\".\n";
    return;
  }
 
  offset = ((*c->p_data_info)[a->p_name])->offset;
 
  if(!c->p_indices)
    c->p_indices = new OksIndex::Map();
 
  (*c->p_indices)[a] = this;
 
  if(c->p_objects && !c->p_objects->empty()) {
    for(OksObject::Map::iterator i = c->p_objects->begin(); i != c->p_objects->end(); ++i)
      insert((*i).second);
  }
  
  std::cout << "Build index for attribute \'" << a->p_name << "\' in class \'" << c->get_name()
        << "\' for " << size() << " instances\n";
 
#ifdef DEBUG_INDICES
  for(int j=0; j<entries(); j++) {
    OksObject *obj = at(j);
 
    std::cout << j << ".\tobject id \'" << obj->GetId() << "\'   "
          << "\tvalue: \'" << obj->data[offset] << "\'\n";
  }
#endif
}

~OksIndex()

dunedaq::oks::OksIndex::~OksIndex

(

)

Definition at line 85 of file index.cpp.

{
  if(c && a) {
    c->p_indices->erase(a);
 
    if(c->p_indices->empty()) {
      delete c->p_indices;
      c->p_indices = 0;
    }
  }
}

Member Function Documentation

find_all() [1/2]

OksObject::List * dunedaq::oks::OksIndex::find_all ( bool andOperation, OksData * d1, OksQuery::Comparator f1, OksData * d2, OksQuery::Comparator f2 ) const

private

Definition at line 192 of file index.cpp.

{
  OksObject::List * olist = 0;
  
  ConstPosition a1, b1;
  
  find_interval(d1, f1, a1, b1);
  
  if((andOperation == true) && (a1 == b1)) return 0;
  
  ConstPosition a2, b2;
 
  find_interval(d2, f2, a2, b2);
 
  if(andOperation == true) { 
    if(a2 == b2) return 0;
 
 
      //
      // find intersection ([pos1,pos2] or NIL) of [a1,b1] and [a2,b2]
      // where begin() <= {a1,b1,a2,b2} <= end())
      //
      // (note that a1 and a2 are not equal to end() but b1 nad b2 have to be tested)
      //
 
    ConstPosition pos1, pos2;
 
    if((*a2)->data[offset] <= (*a1)->data[offset]) {
      if((b2 != end()) && ((*b2)->data[offset] < (*a1)->data[offset])) return 0;
      pos1 = a1;
    }
    else {
      if((b1 != end()) && (*a2)->data[offset] > (*b1)->data[offset]) return 0;
      pos1 = a2;
    }
    
    if(b2 == end() || b1 == end()) {
      pos2 = (b2 != end()) ? b2 : b1;
    }
    else
      pos2 = ((*b2)->data[offset] <= (*b1)->data[offset]) ? b2 : b1;
 
    olist = new OksObject::List();
    for(;pos1 != pos2; ++pos1) olist->push_back(*pos1);
  }
  else {
    if(a1 != b1 && a2 == b2) {
      olist = new OksObject::List();
      for(;a1 != b1; ++a1) olist->push_back(*a1);
    }
    else if(a2 != b2 && a1 == b1) {
      olist = new OksObject::List();
      for(;a2 != b2; ++a2) olist->push_back(*a2);
    }
    else if(a1 != b1 && a2 != b2) {
      olist = new OksObject::List();
 
 
        //
        // find union of [a1,b1] and [a2,b2] (i.e. [pos1,pos2] or [a1,b1],[a2,b2])
    // where begin() <= {a1,b1,a2,b2} <= end())
        //
        // (note that a1 and a2 are not equal to end() but b1 nad b2 have to be tested)
        //
 
      ConstPosition pos1, pos2;
 
      if((*a2)->data[offset] <= (*a1)->data[offset]) {
        if(b2 != end() && (*b2)->data[offset] < (*a1)->data[offset]) {
          for(;a2 != b2; ++a2) olist->push_back(*a2);
          for(;a1 != b1; ++a1) olist->push_back(*a1);
 
          return olist;
        }
 
        pos1 = a2;
      }
      else {
        if(b1 != end() && (*a2)->data[offset] > (*b1)->data[offset]) {
          for(;a1 != b1; ++a1) olist->push_back(*a1);
          for(;a2 != b2; ++a2) olist->push_back(*a2);
 
          return olist;
        }
        
        pos1 = a1;
      }
 
      if(b2 == end() || b1 == end()) {
    pos2 = (b2 == end()) ? b2 : b1;
      }
      else
        pos2 = ((*b2)->data[offset] >= (*b1)->data[offset]) ? b2 : b1;
 
      for(;pos1 != pos2; ++pos1) olist->push_back(*pos1);
    }
  }
 
  return olist;
}

find_all() [2/2]

OksObject::List * dunedaq::oks::OksIndex::find_all ( OksData * d, OksQuery::Comparator f ) const

private

Definition at line 174 of file index.cpp.

{
  OksObject::List * olist = 0;
 
  ConstPosition pos1, pos2;
 
  find_interval(d, f, pos1, pos2);
 
  if(pos1 != pos2) {
    olist = new OksObject::List();
    for(;pos1 != pos2; ++pos1) olist->push_back(*pos1);
  }
 
  return olist;
}

find_interval()

void dunedaq::oks::OksIndex::find_interval ( OksData * d, OksQuery::Comparator f, ConstPosition & i1, ConstPosition & i2 ) const

private

Definition at line 130 of file index.cpp.

{
  i1 = i2 = end();
 
  if(empty()) return;
 
  OksObject test_o(offset, d);
 
  if(f == OksQuery::equal_cmp) {
    i1 = lower_bound(&test_o);
 
    if(i1 != end()) {
      if((*i1)->data[offset] == *d) {
        i2 = upper_bound(&test_o);
      }
      else {
        i2 = i1;
      }
    }
  }
  else if(f == OksQuery::less_or_equal_cmp || f == OksQuery::less_cmp) {
    i1 = begin();
 
    if(f == OksQuery::less_cmp) {
      i2 = lower_bound(&test_o);
    }
    else {
      i2 = upper_bound(&test_o);
    }
  }
  else if(f == OksQuery::greater_or_equal_cmp || f == OksQuery::greater_cmp) {
    i2 = end();
    
    if(f == OksQuery::greater_cmp) {
      i1 = upper_bound(&test_o);
    }
    else {
      i1 = lower_bound(&test_o);
    }
  }
}

FindEqual()

OksObject::List * dunedaq::oks::OksIndex::FindEqual ( OksData * d ) const

inline

Definition at line 61 of file index.hpp.

{return find_all(d, OksQuery::equal_cmp);}

FindEqualAndEqual()

OksObject::List * dunedaq::oks::OksIndex::FindEqualAndEqual ( OksData * d1, OksData * d2 ) const

inline

Definition at line 71 of file index.hpp.

{return find_all(true, d1, OksQuery::equal_cmp, d2, OksQuery::equal_cmp);}

FindEqualAndGreat()

OksObject::List * dunedaq::oks::OksIndex::FindEqualAndGreat ( OksData * d1, OksData * d2 ) const

inline

Definition at line 74 of file index.hpp.

{return find_all(true, d1, OksQuery::equal_cmp, d2, OksQuery::greater_cmp);}

FindEqualAndGreatEqual()

OksObject::List * dunedaq::oks::OksIndex::FindEqualAndGreatEqual ( OksData * d1, OksData * d2 ) const

inline

Definition at line 75 of file index.hpp.

{return find_all(true, d1, OksQuery::equal_cmp, d2, OksQuery::greater_or_equal_cmp);}

FindEqualAndLess()

OksObject::List * dunedaq::oks::OksIndex::FindEqualAndLess ( OksData * d1, OksData * d2 ) const

inline

Definition at line 72 of file index.hpp.

{return find_all(true, d1, OksQuery::equal_cmp, d2, OksQuery::less_cmp);}

FindEqualAndLessEqual()

OksObject::List * dunedaq::oks::OksIndex::FindEqualAndLessEqual ( OksData * d1, OksData * d2 ) const

inline

Definition at line 73 of file index.hpp.

{return find_all(true, d1, OksQuery::equal_cmp, d2, OksQuery::less_or_equal_cmp);}

FindEqualOrEqual()

OksObject::List * dunedaq::oks::OksIndex::FindEqualOrEqual ( OksData * d1, OksData * d2 ) const

inline

Definition at line 80 of file index.hpp.

{return find_all(false, d1, OksQuery::equal_cmp, d2, OksQuery::equal_cmp);}

FindEqualOrGreat()

OksObject::List * dunedaq::oks::OksIndex::FindEqualOrGreat ( OksData * d1, OksData * d2 ) const

inline

Definition at line 83 of file index.hpp.

{return find_all(false, d1, OksQuery::equal_cmp, d2, OksQuery::greater_cmp);}

FindEqualOrGreatEqual()

OksObject::List * dunedaq::oks::OksIndex::FindEqualOrGreatEqual ( OksData * d1, OksData * d2 ) const

inline

Definition at line 84 of file index.hpp.

{return find_all(false, d1, OksQuery::equal_cmp, d2, OksQuery::greater_or_equal_cmp);}

FindEqualOrLess()

OksObject::List * dunedaq::oks::OksIndex::FindEqualOrLess ( OksData * d1, OksData * d2 ) const

inline

Definition at line 81 of file index.hpp.

{return find_all(false, d1, OksQuery::equal_cmp, d2, OksQuery::less_cmp);}

FindEqualOrLessEqual()

OksObject::List * dunedaq::oks::OksIndex::FindEqualOrLessEqual ( OksData * d1, OksData * d2 ) const

inline

Definition at line 82 of file index.hpp.

{return find_all(false, d1, OksQuery::equal_cmp, d2, OksQuery::less_or_equal_cmp);}

FindFirst()

OksObject * dunedaq::oks::OksIndex::FindFirst

(

OksData *

d

)

const

Definition at line 117 of file index.cpp.

{
  OksObject test_o(offset, d);
 
  ConstPosition pos = lower_bound(&test_o);
 
  if(pos != end()) return *pos;
 
  return 0;
}

FindGreat()

OksObject::List * dunedaq::oks::OksIndex::FindGreat ( OksData * d ) const

inline

Definition at line 65 of file index.hpp.

{return find_all(d, OksQuery::greater_cmp);}

FindGreatEqual()

OksObject::List * dunedaq::oks::OksIndex::FindGreatEqual ( OksData * d ) const

inline

Definition at line 63 of file index.hpp.

{return find_all(d, OksQuery::greater_or_equal_cmp);}

FindLess()

OksObject::List * dunedaq::oks::OksIndex::FindLess ( OksData * d ) const

inline

Definition at line 64 of file index.hpp.

{return find_all(d, OksQuery::less_cmp);}

FindLessAndGreat()

OksObject::List * dunedaq::oks::OksIndex::FindLessAndGreat ( OksData * d1, OksData * d2 ) const

inline

Definition at line 67 of file index.hpp.

{return find_all(true, d1, OksQuery::less_cmp, d2, OksQuery::greater_cmp);}

FindLessAndGreatEqual()

OksObject::List * dunedaq::oks::OksIndex::FindLessAndGreatEqual ( OksData * d1, OksData * d2 ) const

inline

Definition at line 68 of file index.hpp.

{return find_all(true, d1, OksQuery::less_cmp, d2, OksQuery::greater_or_equal_cmp);}

FindLessEqual()

OksObject::List * dunedaq::oks::OksIndex::FindLessEqual ( OksData * d ) const

inline

Definition at line 62 of file index.hpp.

{return find_all(d, OksQuery::less_or_equal_cmp);}

FindLessEqualAndGreat()

OksObject::List * dunedaq::oks::OksIndex::FindLessEqualAndGreat ( OksData * d1, OksData * d2 ) const

inline

Definition at line 69 of file index.hpp.

{return find_all(true, d1, OksQuery::less_or_equal_cmp, d2, OksQuery::greater_cmp);}

FindLessEqualAndGreatEqual()

OksObject::List * dunedaq::oks::OksIndex::FindLessEqualAndGreatEqual ( OksData * d1, OksData * d2 ) const

inline

Definition at line 70 of file index.hpp.

{return find_all(true, d1, OksQuery::less_or_equal_cmp, d2, OksQuery::greater_or_equal_cmp);}

FindLessEqualOrGreat()

OksObject::List * dunedaq::oks::OksIndex::FindLessEqualOrGreat ( OksData * d1, OksData * d2 ) const

inline

Definition at line 78 of file index.hpp.

{return find_all(false, d1, OksQuery::less_or_equal_cmp, d2, OksQuery::greater_cmp);}

FindLessEqualOrGreatEqual()

OksObject::List * dunedaq::oks::OksIndex::FindLessEqualOrGreatEqual ( OksData * d1, OksData * d2 ) const

inline

Definition at line 79 of file index.hpp.

{return find_all(false, d1, OksQuery::less_or_equal_cmp, d2, OksQuery::greater_or_equal_cmp);}

FindLessOrGreat()

OksObject::List * dunedaq::oks::OksIndex::FindLessOrGreat ( OksData * d1, OksData * d2 ) const

inline

Definition at line 76 of file index.hpp.

{return find_all(false, d1, OksQuery::less_cmp, d2, OksQuery::greater_cmp);}

FindLessOrGreatEqual()

OksObject::List * dunedaq::oks::OksIndex::FindLessOrGreatEqual ( OksData * d1, OksData * d2 ) const

inline

Definition at line 77 of file index.hpp.

{return find_all(false, d1, OksQuery::less_cmp, d2, OksQuery::greater_or_equal_cmp);}

get_offset()

size_t dunedaq::oks::OksIndex::get_offset ( OksClass * cl, OksAttribute * a )

staticprivate

Definition at line 16 of file index.cpp.

{
  OksDataInfo::Map::const_iterator x = cl->p_data_info->find(a->p_name);
  return (x == cl->p_data_info->end()) ? 0 : x->second->offset;
}

remove_obj()

OksObject * dunedaq::oks::OksIndex::remove_obj ( OksObject * o )

private

Definition at line 99 of file index.cpp.

{
  std::pair<Position, Position> positions = equal_range(o);
  Position i = positions.first;
  Position i2 = positions.second;
 
  for(; i != i2; ++i) {
    if(o == *i) {
      erase(i);
      return o;
    }
  }
 
  return 0;
}

Friends And Related Symbol Documentation

OksClass

friend class OksClass

friend

Definition at line 36 of file index.hpp.

OksObject

friend class OksObject

friend

Definition at line 37 of file index.hpp.

Member Data Documentation

a

OksAttribute* dunedaq::oks::OksIndex::a

private

Definition at line 89 of file index.hpp.

c

OksClass* dunedaq::oks::OksIndex::c

private

Definition at line 88 of file index.hpp.

offset

size_t dunedaq::oks::OksIndex::offset

private

Definition at line 90 of file index.hpp.

---

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

• /github/workspace/dunedaq/sourcecode/oks/include/oks/index.hpp
• /github/workspace/dunedaq/sourcecode/oks/src/index.cpp