This file is indexed.

/usr/include/ITK-4.5/itkConceptChecking.h is in libinsighttoolkit4-dev 4.5.0-3.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  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
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
/*=========================================================================
 *
 *  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.
 *
 *=========================================================================*/
/*=========================================================================
 *
 *  Portions of this file are subject to the VTK Toolkit Version 3 copyright.
 *
 *  Copyright (c) Ken Martin, Will Schroeder, Bill Lorensen
 *
 *  For complete copyright, license and disclaimer of warranty information
 *  please refer to the NOTICE file at the top of the ITK source tree.
 *
 *=========================================================================*/
#ifndef __itkConceptChecking_h
#define __itkConceptChecking_h

#include "itkPixelTraits.h"
#include "itkNumericTraits.h"
#include <iostream>

/** Choose a concept checking implementation based on compiler abilities. */
#ifndef ITK_CONCEPT_NO_CHECKING
#if defined( _MSC_VER ) && !defined( __ICL )
#define ITK_CONCEPT_IMPLEMENTATION_VTABLE
//TST_RMV_20100730 #elif defined(__SUNPRO_CC)
//TST_RMV_20100730 #define ITK_CONCEPT_IMPLEMENTATION_VTABLE
#else
#define ITK_CONCEPT_IMPLEMENTATION_STANDARD
#endif
#endif

/** Define the concept checking implementation chosen above. */
#if defined( ITK_CONCEPT_IMPLEMENTATION_STANDARD )

/**
 * Standard instantiation-time concept check.  No run-time overhead
 * introduced.  This implementation is based on "Concept Checking:
 * Binding Parametric Polymorphism in C++" by Jeremy Siek and Andrew
 * Lumsdaine, University of Notre Dame.
 */

// Leave ()'s off the sizeof to force the caller to pass them in the
// concept argument of the itkConceptMacro.  This is necessary because
// the argument may contain commas.
#define itkConceptConstraintsMacro()    \
  template< void (Constraints::*) ( ) > \
  struct Enforcer {};                   \
  typedef Enforcer< & Constraints::constraints > EnforcerInstantiation
#define itkConceptMacro(name, concept) enum { name = sizeof concept }

#elif defined( ITK_CONCEPT_IMPLEMENTATION_VTABLE )

/**
 * Alternate implementation for some compilers.  This introduces no
 * run-time overhead.  The "vtable" approach was invented for this
 * project by Brad King at Kitware.
 */
#define itkConceptConstraintsMacro() \
  virtual void Enforcer() { &Constraints::constraints; }
#define itkConceptMacro(name, concept) enum { name = sizeof concept }

#elif defined( ITK_CONCEPT_IMPLEMENTATION_CALL )

/** Not implemented.  */
#define itkConceptConstraintsMacro()
#define itkConceptMacro(name, concept) enum { name = 0 }

#else

/** Disable concept checking.  */
#define itkConceptConstraintsMacro()
#define itkConceptMacro(name, concept) enum { name = 0 }

#endif

namespace itk
{
/** All concept class definitions are contained in the "itk::Concept"
    namespace. */
namespace Concept
{
/**
 * Some concept implementation details are adapted from the BOOST C++
 * libraries (www.boost.org).  These are marked with "(BOOST)" in the
 * corresponding comment.
 */

/** Namespace containing concept check implementation details. */
namespace Detail
{
template< typename T >
struct UniqueType {};
template< int >
struct UniqueType_int {};
template< unsigned int >
struct UniqueType_unsigned_int {};
template< bool >
struct UniqueType_bool {};

/**
 * Concept checks may require a variable to be declared but not used.
 * This function can be called with the variable to prevent the compiler
 * warning. (BOOST)
 */
template< typename T >
inline void IgnoreUnusedVariable(T) {}

/**
 * Concept checks may require that an expression be convertible to bool.
 * Passing the expression to this function will enforce this requirement.
 * (BOOST)
 */
template< typename T >
void RequireBooleanExpression(const T & t)
{
  bool x = t;

  IgnoreUnusedVariable(x);
}
}   // namespace Detail

/** Concept requiring T to have a default constructor. (BOOST) */
template< typename T >
struct DefaultConstructible {
  struct Constraints {
    void constraints()
    {
      T a;

      Detail::IgnoreUnusedVariable(a);
    }
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T to have a copy constructor. (BOOST) */
template< typename T >
struct CopyConstructible {
  struct Constraints {
    void constraints()
    {
      T  a(b);
      T *p = &a;

      const_constraints(a);
      Detail::IgnoreUnusedVariable(p);
    }

    void const_constraints(const T & a)
    {
      T        c(a);
      const T *p = &a;

      Detail::IgnoreUnusedVariable(c);
      Detail::IgnoreUnusedVariable(p);
    }

    T b;
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T1 to be convertible to T2. (BOOST) */
template< typename T1, typename T2 >
struct Convertible {
  struct Constraints {
    void constraints()
    {
      T2 b = static_cast< T2 >( a );

      Detail::IgnoreUnusedVariable(b);
    }

    T1 a;
  };
  itkConceptConstraintsMacro();
};

/** Concept requiring T to have operator =.  (BOOST) */
template< typename T >
struct Assignable {
  struct Constraints {
    void constraints()
    {
      a = a;
      const_constraints(a);
    }

    void const_constraints(const T & b)
    {
      a = b;
    }

    T a;
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T1 to have operators < and <= with a right-hand operator
    of type T2.  (BOOST) */
template< typename T1, typename T2 = T1 >
struct LessThanComparable {
  struct Constraints {
    void constraints()
    {
      Detail::RequireBooleanExpression(a < b);
      Detail::RequireBooleanExpression(a <= b);
    }

    T1 a;
    T2 b;
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T1 to have operators > and >= with a right-hand operator
    of type T2.  (BOOST) */
template< typename T1, typename T2 = T1 >
struct GreaterThanComparable {
  struct Constraints {
    void constraints()
    {
      Detail::RequireBooleanExpression(a > b);
      Detail::RequireBooleanExpression(a >= b);
    }

    T1 a;
    T2 b;
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T1 to have operators == and != with a right-hand operator
    of type T2.  (BOOST) */
template< typename T1, typename T2 = T1 >
struct EqualityComparable {
  struct Constraints {
    void constraints()
    {
      Detail::RequireBooleanExpression(a == b);
      Detail::RequireBooleanExpression(a != b);
    }

    T1 a;
    T2 b;
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T1 to have operators <, >, <=, >=, ==, != with a
    right-hand operator of type T2. (BOOST) */
template< typename T1, typename T2 = T1 >
struct Comparable {
  struct Constraints {
    void constraints()
    {
      Detail::RequireBooleanExpression(a < b);
      Detail::RequireBooleanExpression(a > b);
      Detail::RequireBooleanExpression(a <= b);
      Detail::RequireBooleanExpression(a >= b);
      Detail::RequireBooleanExpression(a == b);
      Detail::RequireBooleanExpression(a != b);
    }

    T1 a;
    T2 b;
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T1 to have operators +, -, in the form
    T1 op T2 = T3.  */
template< typename T1, typename T2 = T1, typename T3 = T1 >
struct AdditiveOperators {
  struct Constraints {
    void constraints()
    {
      a = static_cast< T3 >( b + c );
      a = static_cast< T3 >( b - c );
      const_constraints(b, c);
    }

    void const_constraints(const T1 & d, const T2 & e)
    {
      a = static_cast< T3 >( d + e );
      a = static_cast< T3 >( d - e );
    }

    T3 a;
    T1 b;
    T2 c;
  };

  itkConceptConstraintsMacro();
};


/** Concept requiring T1 to have operators +=, -= in the form
    T2 op= T1.  */
template< typename T1, typename T2 = T1>
struct AdditiveAndAssignOperators {
  struct Constraints {
    void constraints()
    {
      a += c;
      a -= c;
      const_constraints(c);
    }

    void const_constraints(const T1 & d)
    {
      a += d;
      a -= d;
    }

    T2 a;
    T1 c;
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T to have operator * in the form T1 op T2 = T3. */
template< typename T1, typename T2 = T1, typename T3 = T1 >
struct MultiplyOperator {
  struct Constraints {
    void constraints()
    {
      a = static_cast< T3 >( b * c );
      const_constraints(b, c);
    }

    void const_constraints(const T1 & d, const T2 & e)
    {
      a = static_cast< T3 >( d * e );
    }

    T3 a;
    T1 b;
    T2 c;
  };
  itkConceptConstraintsMacro();
};

/** Concept requiring T to have operator  *= in the form T2 op= T1. */
template< typename T1, typename T2 = T1 >
struct MultiplyAndAssignOperator {
  struct Constraints {
    void constraints()
    {
      a *= b;
      const_constraints(b);
    }

    void const_constraints(const T1 & d)
    {
      a *= d;
    }

    T2 a;
    T1 b;
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T to have operators / the form T1 op T2 = T3. */
template< typename T1, typename T2 = T1, typename T3 = T1 >
struct DivisionOperators {
  struct Constraints {
    void constraints()
    {
      a = static_cast< T3 >( b / c );
      const_constraints(b, c);
    }

    void const_constraints(const T1 & d, const T2 & e)
    {
      a = static_cast< T3 >( d / e );
    }

    T3 a;
    T1 b;
    T2 c;
  };

  itkConceptConstraintsMacro();
};


/** Concept requiring T to have operators /= in the form T2 op= T1. */
template< typename T1, typename T2 = T1 >
struct DivisionAndAssignOperators {
  struct Constraints {
    void constraints()
    {
      a /= c;
      const_constraints(c);
    }

    void const_constraints(const T1 & d)
    {
      a /= d;
    }

    T1 c;
    T2 a;
  };

  itkConceptConstraintsMacro();
};


/** Concept requiring T1 to have operators &, |, and ^ in the form
    T1 op T2 = T3.  */
template< typename T1, typename T2 = T1, typename T3 = T1 >
struct BitwiseOperators {
  struct Constraints {
    void constraints()
    {
      a = static_cast< T3 >( b & c );
      a = static_cast< T3 >( b | c );
      a = static_cast< T3 >( b ^ c );
      a &= static_cast< T3 >( c );
      a |= static_cast< T3 >( c );
      a ^= static_cast< T3 >( c );
      const_constraints(b, c);
    }

    void const_constraints(const T1 & d, const T2 & e)
    {
      a = static_cast< T3 >( d & e );
      a = static_cast< T3 >( d | e );
      a = static_cast< T3 >( d ^ e );
      a &= static_cast< T3 >( e );
      a |= static_cast< T3 >( e );
      a ^= static_cast< T3 >( e );
    }

    T3 a;
    T1 b;
    T2 c;
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T1 to have operators []  in the form T1 [] T2 = T3.  */
template< typename T1, typename T2 = T1, typename T3 = T1 >
struct BracketOperator {
  struct Constraints {
    void constraints()
    {
      a = static_cast< T3 >( b[c] );
      const_constraints(b, c);
    }

    void const_constraints(const T1 & d, const T2 & e)
    {
      a = static_cast< T3 >( d[e] );
    }

    T3 a;
    T1 b;
    T2 c;
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T to have operator !.  */
template< typename T >
struct NotOperator {
  struct Constraints {
    void constraints()
    {
      a = !a;
    }

    T a;
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T to have operators ++ and --.  */
template< typename T >
struct IncrementDecrementOperators {
  struct Constraints {
    void constraints()
    {
      a++;
      a--;
      ++a;
      --a;
    }

    T a;
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T to be writable to an ostream.  */
template< typename T >
struct OStreamWritable {
  struct Constraints {
    void constraints()
    {
      std::cout << a;
    }

    T a;
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T to be signed. */
template< typename T >
struct Signed {
  typedef Signed Self;
  itkStaticConstMacro(IsSigned, bool, NumericTraits< T >::is_signed);
  struct Constraints {
    typedef Detail::UniqueType_bool< true >                             TrueT;
    typedef Detail::UniqueType_bool< itkGetStaticConstMacro(IsSigned) > SignedT;
    void constraints()
    {
      SignedT a = TrueT();

      Detail::IgnoreUnusedVariable(a);
    }
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T1 and T2 to be the same type. */
template< typename T1, typename T2 >
struct SameType {
  struct Constraints {
    void constraints()
    {
      Detail::UniqueType< T1 > a = Detail::UniqueType< T2 >();
      Detail::IgnoreUnusedVariable(a);
    }
  };
  itkConceptConstraintsMacro();
};

/** Concept requiring D1 and D2 to be the same dimension. */
template< unsigned int D1, unsigned int D2 >
struct SameDimension {
  struct Constraints {
    typedef Detail::UniqueType_unsigned_int< D1 > DT1;
    typedef Detail::UniqueType_unsigned_int< D2 > DT2;
    void constraints()
    {
      DT1 a = DT2();

      Detail::IgnoreUnusedVariable(a);
    }
  };
  itkConceptConstraintsMacro();
};

/** Concept requiring T to have NumericTraits */
template< typename T >
struct HasNumericTraits {
  struct Constraints {
    void constraints()
    {
      typedef typename NumericTraits< T >::ValueType      ValueType;
      typedef typename NumericTraits< T >::PrintType      PrintType;
      typedef typename NumericTraits< T >::AbsType        AbsType;
      typedef typename NumericTraits< T >::AccumulateType AccumulateType;
      typedef typename NumericTraits< T >::RealType       RealType;
      typedef typename NumericTraits< T >::ScalarRealType ScalarRealType;
      typedef typename NumericTraits< T >::FloatType      FloatType;
      T    a;
      bool b;

      // Test these methods that take an instance of T to
      // allow for types with variable length.
      a = NumericTraits< T >::NonpositiveMin( a );
      a = NumericTraits< T >::ZeroValue( a );
      a = NumericTraits< T >::OneValue( a );

      b = NumericTraits< T >::IsPositive(a);
      b = NumericTraits< T >::IsNonpositive(a);
      b = NumericTraits< T >::IsNegative(a);
      b = NumericTraits< T >::IsNonnegative(a);
      Detail::IgnoreUnusedVariable(a);
      Detail::IgnoreUnusedVariable(b);
    }
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T to have PixelTraits */
template< typename T >
struct HasPixelTraits {
  struct Constraints {
    void constraints()
    {
      typedef typename PixelTraits< T >::ValueType ValueType;
      unsigned int a = PixelTraits< T >::Dimension;
      Detail::IgnoreUnusedVariable(a);
    }
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T to have a trait called ValueType */
template< typename T >
struct HasValueType {
  struct Constraints {
    void constraints()
    {
      typedef typename T::ValueType ValueType;
    }
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T to have Zero */
template< typename T >
struct HasZero {
  struct Constraints {
    void constraints()
    {
      T a;

      a = NumericTraits< T >::Zero;
      Detail::IgnoreUnusedVariable(a);
    }
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T to have JoinTraits */
template< typename T1, typename T2 >
struct HasJoinTraits {
  struct Constraints {
    void constraints()
    {
      typedef typename JoinTraits< T1, T2 >::ValueType ValueType;
    }
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring D1 and D2 to be the same dimension or D2-1 = D1. */
template< unsigned int D1, unsigned int D2 >
struct SameDimensionOrMinusOne {
  struct Constraints {
    typedef Detail::UniqueType_unsigned_int< D1 >     Type1;
    typedef Detail::UniqueType_unsigned_int< D1 - 1 > Type2;

    void f(Type1) {}
    void f(Type2, int = 0) {}

    void constraints()
    {
      Detail::UniqueType_unsigned_int< D2 > tt;
      this->f(tt);
    }
  };
  itkConceptConstraintsMacro();
};

/** Concept requiring D1 and D2 to be the same dimension or D2-1 = D1. */
template< unsigned int D1, unsigned int D2 >
struct SameDimensionOrMinusOneOrTwo {
  struct Constraints {
    typedef Detail::UniqueType_unsigned_int< D1 >     Type1;
    typedef Detail::UniqueType_unsigned_int< D1 - 1 > Type2;
    typedef Detail::UniqueType_unsigned_int< D1 - 2 > Type3;

    void f(Type1) {}
    void f(Type2, int = 0) {}
    void f(Type3, int = 0, int = 0) {}

    void constraints()
    {
      Detail::UniqueType_unsigned_int< D2 > tt;
      this->f(tt);
    }
  };
  itkConceptConstraintsMacro();
};

/** Concept requiring T to be integer. */
template< typename T >
struct IsInteger {
  typedef IsInteger Self;
  itkStaticConstMacro(Integral, bool, NumericTraits< T >::is_integer);
  struct Constraints {
    typedef Detail::UniqueType_bool< true >                             TrueT;
    typedef Detail::UniqueType_bool< itkGetStaticConstMacro(Integral) > IntegralT;
    void constraints()
    {
      IntegralT a = TrueT();

      Detail::IgnoreUnusedVariable(a);
    }
  };

  itkConceptConstraintsMacro();
};


/** Concept requiring T to be an unsigned integer. */
template< typename T >
struct IsUnsignedInteger {
  typedef IsUnsignedInteger Self;
  itkStaticConstMacro(Unsigned, bool, !NumericTraits< T >::is_signed);
  struct Constraints {
    typedef Detail::UniqueType_bool< true >                             TrueT;
    typedef Detail::UniqueType_bool< itkGetStaticConstMacro(Unsigned) > UnsignedT;
    void constraints()
    {
      UnsignedT a = TrueT();

      Detail::IgnoreUnusedVariable(a);
    }
  };

  itkConceptConstraintsMacro();
};


/** Concept requiring T to be non-integer. */
template< typename T >
struct IsNonInteger {
  typedef IsNonInteger Self;
  itkStaticConstMacro(NonIntegral, bool, NumericTraits< T >::is_integer);
  struct Constraints {
    typedef Detail::UniqueType_bool< false >                               FalseT;
    typedef Detail::UniqueType_bool< itkGetStaticConstMacro(NonIntegral) > NonIntegralT;
    void constraints()
    {
      NonIntegralT a = FalseT();

      Detail::IgnoreUnusedVariable(a);
    }
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T to be floating point. */
template< typename T >
struct IsFloatingPoint {
  typedef IsFloatingPoint Self;
  itkStaticConstMacro(Integral, bool, NumericTraits< T >::is_integer);
  itkStaticConstMacro(IsExact, bool, NumericTraits< T >::is_exact);
  struct Constraints {
    typedef Detail::UniqueType_bool< false >                            FalseT;
    typedef Detail::UniqueType_bool< itkGetStaticConstMacro(Integral) > IntegralT;
    typedef Detail::UniqueType_bool< itkGetStaticConstMacro(IsExact) >  ExactT;
    void constraints()
    {
      IntegralT a = FalseT();
      ExactT    b = FalseT();

      Detail::IgnoreUnusedVariable(a);
      Detail::IgnoreUnusedVariable(b);
    }
  };

  itkConceptConstraintsMacro();
};

/** Concept requiring T to be fixed point. */
template< typename T >
struct IsFixedPoint {
  typedef IsFixedPoint Self;
  itkStaticConstMacro(Integral, bool, NumericTraits< T >::is_integer);
  itkStaticConstMacro(IsExact, bool, NumericTraits< T >::is_exact);
  struct Constraints {
    typedef Detail::UniqueType_bool< true >                             TrueT;
    typedef Detail::UniqueType_bool< false >                            FalseT;
    typedef Detail::UniqueType_bool< itkGetStaticConstMacro(Integral) > IntegralT;
    typedef Detail::UniqueType_bool< itkGetStaticConstMacro(IsExact) >  ExactT;
    void constraints()
    {
      IntegralT a = FalseT();
      ExactT    b = TrueT();

      Detail::IgnoreUnusedVariable(a);
      Detail::IgnoreUnusedVariable(b);
    }
  };

  itkConceptConstraintsMacro();
};
} // end namespace Concept
} // end namespace itk

#endif