3434namespace fKst {
3535
3636template <typename T>
37- inline __attribute__ ((always_inline)) void addValueB(const T* data,const unsigned int N,const unsigned short k, T* restrict output, unsigned int i){
37+ inline /* __attribute__((always_inline))*/ void addValueB (const T* data,const unsigned int N,const unsigned short k, T* restrict output, unsigned int i){
3838 short position=k-2 ;
3939 while ((data[i]>output[position]) && (position>-1 ) ){
4040 output[position+1 ]=output[position];
@@ -44,7 +44,7 @@ template<typename T>
4444 }
4545
4646template <typename T>
47- inline __attribute__ ((always_inline)) void addValueB(const T* data,const unsigned int N,const unsigned short k, T* restrict output, unsigned int * restrict positionValue, unsigned int i){
47+ inline /* __attribute__((always_inline))*/ void addValueB (const T* data,const unsigned int N,const unsigned short k, T* restrict output, unsigned int * restrict positionValue, unsigned int i){
4848 short position=k-2 ;
4949 while ((data[i]>output[position]) && (position>-1 ) ){
5050 output[position+1 ]=output[position];
@@ -56,7 +56,7 @@ template<typename T>
5656 }
5757
5858template <typename T, typename urgT>
59- inline __attribute__ ((always_inline)) void addValueB(const T* data,const unsigned int N,const unsigned short k, T* restrict output, unsigned int * restrict positionValue, urgT generator, unsigned &cpt, unsigned int i){
59+ inline /* __attribute__((always_inline))*/ void addValueB (const T* data,const unsigned int N,const unsigned short k, T* restrict output, unsigned int * restrict positionValue, urgT generator, unsigned &cpt, unsigned int i){
6060 short position=k-2 ;
6161 short positionLikeLast=k-2 ;
6262 while ((output[k-1 ]==output[positionLikeLast]) && (position>-1 ) ){
@@ -841,14 +841,14 @@ inline void findKBigest(const T* data,const unsigned int N,const unsigned short
841841 }
842842#endif
843843
844- #if __arm64__
845- {
846- if (std::is_same<T, float >::value){
847- findKbigestARM (data, N, k, output);
848- return ;
849- }
850- }
851- #endif
844+ // #if __arm64__
845+ // {
846+ // if(std::is_same<T, float>::value){
847+ // findKbigestARM(data, N, k, output);
848+ // return;
849+ // }
850+ // }
851+ // #endif
852852
853853 findKbigest<T>(data, N, k, output);
854854 return ;
@@ -890,14 +890,14 @@ inline void findKBigest(const T* data,const unsigned int N,const unsigned short
890890 }
891891#endif
892892
893- #if __arm64__
894- {
895- if (std::is_same<T, float >::value){
896- findKbigestARM (data, N, k, output, positionValue);
897- return ;
898- }
899- }
900- #endif
893+ // #if __arm64__
894+ // {
895+ // if(std::is_same<T, float>::value){
896+ // findKbigestARM(data, N, k, output, positionValue);
897+ // return;
898+ // }
899+ // }
900+ // #endif
901901
902902 findKbigest<T>(data, N, k, output, positionValue);
903903 return ;
@@ -939,14 +939,14 @@ inline void findKBigest(const T* data,const unsigned int N,const unsigned short
939939 }
940940#endif
941941
942- #if __arm64__
943- {
944- if (std::is_same<T, float >::value){
945- findKbigestARM (data, N, k, output, positionValue, generator);
946- return ;
947- }
948- }
949- #endif
942+ // #if __arm64__
943+ // {
944+ // if(std::is_same<T, float>::value){
945+ // findKbigestARM(data, N, k, output, positionValue, generator);
946+ // return;
947+ // }
948+ // }
949+ // #endif
950950
951951 findKbigest<T>(data, N, k, output, positionValue, generator);
952952 return ;
0 commit comments