File: cmtkStudyList.cxx

package info (click to toggle)
cmtk 3.3.1p2%2Bdfsg-4
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 10,524 kB
  • sloc: cpp: 87,098; ansic: 23,347; sh: 3,896; xml: 1,551; perl: 707; makefile: 334
file content (240 lines) | stat: -rw-r--r-- 5,668 bytes parent folder | download | duplicates (5)
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
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
/*
//
//  Copyright 1997-2009 Torsten Rohlfing
//
//  Copyright 2004-2011, 2013 SRI International
//
//  This file is part of the Computational Morphometry Toolkit.
//
//  http://www.nitrc.org/projects/cmtk/
//
//  The Computational Morphometry Toolkit is free software: you can
//  redistribute it and/or modify it under the terms of the GNU General Public
//  License as published by the Free Software Foundation, either version 3 of
//  the License, or (at your option) any later version.
//
//  The Computational Morphometry Toolkit 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 General Public License for more details.
//
//  You should have received a copy of the GNU General Public License along
//  with the Computational Morphometry Toolkit.  If not, see
//  <http://www.gnu.org/licenses/>.
//
//  $Revision: 5436 $
//
//  $LastChangedDate: 2018-12-10 19:01:20 -0800 (Mon, 10 Dec 2018) $
//
//  $LastChangedBy: torstenrohlfing $
//
*/

#include "cmtkStudyList.h"

#include <System/cmtkConsole.h>
#include <Base/cmtkSplineWarpXform.h>

namespace
cmtk
{

/** \addtogroup IO */
//@{

const Study*
StudyList::GetStudy( const unsigned int studyIndex ) const
{
  if ( studyIndex < this->size() ) 
    {
    const_iterator it = this->begin();
    for ( unsigned int i = 0; i < studyIndex; ++i ) ++it;
    return it->first;
    } 
  else
    return NULL;
}

Study::SmartPtr
StudyList::GetStudy( const unsigned int studyIndex )
{
  if ( studyIndex < this->size() ) 
    {
    const_iterator it = this->begin();
    for ( unsigned int i = 0; i < studyIndex; ++i ) ++it;
    return it->first;
    } 
  else
    return Study::SmartPtr::Null();
}

const Study*
StudyList::FindStudyPath( const std::string& fileSystemPath ) const
{
  if ( fileSystemPath.empty() ) 
    return NULL;

  const_iterator it = this->begin();
  while ( it != this->end() ) 
    {
    if ( it->first->GetFileSystemPath() == fileSystemPath )
      return it->first;
    ++it;
    }
  
  // not found: return NULL;
  return NULL;
}

Study::SmartPtr
StudyList::FindStudyPath( const std::string& fileSystemPath, const bool create )
{
  if ( fileSystemPath.empty() ) 
    return Study::SmartPtr::Null();

  iterator it = this->begin();
  while ( it != this->end() ) 
    {
    if ( it->first->GetFileSystemPath() == fileSystemPath )
      return it->first;
    ++it;
    }
  
  // not found: return NULL or create;
  if ( !create )
    return Study::SmartPtr::Null();
  
  Study::SmartPtr newStudy( new Study );
  newStudy->SetFileSystemPath( fileSystemPath );
  this->AddStudy( newStudy );
  return newStudy;
}

const Study*
StudyList::FindStudyName( const std::string& name ) const
{
  if ( name.empty() ) 
    return NULL;

  const_iterator it = this->begin();
  while ( it != this->end() ) 
    {
    if ( it->first->GetName() == name )
      return it->first;
    ++it;
    }
  
  // not found: return NULL;
  return NULL;
}

Study::SmartPtr
StudyList::FindStudyName( const std::string& name )
{
  if ( name.empty() ) 
    return Study::SmartPtr::Null();

  iterator it = this->begin();
  while ( it != this->end() ) 
    {
    if ( it->first->GetName() == name )
      return it->first;
    ++it;
    }
  
  // not found: return NULL;
  return Study::SmartPtr::Null();
}

Study::SmartPtr
StudyList::AddStudy( const std::string& fileSystemPath )
{
  if ( fileSystemPath.empty() ) 
    return Study::SmartPtr::Null();

  const_iterator it = this->begin();
  while ( it != this->end() ) 
    {
    // if this study is already in the list, we're done.
    if ( it->first->GetFileSystemPath() == fileSystemPath )
      return Study::SmartPtr::Null();
    ++it;
    }
  
  Study::SmartPtr newStudy( Study::Read( fileSystemPath ) );
  if ( newStudy ) 
    {
    int suffix = 0;
    while ( this->FindStudyName( newStudy->GetName() ) ) {
    newStudy->SetMakeName( "", suffix++ );
    }
    
    (*this)[newStudy];
  }

  return newStudy;
}

void 
StudyList::AddStudy( Study::SmartPtr& study )
{
  if ( !study ) return;

  const std::string& newStudyPath = study->GetFileSystemPath();

  const_iterator it = this->begin();
  while ( it != this->end() ) 
    {
    // if this study is already in the list, we're done.
    if ( it->first->GetFileSystemPath() == newStudyPath )
      return;
    ++it;
    }
  
  // insert new study into map.
  (*this)[study];
}

void 
StudyList::AddXform
( const std::string& fromStudyPath, const std::string& toStudyPath, AffineXform::SmartPtr& affineXform, WarpXform::SmartPtr& warpXform )
{
  Study::SmartPtr fromStudy = this->FindStudyPath( fromStudyPath, true /*create*/ );
  Study::SmartPtr toStudy = this->FindStudyPath( toStudyPath, true /*create*/ );

  this->AddXform( fromStudy, toStudy, affineXform, warpXform );
}

void 
StudyList::AddXform
( Study::SmartPtr& fromStudy, Study::SmartPtr& toStudy, AffineXform::SmartPtr& affineXform, WarpXform::SmartPtr& warpXform )
{
  if ( !fromStudy || !toStudy ) return;

  if ( affineXform ) 
    {
    Xform::SmartPtr xform = affineXform;
    (*this)[fromStudy].insert( std::multimap<Study::SmartPtr,Xform::SmartPtr>::value_type( toStudy, xform ) );
    }
  if ( warpXform ) 
    {
    Xform::SmartPtr xform = warpXform;
    (*this)[fromStudy].insert( std::multimap<Study::SmartPtr,Xform::SmartPtr>::value_type( toStudy, xform ) );
    }
}

void 
StudyList::DeleteStudy( const Study* study )
{
  iterator it = this->begin();
  while ( it != this->end() ) 
    {
    if ( it->first == study ) 
      {
      this->erase( it );
      }
    break;
    }
}

} // namespace cmtk