GIT_REPOSITORIES/LPP/Users/mperrinel/SciQLop-fork Files · core/include/Common/SortUtils.h

Improves AMDA result parsing...

Improves AMDA result parsing Finds the unit among all the commented lines, in order to handle the case where the number of commented lines differs from one file to another

Alexandre Leroux - - Load All Authors

File last commit:

r458:3fef0e9bbf37


                r492:41e897ecff03

Download file

             SortUtils.h
        
                    39 lines
            
             | 1.4 KiB
            
                | text/x-c
            
             |
                CLexer
            
             / core / include / Common / SortUtils.h
          
                    History
                
                 |
                  Annotation
                 | Raw
                 |Copy content
                 |Copy permalink

      #ifndef SCIQLOP_SORTUTILS_H

      #define SCIQLOP_SORTUTILS_H

      #include <algorithm>

      #include <numeric>

      #include <vector>

      /**

       * Utility class with methods for sorting data

       */

      struct SortUtils {

          /**

           * Generates a vector representing the index of insertion of each data of a container if this

           * one had to be sorted according to a comparison function.

           *

           * For example:

           * If the container is a vector {1; 4; 2; 5; 3} and the comparison function is std::less, the

           * result would be : {0; 3; 1; 4; 2}

           *

           * @tparam Container the type of the container.

           * @tparam Compare the type of the comparison function

           * @param container the container from which to generate the result. The container must have a

           * at() method that returns a value associated to an index

           * @param compare the comparison function

           */

          template <typename Container, typename Compare>

          static std::vector<int> sortPermutation(const Container &container, const Compare &compare)

          {

              auto permutation = std::vector<int>{};

              permutation.resize(container.size());

              std::iota(permutation.begin(), permutation.end(), 0);

              std::sort(permutation.begin(), permutation.end(),

                        [&](int i, int j) { return compare(container.at(i), container.at(j)); });

              return permutation;

          }

      };

      #endif // SCIQLOP_SORTUTILS_H

	Site-wide shortcuts
/	Use quick search box
g h	Goto home page
g g	Goto my private gists page
g G	Goto my public gists page
g 0-9	Goto bookmarked items from 0-9
n r	New repository page
n g	New gist page

	Repositories
g s	Goto summary page
g c	Goto changelog page
g f	Goto files page
g F	Goto files page with file search activated
g p	Goto pull requests page
g o	Goto repository settings
g O	Goto repository access permissions settings
t s	Toggle sidebar on some pages

				#ifndef SCIQLOP_SORTUTILS_H
				#define SCIQLOP_SORTUTILS_H

				#include <algorithm>
				#include <numeric>
				#include <vector>

				/**
				* Utility class with methods for sorting data
				*/
				struct SortUtils {
				/**
				* Generates a vector representing the index of insertion of each data of a container if this
				* one had to be sorted according to a comparison function.
				*
				* For example:
				* If the container is a vector {1; 4; 2; 5; 3} and the comparison function is std::less, the
				* result would be : {0; 3; 1; 4; 2}
				*
				* @tparam Container the type of the container.
				* @tparam Compare the type of the comparison function
				* @param container the container from which to generate the result. The container must have a
				* at() method that returns a value associated to an index
				* @param compare the comparison function
				*/
				template <typename Container, typename Compare>
				static std::vector<int> sortPermutation(const Container &container, const Compare &compare)
				{
				auto permutation = std::vector<int>{};
				permutation.resize(container.size());

				std::iota(permutation.begin(), permutation.end(), 0);
				std::sort(permutation.begin(), permutation.end(),
				[&](int i, int j) { return compare(container.at(i), container.at(j)); });
				return permutation;
				}
				};

				#endif // SCIQLOP_SORTUTILS_H