/Users/barrand/private/dev/softinex/old/inexlib-1.2/inlib/inlib/sg/group

Go to the documentation of this file.

// Copyright (C) 2010, Guy Barrand. All rights reserved.
// See the file inlib.license for terms.

#ifndef inlib_sg_group
#define inlib_sg_group

#include <vector>

#include "node"

#include "pick_action"
#include "bbox_action"
#include "event_action"

namespace inlib {
namespace sg {

class group : public node {
public:
  static const std::string& s_class() {
    static const std::string s_v("inlib::sg::group");
    return s_v;
  }
public:
  virtual void* cast(const std::string& a_class) const {
    if(void* p = inlib::cmp_cast<group>(this,a_class)) {return p;}
    return node::cast(a_class);
  }
public: //node
  virtual node* copy() const {return new group(*this);}
  virtual const std::string& s_cls() const {return s_class();}
public:
  virtual void render(render_action& a_action) {
    std::vector<node*>::iterator it;
    for(it=m_children.begin();it!=m_children.end();++it) {
      (*it)->render(a_action);
    }    
  }
  virtual void pick(pick_action& a_action) {
    std::vector<node*>::iterator it;
    for(it=m_children.begin();it!=m_children.end();++it) {
      (*it)->pick(a_action);
      if(a_action.done()) break;
    }    
  }
  virtual void bbox(bbox_action& a_action) {
    std::vector<node*>::iterator it;
    for(it=m_children.begin();it!=m_children.end();++it) {
      (*it)->bbox(a_action);
    }
  }
  virtual void event(event_action& a_action) {
    std::vector<node*>::iterator it;
    for(it=m_children.begin();it!=m_children.end();++it) {
      (*it)->event(a_action);
      //if(a_action.handled()) break; //do not stop if handled.
    }
  }
  virtual void search(search_action& a_action) {
    std::vector<node*>::iterator it;
    for(it=m_children.begin();it!=m_children.end();++it) {
      (*it)->search(a_action);
      if(a_action.done()) break;
    }
  }
  virtual bool write(write_action& a_action) {
    if(!a_action.beg_node(*this)) return false;
    if(!write_children(a_action)) return false;
    if(!a_action.end_node(*this)) return false;
    return true;
  }
public:
  group(){}
  virtual ~group(){clear();}
public:
  group(const group& a_from)
  :node(a_from)
  {
    std::vector<node*>::const_iterator it;
    for(it=a_from.m_children.begin();it!=a_from.m_children.end();++it) {
      m_children.push_back((*it)->copy());
    }    
  }
  group& operator=(const group& a_from){
    node::operator=(a_from);
    clear();
    std::vector<node*>::const_iterator it;
    for(it=a_from.m_children.begin();it!=a_from.m_children.end();++it) {
      m_children.push_back((*it)->copy());
    }    
    return *this;
  }
public:
  void add(node* a_node) {
    //WARNING :  take ownership of a_node.
    m_children.push_back(a_node);
  }
  void set(unsigned a_index,node* a_node) {
    //WARNING :  take ownership of a_node.
    //WARNING : no check is done on a_index.
    m_children[a_index] = a_node;
  }
/*
  void remove(node* a_node){
    //NOTE : no delete on a_node is performed.
    std::vector<node*>::iterator it;
    for(it=m_children.begin();it!=m_children.end();) {
      if(a_node==(*it)) {
        it = m_children.erase(it);
      } else {
        ++it;
      }
    }
  }
  bool is_in(node* a_node){
    std::vector<node*>::iterator it;
    for(it=m_children.begin();it!=m_children.end();++it) {
      if(a_node==(*it)) return true;
    }
    return false;
  }
*/
  void clear(){
    std::vector<node*>::iterator it;
    for(it=m_children.begin();it!=m_children.end();) {
      node* child = *it;
      it = m_children.erase(it);
      delete child;
    }    
    m_children.clear();
  }
  unsigned int size() const {return m_children.size();}
  bool empty() const {return m_children.size()?false:true;}
  node* operator[](unsigned int a_index) const{
    //WARNING : no check is done on a_index.
    return m_children[a_index];    
  }
  const std::vector<node*>& children() const {return m_children;}
protected:
  bool write_children(write_action& a_action) {
    std::vector<node*>::iterator it;
    for(it=m_children.begin();it!=m_children.end();++it) {
      if(!(*it)->write(a_action)) return false;
    }
    return true;
  }
protected:
  std::vector<node*> m_children;
};

}}

#endif