File: itkIPLFileNameList.cxx

package info (click to toggle)
insighttoolkit 3.6.0-3
  • links: PTS
  • area: main
  • in suites: lenny
  • size: 94,956 kB
  • ctags: 74,981
  • sloc: cpp: 355,621; ansic: 195,070; fortran: 28,713; python: 3,802; tcl: 1,996; sh: 1,175; java: 583; makefile: 415; csh: 184; perl: 175
file content (178 lines) | stat: -rw-r--r-- 4,743 bytes parent folder | download | duplicates (2)
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
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
/*=========================================================================

  Program:   Insight Segmentation & Registration Toolkit
  Module:    $RCSfile: itkIPLFileNameList.cxx,v $
  Language:  C++
  Date:      $Date: 2007-03-22 14:28:51 $
  Version:   $Revision: 1.9 $

  Copyright (c) Insight Software Consortium. All rights reserved.
  See ITKCopyright.txt or http://www.itk.org/HTML/Copyright.htm 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 notices for more information.

=========================================================================*/
#include <stdlib.h>
#include "itkIPLFileNameList.h"
#include <assert.h>
#include <string.h>
#include <ctype.h>

#include <list>
#include <functional>
#include <algorithm>
namespace itk
{
struct IPLFileSortInfo_ascend_compare
: public std::greater<IPLFileSortInfo *>
{
private:
  int qsort_IPLFileSortInfo_ascend_compar (IPLFileSortInfo *item1,IPLFileSortInfo *item2)
    {
    const int ImageNoDiff= item1->GetImageNumber() -  item2->GetImageNumber();
    if( ImageNoDiff < 0)
      {
      return true;
      }
    if( ImageNoDiff > 0 )
      {
      return false;
      }
    const int echoNumDiff=item1->GetEchoNumber() - item2->GetEchoNumber();
    if (echoNumDiff < 0)
      {
      return true;
      }
    else if (echoNumDiff > 0 )
      {
      return false;
      }
    const float sliceGap = item1->GetSliceLocation() - item2->GetSliceLocation();
    if (sliceGap < 0.0)
      {
      return true;
      }
    if (sliceGap > 0.0)
      {
      return false;
      }
    return (item1->GetImageFileName() < item2->GetImageFileName());
    }
public:
  bool operator()(IPLFileSortInfo *item1,IPLFileSortInfo *item2)
    {
    return qsort_IPLFileSortInfo_ascend_compar(item1,item2);
    }
};

struct IPLFileSortInfo_descend_compare  
: public std::greater<IPLFileSortInfo *>
{
private:
  int qsort_IPLFileSortInfo_descend_compar (IPLFileSortInfo *item1,  IPLFileSortInfo *item2)
    {
    const int ImageNoDiff= item1->GetImageNumber() -  item2->GetImageNumber();
    if( ImageNoDiff < 0)
      {
      return false;
      }
    if( ImageNoDiff > 0 )
      {
      return true;
      }
    const int echoNumDiff=item1->GetEchoNumber() - item2->GetEchoNumber();
    if ( echoNumDiff < 0)
      {
      return false;
      }
    if ( echoNumDiff > 0)
      {
      return true;
      }
    const float sliceGap = item1->GetSliceLocation() - item2->GetSliceLocation();
    if (sliceGap < 0.0)
      {
      return false;
      }
    if (sliceGap > 0.0)
      {
      return true;
      }
    return (item1->GetImageFileName()  >= item2->GetImageFileName());
    }
  
public:
  bool operator()(IPLFileSortInfo *item1,IPLFileSortInfo *item2)
    {
    return qsort_IPLFileSortInfo_descend_compar(item1,item2);
    }
};
 
struct IPLFileSortInfo_ascendbyname_compare  
: public std::greater<IPLFileSortInfo *>
{
public:
  bool operator()(IPLFileSortInfo *item1,IPLFileSortInfo *item2)
    {
    return (item1->GetImageFileName() < item2->GetImageFileName());
    }
};

struct IPLFileSortInfo_descendbyname_compare 
: public std::greater<IPLFileSortInfo *>
{
public:
  bool operator()(IPLFileSortInfo *item1,IPLFileSortInfo *item2)
    {
    return (item1->GetImageFileName()  >= item2->GetImageFileName());
    }
};
 

void
IPLFileNameList::
sortImageListAscend ()
{
#if 0
  IPLFileSortInfo_ascend_compare comp;
  //  qsort (fnList->Info, fnList->numImageInfoStructs, sizeof (IPLFileSortInfo),
  //         qsort_IPLFileSortInfo_ascend_compar);
  m_List.sort<IPLFileSortInfo_ascend_compare>(comp);
#else
  std::sort( m_List.begin(),m_List.end(),IPLFileSortInfo_ascend_compare() );
#endif
  return;
}

void
IPLFileNameList::
sortImageListDescend ()
{
  //  qsort (fnList->Info, fnList->numImageInfoStructs, sizeof (IPLFileSortInfo),
  //     qsort_IPLFileSortInfo_descend_compar);
#if 0
  IPLFileSortInfo_descend_compare comp;
  m_List.sort<IPLFileSortInfo_descend_compare>(comp);
#else
  std::sort(m_List.begin(),m_List.end(),IPLFileSortInfo_descend_compare());
#endif
  return;
}

void 
IPLFileNameList::
sortImageList()
{
  if (m_SortOrder == SortByNameAscend)
     std::sort( m_List.begin(),m_List.end(),IPLFileSortInfo_ascendbyname_compare() );
  else if (m_SortOrder == SortByNameDescend)
     std::sort( m_List.begin(),m_List.end(),IPLFileSortInfo_descendbyname_compare() );
  else if (m_SortOrder == SortGlobalDescend)
     std::sort( m_List.begin(),m_List.end(),IPLFileSortInfo_descend_compare() );
  else if (m_SortOrder == SortGlobalAscend)
     std::sort( m_List.begin(),m_List.end(),IPLFileSortInfo_ascend_compare() );
}

}