/home/amesfoort/DAL/dal/hdf5/Group.h

/* Copyright 2011-2012  ASTRON, Netherlands Institute for Radio Astronomy
 * This file is part of the Data Access Library (DAL).
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either 
 * version 3 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public 
 * License along with this library.  If not, see <http://www.gnu.org/licenses/>.
 */
#ifndef DAL_GROUP_H
#define DAL_GROUP_H

#include <string>
#include <vector>
#include <map>
#include <hdf5.h>
#include "types/implicitdowncast.h"
#include "Node.h"
#include "Attribute.h"

namespace dal {

class Group: public Node {
public:
  Group();

  Group( Group &parent, const std::string &name );

  Group( const Group &other );

  virtual ~Group();

  Group& operator=(Group rhs);

  friend void swap(Group& first, Group& second);

  virtual Group& create();

  virtual bool exists() const;

  void remove() const;

  void set( const Group &other, bool deepcopy );

  Attribute<std::string> groupType();

  std::vector<std::string> nodeNames();

#ifndef SWIG

  ImplicitDowncast<Node> getNode( const std::string &name );

#endif

protected:
  hid_gc _group;


  friend Node::Node( Group &parent, const std::string &name );
  const hid_gc &group(); // protected w/ friend above to keep hid_gc inside DAL

  virtual void initNodes();

  void addNode( Node *attr );

  std::vector<std::string> memberNames();

  Group( const hid_gc &fileId, FileInfo fileInfo );

private:
  std::map<std::string, Node*> nodeMap;

  virtual void open( hid_t parent, const std::string &name );

  void freeNodeMap();
};

}

#endif