Head

GCC Code Coverage Report

Directory:	.		Exec	Total	Coverage
File:	src/prop/minisat/mtl/Sort.h	Lines:	27	27	100.0 %
Date:	2021-09-17	Branches:	49	56	87.5 %


/******************************************************************************************[Sort.h]
Copyright (c) 2003-2007, Niklas Een, Niklas Sorensson
Copyright (c) 2007-2010, Niklas Sorensson

Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
associated documentation files (the "Software"), to deal in the Software without restriction,
including without limitation the rights to use, copy, modify, merge, publish, distribute,
sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all copies or
substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT
NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT
OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
**************************************************************************************************/

#ifndef Minisat_Sort_h
#define Minisat_Sort_h

#include "prop/minisat/mtl/Vec.h"

//=================================================================================================
// Some sorting algorithms for vec's

namespace cvc5 {
namespace Minisat {

template<class T>
struct LessThan_default {
    bool operator () (T x, T y) { return x < y; }
};


template <class T, class LessThan>
void selectionSort(T* array, int size, LessThan lt)
{
    int     i, j, best_i;
    T       tmp;

    for (i = 0; i < size-1; i++){
        best_i = i;
        for (j = i+1; j < size; j++){
            if (lt(array[j], array[best_i]))
                best_i = j;
        }
        tmp = array[i]; array[i] = array[best_i]; array[best_i] = tmp;
    }
}
template <class T> static inline void selectionSort(T* array, int size) {
    selectionSort(array, size, LessThan_default<T>()); }

template <class T, class LessThan>
void sort(T* array, int size, LessThan lt)
{
    if (size <= 15)
        selectionSort(array, size, lt);

    else{
        T           pivot = array[size / 2];
        T           tmp;
        int         i = -1;
        int         j = size;

        for(;;){
            do i++; while(lt(array[i], pivot));
            do j--; while(lt(pivot, array[j]));

            if (i >= j) break;

            tmp = array[i]; array[i] = array[j]; array[j] = tmp;
        }

        sort(array    , i     , lt);
        sort(&array[i], size-i, lt);
    }
}
template <class T> static inline void sort(T* array, int size) {
    sort(array, size, LessThan_default<T>()); }


//=================================================================================================
// For 'vec's:


template <class T, class LessThan> void sort(vec<T>& v, LessThan lt) {
    sort((T*)v, v.size(), lt); }
template <class T> void sort(vec<T>& v) {
    sort(v, LessThan_default<T>()); }


//=================================================================================================
}
}  // namespace cvc5

#endif


Generated by: GCOVR (Version 3.2)

Line	Exec	Source
1		/******************************************************************************************[Sort.h]
2		Copyright (c) 2003-2007, Niklas Een, Niklas Sorensson
3		Copyright (c) 2007-2010, Niklas Sorensson
4
5		Permission is hereby granted, free of charge, to any person obtaining a copy of this software and
6		associated documentation files (the "Software"), to deal in the Software without restriction,
7		including without limitation the rights to use, copy, modify, merge, publish, distribute,
8		sublicense, and/or sell copies of the Software, and to permit persons to whom the Software is
9		furnished to do so, subject to the following conditions:
10
11		The above copyright notice and this permission notice shall be included in all copies or
12		substantial portions of the Software.
13
14		THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT
15		NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
16		NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
17		DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT
18		OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
19		**************************************************************************************************/
20
21		#ifndef Minisat_Sort_h
22		#define Minisat_Sort_h
23
24		#include "prop/minisat/mtl/Vec.h"
25
26		//=================================================================================================
27		// Some sorting algorithms for vec's
28
29		namespace cvc5 {
30		namespace Minisat {
31
32		template<class T>
33		struct LessThan_default {
34	25895046	bool operator () (T x, T y) { return x < y; }
35		};
36
37
38		template <class T, class LessThan>
39	7706503	void selectionSort(T* array, int size, LessThan lt)
40		{
41		int i, j, best_i;
42		T tmp;
43
44	23220530	for (i = 0; i < size-1; i++){
45	15514027	best_i = i;
46	57015437	for (j = i+1; j < size; j++){
47	41501410	if (lt(array[j], array[best_i]))
48	8452281	best_i = j;
49		}
50	15514027	tmp = array[i]; array[i] = array[best_i]; array[best_i] = tmp;
51		}
52	7706503	}
53		template <class T> static inline void selectionSort(T* array, int size) {
54		selectionSort(array, size, LessThan_default<T>()); }
55
56		template <class T, class LessThan>
57	7944751	void sort(T* array, int size, LessThan lt)
58		{
59	7944751	if (size <= 15)
60	7706503	selectionSort(array, size, lt);
61
62		else{
63	238248	T pivot = array[size / 2];
64		T tmp;
65	238248	int i = -1;
66	238248	int j = size;
67
68	1566685	for(;;){
69	5196502	do i++; while(lt(array[i], pivot));
70	4849597	do j--; while(lt(pivot, array[j]));
71
72	1804933	if (i >= j) break;
73
74	1566685	tmp = array[i]; array[i] = array[j]; array[j] = tmp;
75		}
76
77	238248	sort(array , i , lt);
78	238248	sort(&array[i], size-i, lt);
79		}
80	7944751	}
81		template <class T> static inline void sort(T* array, int size) {
82		sort(array, size, LessThan_default<T>()); }
83
84
85		//=================================================================================================
86		// For 'vec's:
87
88
89	7468255	template <class T, class LessThan> void sort(vec<T>& v, LessThan lt) {
90	7468255	sort((T*)v, v.size(), lt); }
91	3843880	template <class T> void sort(vec<T>& v) {
92	3843880	sort(v, LessThan_default<T>()); }
93
94
95		//=================================================================================================
96		}
97		} // namespace cvc5
98
99		#endif