File: gdcmSorter.h

package info (click to toggle)
gdcm 3.0.21-1
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 26,880 kB
  • sloc: cpp: 203,477; ansic: 78,582; xml: 48,129; python: 3,459; cs: 2,308; java: 1,629; lex: 1,290; sh: 334; php: 128; makefile: 117
file content (87 lines) | stat: -rw-r--r-- 2,609 bytes parent folder | download | duplicates (3)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
/*=========================================================================

  Program: GDCM (Grassroots DICOM). A DICOM library

  Copyright (c) 2006-2011 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 GDCMSORTER_H
#define GDCMSORTER_H

#include "gdcmDirectory.h"
#include "gdcmTag.h"

#include <vector>
#include <string>
#include <map>
#include <set>

namespace gdcm
{
class DataSet;

/**
 * \brief Sorter
 * \details General class to do sorting using a custom function
 * You simply need to provide a function of type: Sorter::SortFunction
 *
 * \warning implementation details. For now there is no cache mechanism. Which means
 * that every time you call Sort, all files specified as input parameter are *read*
 *
 * \see Scanner
 */
class GDCM_EXPORT Sorter
{
  friend std::ostream& operator<<(std::ostream &_os, const Sorter &s);
public:
  Sorter();
  virtual ~Sorter();

  /// Typically the output of Directory::GetFilenames()
  virtual bool Sort(std::vector<std::string> const & filenames);

  /// Return the list of filenames as sorted by the specific algorithm used.
  /// Empty by default (before Sort() is called)
  const std::vector<std::string> &GetFilenames() const { return Filenames; }

  /// Print
  void Print(std::ostream &os) const;

  /// UNSUPPORTED FOR NOW
  bool AddSelect( Tag const &tag, const char *value );

  /// Specify a set of tags to be read in during the sort procedure.
  /// By default this set is empty, in which case the entire image,
  /// including pixel data, is read in.
  void SetTagsToRead( std::set<Tag> const & tags );

  /// Set the sort function which compares one dataset to the other
  typedef bool (*SortFunction)(DataSet const &, DataSet const &);
  void SetSortFunction( SortFunction f );

  virtual bool StableSort(std::vector<std::string> const & filenames);

protected:
  std::vector<std::string> Filenames;
  typedef std::map<Tag,std::string> SelectionMap;
  std::map<Tag,std::string> Selection;
  SortFunction SortFunc;
  std::set<Tag> TagsToRead;
};
//-----------------------------------------------------------------------------
inline std::ostream& operator<<(std::ostream &os, const Sorter &s)
{
  s.Print( os );
  return os;
}


} // end namespace gdcm

#endif //GDCMSORTER_H