diff --git a/README.md b/README.md index 3093f8a..6768314 100644 --- a/README.md +++ b/README.md @@ -182,6 +182,7 @@ gets more complicated. Sorting by Euclidean distance can be up-to 10x faster. ## Downstream projects using x86-simd-sort - NumPy uses this as a [submodule](https://github.com/numpy/numpy/pull/22315) to accelerate `np.sort, np.argsort, np.partition and np.argpartition`. +- PyTorch uses this as a [submodule](https://github.com/pytorch/pytorch/pull/127936) to accelerate `torch.sort, torch.argsort`. - A slightly modifed version this library has been integrated into [openJDK](https://github.com/openjdk/jdk/pull/14227). - [GRAPE](https://github.com/alibaba/libgrape-lite.git): C++ library for parallel graph processing. - AVX-512 version of the key-value sort has been submitted to [Oceanbase](https://github.com/oceanbase/oceanbase/pull/1325). diff --git a/meson.build b/meson.build index 41c6879..71b4468 100644 --- a/meson.build +++ b/meson.build @@ -1,5 +1,5 @@ project('x86-simd-sort', 'cpp', - version : '5.0.x', + version : '6.0.x', license : 'BSD 3-clause', default_options : ['cpp_std=c++17']) fs = import('fs') diff --git a/src/avx2-64bit-qsort.hpp b/src/avx2-64bit-qsort.hpp index d8b094d..a7e46f9 100644 --- a/src/avx2-64bit-qsort.hpp +++ b/src/avx2-64bit-qsort.hpp @@ -413,8 +413,7 @@ struct avx2_vector { static_assert(sizeof(size_t) == sizeof(uint64_t), "Size of size_t and uint64_t are not the same"); template <> -struct avx2_vector : public avx2_vector { -}; +struct avx2_vector : public avx2_vector {}; #endif template <> diff --git a/src/avx512-64bit-common.h b/src/avx512-64bit-common.h index 14201d1..1c81c79 100644 --- a/src/avx512-64bit-common.h +++ b/src/avx512-64bit-common.h @@ -979,8 +979,7 @@ struct zmm_vector { static_assert(sizeof(size_t) == sizeof(uint64_t), "Size of size_t and uint64_t are not the same"); template <> -struct zmm_vector : public zmm_vector { -}; +struct zmm_vector : public zmm_vector {}; #endif template <>