Logo Search packages:      
Sourcecode: gdcm version File versions  Download package

gdcmModule.h

/*=========================================================================

  Program: GDCM (Grassroots DICOM). A DICOM library
  Module:  $URL$

  Copyright (c) 2006-2009 Mathieu Malaterre
  All rights reserved.
  See Copyright.txt or http://gdcm.sourceforge.net/Copyright.html for details.

     This software is distributed WITHOUT ANY WARRANTY; without even
     the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
     PURPOSE.  See the above copyright notice for more information.

=========================================================================*/
#ifndef __gdcmModule_h
#define __gdcmModule_h

#include "gdcmTypes.h"
#include "gdcmTag.h"
#include "gdcmModuleEntry.h"

#include <map>

namespace gdcm
{

class DataSet;
class Usage;
/**
 * \brief Class for representing a Module
 * \note bla
 * Module: A set of Attributes within an Information Entity or Normalized IOD which
 * are logically related to each other.
 * \sa Dict
 */
00036 class GDCM_EXPORT Module
{
public:
  typedef std::map<Tag, ModuleEntry> MapModuleEntry;
  typedef MapModuleEntry::const_iterator ConstIterator;
  typedef MapModuleEntry::iterator Iterator;
  ConstIterator Begin() const { return ModuleInternal.begin(); }
  Iterator Begin() { return ModuleInternal.begin(); }
  ConstIterator End() const { return ModuleInternal.end(); }
  Iterator End() { return ModuleInternal.end(); }

  Module() {}
  friend std::ostream& operator<<(std::ostream& _os, const Module &_val);

  void Clear() { ModuleInternal.clear(); }

  void AddModuleEntry(const Tag& tag, const ModuleEntry & module )
    {
    ModuleInternal.insert(
      MapModuleEntry::value_type(tag, module));
    }
  bool FindModuleEntry(const Tag &tag) const 
    {
    MapModuleEntry::const_iterator it = ModuleInternal.find(tag);
    return it != ModuleInternal.end();
    }
  const ModuleEntry& GetModuleEntry(const Tag &tag) const 
    {
    MapModuleEntry::const_iterator it = ModuleInternal.find(tag);
    assert( it->first == tag );
    return it->second;
    }
  void SetName( const char *name) { Name = name; }
  const char *GetName() const { return Name.c_str(); }

  // Verify will print on std::cerr for error
  // Upon success will return true, false otherwise
  bool Verify(const DataSet& ds, Usage const & usage) const;

private:
  //Module &operator=(const Module &_val); // purposely not implemented
  //Module(const Module &_val); // purposely not implemented

  MapModuleEntry ModuleInternal;
  std::string Name;
};
//-----------------------------------------------------------------------------
inline std::ostream& operator<<(std::ostream& _os, const Module &_val)
{
  Module::MapModuleEntry::const_iterator it = _val.ModuleInternal.begin();
  for(;it != _val.ModuleInternal.end(); ++it)
    {
    const Tag &t = it->first;
    const ModuleEntry &de = it->second;
    _os << t << " " << de << '\n';
    }

  return _os;
}

typedef Module Macro;
//class GDCM_EXPORT Macro : public Module {};

} // end namespace gdcm

#endif //__gdcmModule_h


Generated by  Doxygen 1.6.0   Back to index