File: itkImageRandomNonRepeatingIteratorWithIndexTest2.cxx

package info (click to toggle)
insighttoolkit4 4.13.3withdata-dfsg2-4
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 491,256 kB
  • sloc: cpp: 557,600; ansic: 180,546; fortran: 34,788; python: 16,572; sh: 2,187; lisp: 2,070; tcl: 993; java: 362; perl: 200; makefile: 133; csh: 81; pascal: 69; xml: 19; ruby: 10
file content (86 lines) | stat: -rw-r--r-- 3,399 bytes parent folder | download | duplicates (6)
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
/*=========================================================================
 *
 *  Copyright Insight Software Consortium
 *
 *  Licensed under the Apache License, Version 2.0 (the "License");
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at
 *
 *         http://www.apache.org/licenses/LICENSE-2.0.txt
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 *
 *=========================================================================*/
/*
  This tests the classes ImageRandomNonRepeatingIteratorWithIndex and
  ImageRandomNonRepeatingConstIteratorWithIndex.  This was contributed
  by Rupert Brooks, McGill Centre for Intelligent
  Machines, Montreal, Canada.  It is heavily based on the
  ImageRandomIterator test program.
*/

#include <iostream>
#include "itkImageRandomNonRepeatingConstIteratorWithIndex.h"

int itkImageRandomNonRepeatingIteratorWithIndexTest2(int, char* [])
{
  const unsigned int ImageDimension = 2;
  typedef itk::Index< ImageDimension >             PixelType;
  typedef itk::Image< PixelType, ImageDimension >  ImageType;

  typedef itk::ImageRandomNonRepeatingConstIteratorWithIndex< ImageType >
    RandomConstIteratorType;
  const unsigned long N = 10;
  const int Seed = 42;
  ImageType::SizeType size;
  size.Fill(N);
  ImageType::IndexType start;
  start.Fill(0);
  ImageType::RegionType region;
  region.SetIndex( start );
  region.SetSize( size );
  ImageType::Pointer myImage = ImageType::New();
  myImage->SetLargestPossibleRegion( region );
  myImage->SetBufferedRegion( region );
  myImage->SetRequestedRegion( region );
  myImage->Allocate();
  typedef std::vector<ImageType::IndexType>            WalkType;
  typedef WalkType::iterator                           WalkIteratorType;
  WalkType firstWalk(N);
  RandomConstIteratorType firstIt(myImage, region);
  firstIt.ReinitializeSeed( Seed );
  firstIt.SetNumberOfSamples( region.GetNumberOfPixels() );
  for (firstIt.GoToBegin(); !firstIt.IsAtEnd(); ++firstIt)
    {
    firstWalk.push_back( firstIt.GetIndex() );
    }
  WalkType secondWalk(N);
  RandomConstIteratorType secondIt(myImage, region);
  secondIt.ReinitializeSeed( Seed );
  secondIt.SetNumberOfSamples( region.GetNumberOfPixels() );
  for (secondIt.GoToBegin(); !secondIt.IsAtEnd(); ++secondIt)
    {
    secondWalk.push_back( secondIt.GetIndex() );
    }
  std::pair<WalkIteratorType,WalkIteratorType> mismatchTest;
  mismatchTest =
    std::mismatch( firstWalk.begin(),
                   firstWalk.end(),secondWalk.begin() );
  if ( mismatchTest.first != firstWalk.end() )
    {
    std::cerr << "Two iterations with the same seed do not"
              << " walk over the same pixels" << std::endl
              << "First mismatch found after "
              << mismatchTest.first - firstWalk.begin()
              << " iterations." << std::endl
              << "First walk index  : " << *(mismatchTest.first) << std::endl
              << "Second walk index : " << *(mismatchTest.second) << std::endl;
    return EXIT_FAILURE;
    }
  std::cout << "Test passed" << std::endl;
  return EXIT_SUCCESS;
}