From 972ad6484f3f09978b9d6df44cf703528ac6637b Mon Sep 17 00:00:00 2001 From: Lee Newberg Date: Wed, 13 Apr 2022 08:49:30 -0400 Subject: [PATCH 1/2] COMP: Format code to address clang_format warnings --- include/itkVkCommon.h | 53 ++++++++++--------- .../itkVkComplexToComplex1DFFTImageFilter.hxx | 2 +- include/itkVkForward1DFFTImageFilter.hxx | 2 +- include/itkVkInverse1DFFTImageFilter.hxx | 2 +- src/itkVkCommon.cxx | 14 ++--- src/itkVkFFTImageFilterInitFactory.cxx | 5 +- ...xToComplex1DFFTImageFilterBaselineTest.cxx | 2 +- ...plexToComplex1DFFTImageFilterSizesTest.cxx | 8 +-- ...tkVkComplexToComplexFFTImageFilterTest.cxx | 8 +-- test/itkVkFFTImageFilterFactoryTest.cxx | 2 +- ...kVkForward1DFFTImageFilterBaselineTest.cxx | 2 +- ...tkVkForwardInverse1DFFTImageFilterTest.cxx | 6 +-- .../itkVkForwardInverseFFTImageFilterTest.cxx | 6 +-- test/itkVkHalfHermitianFFTImageFilterTest.cxx | 6 +-- ...kVkInverse1DFFTImageFilterBaselineTest.cxx | 2 +- 15 files changed, 61 insertions(+), 59 deletions(-) diff --git a/include/itkVkCommon.h b/include/itkVkCommon.h index c656e120..8c05ce91 100644 --- a/include/itkVkCommon.h +++ b/include/itkVkCommon.h @@ -64,26 +64,28 @@ class VkFFTBackend_EXPORT VkCommon struct VkParameters { - uint64_t X = 0; // size of fastest varying dimension - uint64_t Y = 1; // size of second-fastest varying dimension, if any, otherwise 1. - uint64_t Z = 1; // size of third-fastest varying dimension, if any, otherwise 1. + uint64_t X{ 0 }; // size of fastest varying dimension + uint64_t Y{ 1 }; // size of second-fastest varying dimension, if any, otherwise 1. + uint64_t Z{ 1 }; // size of third-fastest varying dimension, if any, otherwise 1. uint64_t omitDimension[3] = { 0, 0, 0 }; // disable FFT for this dimension (0 - FFT enabled, 1 - FFT disabled). Default 0. // Doesn't work for R2C dimension 0 for now. Doesn't work with convolutions. PrecisionEnum P = PrecisionEnum::FLOAT; // type for real numbers - uint64_t B = 1; // Number of batches -- always 1 - uint64_t N = 1; // Number of redundant iterations, for benchmarking -- always 1. - FFTEnum fft = FFTEnum::C2C; // ComplexToComplex, RealToHalfHermetian, RealToFullHermetian - uint64_t PSize = 4; // sizeof(float), sizeof(double), or sizeof(half) according to VkParameters.P. - DirectionEnum I = - DirectionEnum::FORWARD; // forward or inverse transformation. (R2HalfH inverse is aka HalfH2R, etc.) - NormalizationEnum normalized = - NormalizationEnum::UNNORMALIZED; // Whether inverse transformation should be divided by array size - const void * inputCPUBuffer = 0; // input buffer in CPU memory - uint64_t inputBufferBytes = 0; // number of bytes in inputCPUBuffer - void * outputCPUBuffer = 0; // output buffer in CPU memory - uint64_t outputBufferBytes = 0; // number of bytes in outputCPUBuffer + uint64_t B{ 1 }; // Number of batches -- always 1 + uint64_t N{ 1 }; // Number of redundant iterations, for benchmarking -- always 1. + FFTEnum fft{ FFTEnum::C2C }; // ComplexToComplex, RealToHalfHermetian, RealToFullHermetian + uint64_t PSize{ 4 }; // sizeof(float), sizeof(double), or sizeof(half) according to VkParameters.P. + DirectionEnum I{ + DirectionEnum::FORWARD + }; // forward or inverse transformation. (R2HalfH inverse is aka HalfH2R, etc.) + NormalizationEnum normalized{ + NormalizationEnum::UNNORMALIZED + }; // Whether inverse transformation should be divided by array size + const void * inputCPUBuffer{ nullptr }; // input buffer in CPU memory + uint64_t inputBufferBytes{ 0 }; // number of bytes in inputCPUBuffer + void * outputCPUBuffer{ nullptr }; // output buffer in CPU memory + uint64_t outputBufferBytes{ 0 }; // number of bytes in outputCPUBuffer bool operator!=(const VkParameters & rhs) const @@ -99,23 +101,22 @@ class VkFFTBackend_EXPORT VkCommon struct VkGPU { #if (VKFFT_BACKEND == CUDA) - CUdevice device = 0; - CUcontext context = 0; + CUdevice device{ 0 }; + CUcontext context{ 0 }; #elif (VKFFT_BACKEND == OPENCL) - cl_platform_id platform = 0; - cl_device_id device = 0; - cl_context context = 0; - cl_command_queue commandQueue = 0; + cl_platform_id platform{ 0 }; + cl_device_id device{ 0 }; + cl_context context{ 0 }; + cl_command_queue commandQueue{ 0 }; #endif - uint64_t device_id = 0; // default value + uint64_t device_id{ 0 }; // default value bool operator!=(const VkGPU & rhs) const { -# if (VKFFT_BACKEND == CUDA) - return this->device != rhs.device || this->context != rhs.context || - this->device_id != rhs.device_id; -# elif (VKFFT_BACKEND == OPENCL) +#if (VKFFT_BACKEND == CUDA) + return this->device != rhs.device || this->context != rhs.context || this->device_id != rhs.device_id; +#elif (VKFFT_BACKEND == OPENCL) return this->platform != rhs.platform || this->device != rhs.device || this->context != rhs.context || this->commandQueue != rhs.commandQueue || this->device_id != rhs.device_id; #endif diff --git a/include/itkVkComplexToComplex1DFFTImageFilter.hxx b/include/itkVkComplexToComplex1DFFTImageFilter.hxx index bd519748..92984002 100644 --- a/include/itkVkComplexToComplex1DFFTImageFilter.hxx +++ b/include/itkVkComplexToComplex1DFFTImageFilter.hxx @@ -86,7 +86,7 @@ VkComplexToComplex1DFFTImageFilter::GenerateData() vkParameters.normalized = vkParameters.I == VkCommon::DirectionEnum::INVERSE ? VkCommon::NormalizationEnum::NORMALIZED : VkCommon::NormalizationEnum::UNNORMALIZED; - for (size_t dim = 0; dim < ImageDimension; ++dim) + for (size_t dim{ 0 }; dim < ImageDimension; ++dim) { if (this->GetDirection() != dim) { diff --git a/include/itkVkForward1DFFTImageFilter.hxx b/include/itkVkForward1DFFTImageFilter.hxx index 946a6672..a61de4a3 100644 --- a/include/itkVkForward1DFFTImageFilter.hxx +++ b/include/itkVkForward1DFFTImageFilter.hxx @@ -81,7 +81,7 @@ VkForward1DFFTImageFilter::GenerateData() vkParameters.PSize = sizeof(RealType); vkParameters.I = VkCommon::DirectionEnum::FORWARD; vkParameters.normalized = VkCommon::NormalizationEnum::UNNORMALIZED; - for (size_t dim = 0; dim < ImageDimension; ++dim) + for (size_t dim{ 0 }; dim < ImageDimension; ++dim) { if (this->GetDirection() != dim) { diff --git a/include/itkVkInverse1DFFTImageFilter.hxx b/include/itkVkInverse1DFFTImageFilter.hxx index 9720a221..ca7ca6e2 100644 --- a/include/itkVkInverse1DFFTImageFilter.hxx +++ b/include/itkVkInverse1DFFTImageFilter.hxx @@ -81,7 +81,7 @@ VkInverse1DFFTImageFilter::GenerateData() vkParameters.PSize = sizeof(RealType); vkParameters.I = VkCommon::DirectionEnum::INVERSE; vkParameters.normalized = VkCommon::NormalizationEnum::NORMALIZED; - for (size_t dim = 0; dim < ImageDimension; ++dim) + for (size_t dim{ 0 }; dim < ImageDimension; ++dim) { if (this->GetDirection() != dim) { diff --git a/src/itkVkCommon.cxx b/src/itkVkCommon.cxx index 4f9be4bd..2cdb6808 100644 --- a/src/itkVkCommon.cxx +++ b/src/itkVkCommon.cxx @@ -99,7 +99,7 @@ VkCommon::ConfigureBackend() return VkFFTResult{ VKFFT_ERROR_FAILED_TO_INITIALIZE }; } uint64_t k{ 0 }; - for (uint64_t j = 0; j < numPlatforms; j++) + for (uint64_t j{ 0 }; j < numPlatforms; j++) { cl_uint numDevices; resCL = clGetDeviceIDs(platforms[j], CL_DEVICE_TYPE_ALL, 0, nullptr, &numDevices); @@ -113,7 +113,7 @@ VkCommon::ConfigureBackend() std::cerr << __FILE__ "(" << __LINE__ << "): clGetDeviceIDs returned " << resCL << std::endl; return VkFFTResult{ VKFFT_ERROR_FAILED_TO_GET_DEVICE }; } - for (uint64_t i = 0; i < numDevices; i++) + for (uint64_t i{ 0 }; i < numDevices; i++) { if (k == m_VkGPU.device_id) { @@ -163,7 +163,7 @@ VkCommon::ConfigureBackend() { m_VkFFTConfiguration.doublePrecision = 1; } - for (size_t dim = 0; dim < 3; ++dim) + for (size_t dim{ 0 }; dim < 3; ++dim) { m_VkFFTConfiguration.omitDimension[dim] = m_VkParameters.omitDimension[dim]; } @@ -496,9 +496,9 @@ VkCommon::PerformFFT() { using ComplexType = std::complex; ComplexType * const outputCPUFloat{ reinterpret_cast(m_VkParameters.outputCPUBuffer) }; - for (uint64_t z = 0; z < m_VkFFTConfiguration.size[2]; ++z) + for (uint64_t z{ 0 }; z < m_VkFFTConfiguration.size[2]; ++z) { - for (uint64_t y = 0; y < m_VkFFTConfiguration.size[1]; ++y) + for (uint64_t y{ 0 }; y < m_VkFFTConfiguration.size[1]; ++y) { const uint64_t offsetStart{ z * m_VkFFTConfiguration.bufferStride[1] + y * m_VkFFTConfiguration.bufferStride[0] }; @@ -515,9 +515,9 @@ VkCommon::PerformFFT() { using ComplexType = std::complex; ComplexType * const outputCPUDouble{ reinterpret_cast(m_VkParameters.outputCPUBuffer) }; - for (uint64_t z = 0; z < m_VkFFTConfiguration.size[2]; ++z) + for (uint64_t z{ 0 }; z < m_VkFFTConfiguration.size[2]; ++z) { - for (uint64_t y = 0; y < m_VkFFTConfiguration.size[1]; ++y) + for (uint64_t y{ 0 }; y < m_VkFFTConfiguration.size[1]; ++y) { const uint64_t offsetStart{ z * m_VkFFTConfiguration.bufferStride[1] + y * m_VkFFTConfiguration.bufferStride[0] }; diff --git a/src/itkVkFFTImageFilterInitFactory.cxx b/src/itkVkFFTImageFilterInitFactory.cxx index 132cdcaf..ba8e2d09 100644 --- a/src/itkVkFFTImageFilterInitFactory.cxx +++ b/src/itkVkFFTImageFilterInitFactory.cxx @@ -36,7 +36,8 @@ VkFFTImageFilterInitFactory::VkFFTImageFilterInitFactory() VkFFTImageFilterInitFactory::RegisterFactories(); } -void VkFFTImageFilterInitFactory::RegisterFactories() +void +VkFFTImageFilterInitFactory::RegisterFactories() { itk::ObjectFactoryBase::RegisterFactory(FFTImageFilterFactory::New(), itk::ObjectFactoryEnums::InsertionPosition::INSERT_AT_FRONT); @@ -59,7 +60,7 @@ void VkFFTImageFilterInitFactory::RegisterFactories() // Undocumented API used to register during static initialization. // DO NOT CALL DIRECTLY. void VkFFTBackend_EXPORT -VkFFTImageFilterInitFactoryRegister__Private() + VkFFTImageFilterInitFactoryRegister__Private() { VkFFTImageFilterInitFactory::RegisterFactories(); } diff --git a/test/itkVkComplexToComplex1DFFTImageFilterBaselineTest.cxx b/test/itkVkComplexToComplex1DFFTImageFilterBaselineTest.cxx index 2b251042..67847c81 100644 --- a/test/itkVkComplexToComplex1DFFTImageFilterBaselineTest.cxx +++ b/test/itkVkComplexToComplex1DFFTImageFilterBaselineTest.cxx @@ -77,7 +77,7 @@ itkVkComplexToComplex1DFFTImageFilterBaselineTest(int argc, char * argv[]) } using PixelType = double; - const unsigned int Dimension = 2; + const unsigned int Dimension{ 2 }; using ComplexImageType = itk::Image, Dimension>; using FFTInverseType = itk::VkComplexToComplex1DFFTImageFilter; diff --git a/test/itkVkComplexToComplex1DFFTImageFilterSizesTest.cxx b/test/itkVkComplexToComplex1DFFTImageFilterSizesTest.cxx index 9e3f1cb5..60dcfa1e 100644 --- a/test/itkVkComplexToComplex1DFFTImageFilterSizesTest.cxx +++ b/test/itkVkComplexToComplex1DFFTImageFilterSizesTest.cxx @@ -91,7 +91,7 @@ itkVkComplexToComplex1DFFTImageFilterSizesTest(int argc, char * argv[]) typename ShowProgress::Pointer showProgress{ ShowProgress::New() }; - for (int i = 0; i < 2; ++i) + for (int i{ 0 }; i < 2; ++i) { image->FillBuffer(1.2f); image->FillBuffer(1.1f); @@ -117,7 +117,7 @@ itkVkComplexToComplex1DFFTImageFilterSizesTest(int argc, char * argv[]) using ComplexImageType = itk::Image; typename ComplexImageType::SizeType size; // Skip trivial case where 1D image of size 1 fails. - for (unsigned int mySize = 2; mySize <= 20; ++mySize) + for (unsigned int mySize{ 2 }; mySize <= 20; ++mySize) { // We expect that anything evenly divisible by a prime number greater than 13 // will succeed with Bluestein's Algorithm implementation in VkFFT, though @@ -150,7 +150,7 @@ itkVkComplexToComplex1DFFTImageFilterSizesTest(int argc, char * argv[]) { thisTestPassed = false; } - for (unsigned int i = 0; i < mySize; ++i) + for (unsigned int i{ 0 }; i < mySize; ++i) { index[0] = i; @@ -180,7 +180,7 @@ itkVkComplexToComplex1DFFTImageFilterSizesTest(int argc, char * argv[]) std::cout << "|difference| = " << std::abs(output2->GetPixel(index) - someValue) << std::endl; thisTestPassed = false; } - for (unsigned int i = 1; i < mySize; ++i) + for (unsigned int i{ 1 }; i < mySize; ++i) { index[0] = i; if (std::abs(output2->GetPixel(index) - zeroValue) > valueTolerance) diff --git a/test/itkVkComplexToComplexFFTImageFilterTest.cxx b/test/itkVkComplexToComplexFFTImageFilterTest.cxx index 266ed156..69f867c3 100644 --- a/test/itkVkComplexToComplexFFTImageFilterTest.cxx +++ b/test/itkVkComplexToComplexFFTImageFilterTest.cxx @@ -88,7 +88,7 @@ itkVkComplexToComplexFFTImageFilterTest(int argc, char * argv[]) typename ShowProgress::Pointer showProgress{ ShowProgress::New() }; - for (int i = 0; i < 2; ++i) + for (int i{ 0 }; i < 2; ++i) { image->FillBuffer(1.2f); image->FillBuffer(1.1f); @@ -114,7 +114,7 @@ itkVkComplexToComplexFFTImageFilterTest(int argc, char * argv[]) using ComplexImageType = itk::Image; typename ComplexImageType::SizeType size; // Skip trivial case where 1D image of size 1 fails. - for (unsigned int mySize = 2; mySize <= 20; ++mySize) + for (unsigned int mySize{ 2 }; mySize <= 20; ++mySize) { // We expect that anything evenly divisible by a prime number greater than 13 // will succeed with Bluestein's Algorithm implementation in VkFFT, though @@ -147,7 +147,7 @@ itkVkComplexToComplexFFTImageFilterTest(int argc, char * argv[]) { thisTestPassed = false; } - for (unsigned int i = 0; i < mySize; ++i) + for (unsigned int i{ 0 }; i < mySize; ++i) { index[0] = i; @@ -177,7 +177,7 @@ itkVkComplexToComplexFFTImageFilterTest(int argc, char * argv[]) std::cout << "|difference| = " << std::abs(output2->GetPixel(index) - someValue) << std::endl; thisTestPassed = false; } - for (unsigned int i = 1; i < mySize; ++i) + for (unsigned int i{ 1 }; i < mySize; ++i) { index[0] = i; if (std::abs(output2->GetPixel(index) - zeroValue) > valueTolerance) diff --git a/test/itkVkFFTImageFilterFactoryTest.cxx b/test/itkVkFFTImageFilterFactoryTest.cxx index a3151c4f..4d6cfe12 100644 --- a/test/itkVkFFTImageFilterFactoryTest.cxx +++ b/test/itkVkFFTImageFilterFactoryTest.cxx @@ -34,7 +34,7 @@ int itkVkFFTImageFilterFactoryTest(int, char *[]) { using PixelType = double; - const unsigned int Dimension = 2; + const unsigned int Dimension{ 2 }; using ComplexImageType = itk::Image, Dimension>; using FFTBaseType = itk::ComplexToComplex1DFFTImageFilter; using FFTDefaultSubclassType = itk::VnlComplexToComplex1DFFTImageFilter; diff --git a/test/itkVkForward1DFFTImageFilterBaselineTest.cxx b/test/itkVkForward1DFFTImageFilterBaselineTest.cxx index 8b9796ca..8aedc4fc 100644 --- a/test/itkVkForward1DFFTImageFilterBaselineTest.cxx +++ b/test/itkVkForward1DFFTImageFilterBaselineTest.cxx @@ -76,7 +76,7 @@ itkVkForward1DFFTImageFilterBaselineTest(int argc, char * argv[]) } using PixelType = double; - const unsigned int Dimension = 2; + const unsigned int Dimension{ 2 }; using ImageType = itk::Image; using FFTForwardType = itk::VkForward1DFFTImageFilter; diff --git a/test/itkVkForwardInverse1DFFTImageFilterTest.cxx b/test/itkVkForwardInverse1DFFTImageFilterTest.cxx index af40136e..12b77564 100644 --- a/test/itkVkForwardInverse1DFFTImageFilterTest.cxx +++ b/test/itkVkForwardInverse1DFFTImageFilterTest.cxx @@ -77,7 +77,7 @@ itkVkForwardInverse1DFFTImageFilterTest(int argc, char * argv[]) bool firstPass{ true }; // Skip trivial case where 1D image of size 1 fails. - for (unsigned int mySize = 2; mySize <= 20; ++mySize) + for (unsigned int mySize{ 2 }; mySize <= 20; ++mySize) { // We expect that anything evenly divisible by a prime number greater than 13 // will succeed with Bluestein's Algorithm implementation in VkFFT, though @@ -130,7 +130,7 @@ itkVkForwardInverse1DFFTImageFilterTest(int argc, char * argv[]) std::cout << "Size is " << outputSize[0] << " but should be " << mySize << "." << std::endl; thisTestPassed = false; } - for (unsigned int i = 0; i < mySize; ++i) + for (unsigned int i{ 0 }; i < mySize; ++i) { index[0] = i; if (std::abs(output->GetPixel(index) - complexSomeValue) > valueTolerance) @@ -161,7 +161,7 @@ itkVkForwardInverse1DFFTImageFilterTest(int argc, char * argv[]) << ": |difference| = " << std::abs(output2->GetPixel(index) - realSomeValue) << std::endl; thisTestPassed = false; } - for (unsigned int i = 1; i < mySize; ++i) + for (unsigned int i{ 1 }; i < mySize; ++i) { index[0] = i; if (std::abs(output2->GetPixel(index) - realZeroValue) > valueTolerance) diff --git a/test/itkVkForwardInverseFFTImageFilterTest.cxx b/test/itkVkForwardInverseFFTImageFilterTest.cxx index 46f056e5..7603d607 100644 --- a/test/itkVkForwardInverseFFTImageFilterTest.cxx +++ b/test/itkVkForwardInverseFFTImageFilterTest.cxx @@ -77,7 +77,7 @@ itkVkForwardInverseFFTImageFilterTest(int argc, char * argv[]) bool firstPass{ true }; // Skip trivial case where 1D image of size 1 fails. - for (unsigned int mySize = 2; mySize <= 20; ++mySize, firstPass = false) + for (unsigned int mySize{ 2 }; mySize <= 20; ++mySize, firstPass = false) { // We expect that anything evenly divisible by a prime number greater than 13 // will succeed with Bluestein's Algorithm implementation in VkFFT, though @@ -131,7 +131,7 @@ itkVkForwardInverseFFTImageFilterTest(int argc, char * argv[]) std::cout << "Size is " << outputSize[0] << " but should be " << mySize << "." << std::endl; thisTestPassed = false; } - for (unsigned int i = 0; i < mySize; ++i) + for (unsigned int i{ 0 }; i < mySize; ++i) { index[0] = i; if (std::abs(output->GetPixel(index) - complexSomeValue) > valueTolerance) @@ -162,7 +162,7 @@ itkVkForwardInverseFFTImageFilterTest(int argc, char * argv[]) << ": |difference| = " << std::abs(output2->GetPixel(index) - realSomeValue) << std::endl; thisTestPassed = false; } - for (unsigned int i = 1; i < mySize; ++i) + for (unsigned int i{ 1 }; i < mySize; ++i) { index[0] = i; if (std::abs(output2->GetPixel(index) - realZeroValue) > valueTolerance) diff --git a/test/itkVkHalfHermitianFFTImageFilterTest.cxx b/test/itkVkHalfHermitianFFTImageFilterTest.cxx index f1fb7c11..a2c487bb 100644 --- a/test/itkVkHalfHermitianFFTImageFilterTest.cxx +++ b/test/itkVkHalfHermitianFFTImageFilterTest.cxx @@ -76,7 +76,7 @@ itkVkHalfHermitianFFTImageFilterTest(int argc, char * argv[]) typename RealImageType::IndexType index; bool firstPass{ true }; // Skip trivial case where 1D image of size 1 fails. - for (unsigned int mySize = 2; mySize <= 20; ++mySize, firstPass = false) + for (unsigned int mySize{ 2 }; mySize <= 20; ++mySize, firstPass = false) { // We expect that anything evenly divisible by a prime number greater than 13 // will succeed with Bluestein's Algorithm implementation in VkFFT, though @@ -134,7 +134,7 @@ itkVkHalfHermitianFFTImageFilterTest(int argc, char * argv[]) std::cout << "Size is " << outputSize[0] << " but should be " << desiredOutputSize << "." << std::endl; thisTestPassed = false; } - for (unsigned int i = 0; i < desiredOutputSize; ++i) + for (unsigned int i{ 0 }; i < desiredOutputSize; ++i) { index[0] = i; if (std::abs(output->GetPixel(index) - complexSomeValue) > valueTolerance) @@ -166,7 +166,7 @@ itkVkHalfHermitianFFTImageFilterTest(int argc, char * argv[]) << ": |difference| = " << std::abs(output2->GetPixel(index) - realSomeValue) << std::endl; thisTestPassed = false; } - for (unsigned int i = 1; i < mySize; ++i) + for (unsigned int i{ 1 }; i < mySize; ++i) { index[0] = i; if (std::abs(output2->GetPixel(index) - realZeroValue) > valueTolerance) diff --git a/test/itkVkInverse1DFFTImageFilterBaselineTest.cxx b/test/itkVkInverse1DFFTImageFilterBaselineTest.cxx index 8c549654..adf2622c 100644 --- a/test/itkVkInverse1DFFTImageFilterBaselineTest.cxx +++ b/test/itkVkInverse1DFFTImageFilterBaselineTest.cxx @@ -69,7 +69,7 @@ itkVkInverse1DFFTImageFilterBaselineTest(int argc, char * argv[]) } using PixelType = double; - const unsigned int Dimension = 2; + const unsigned int Dimension{ 2 }; using ComplexImageType = itk::Image, Dimension>; using FFTInverseType = itk::VkInverse1DFFTImageFilter; From cc15af115a1d014820246382e7d0bbf64526fa45 Mon Sep 17 00:00:00 2001 From: Lee Newberg Date: Wed, 13 Apr 2022 09:04:52 -0400 Subject: [PATCH 2/2] COMP: Update clang-format-linter.yml to match ITK --- .github/workflows/clang-format-linter.yml | 5 +++-- 1 file changed, 3 insertions(+), 2 deletions(-) diff --git a/.github/workflows/clang-format-linter.yml b/.github/workflows/clang-format-linter.yml index c59dd587..ab5019f0 100644 --- a/.github/workflows/clang-format-linter.yml +++ b/.github/workflows/clang-format-linter.yml @@ -7,6 +7,7 @@ jobs: runs-on: ubuntu-latest steps: - - uses: actions/checkout@v1 - + - uses: actions/checkout@v2 - uses: InsightSoftwareConsortium/ITKClangFormatLinterAction@master + with: + error-message: 'Code is inconsistent with ITK Coding Style. Add the *action:ApplyClangFormat* PR label to correct.'