GCC Code Coverage Report
Directory: . Exec Total Coverage
File: src/prop/bvminisat/mtl/Sort.h Lines: 27 27 100.0 %
Date: 2021-03-23 Branches: 30 32 93.8 %

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 BVMinisat_Sort_h
22
#define BVMinisat_Sort_h
23
24
#include "prop/bvminisat/mtl/Vec.h"
25
26
//=================================================================================================
27
// Some sorting algorithms for vec's
28
29
30
namespace CVC4 {
31
namespace BVMinisat {
32
33
template<class T>
34
struct LessThan_default {
35
22801835
    bool operator () (T x, T y) { return x < y; }
36
};
37
38
39
template <class T, class LessThan>
40
7046792
void selectionSort(T* array, int size, LessThan lt)
41
{
42
    int     i, j, best_i;
43
    T       tmp;
44
45
19060110
    for (i = 0; i < size-1; i++){
46
12013318
        best_i = i;
47
33456704
        for (j = i+1; j < size; j++){
48
21443386
            if (lt(array[j], array[best_i]))
49
6147158
                best_i = j;
50
        }
51
12013318
        tmp = array[i]; array[i] = array[best_i]; array[best_i] = tmp;
52
    }
53
7046792
}
54
template <class T> static inline void selectionSort(T* array, int size) {
55
    selectionSort(array, size, LessThan_default<T>()); }
56
57
template <class T, class LessThan>
58
7105853
void sort(T* array, int size, LessThan lt)
59
{
60
7105853
    if (size <= 15)
61
7046792
        selectionSort(array, size, lt);
62
63
    else{
64
59061
        T           pivot = array[size / 2];
65
        T           tmp;
66
59061
        int         i = -1;
67
59061
        int         j = size;
68
69
254522
        for(;;){
70
999420
            do i++; while(lt(array[i], pivot));
71
958776
            do j--; while(lt(pivot, array[j]));
72
73
313583
            if (i >= j) break;
74
75
254522
            tmp = array[i]; array[i] = array[j]; array[j] = tmp;
76
        }
77
78
59061
        sort(array    , i     , lt);
79
59061
        sort(&array[i], size-i, lt);
80
    }
81
7105853
}
82
template <class T> static inline void sort(T* array, int size) {
83
    sort(array, size, LessThan_default<T>()); }
84
85
86
//=================================================================================================
87
// For 'vec's:
88
89
90
6987731
template <class T, class LessThan> void sort(vec<T>& v, LessThan lt) {
91
6987731
    sort((T*)v, v.size(), lt); }
92
6987701
template <class T> void sort(vec<T>& v) {
93
6987701
    sort(v, LessThan_default<T>()); }
94
95
96
//=================================================================================================
97
} /* CVC4::BVMinisat namespace */
98
} /* CVC4 namespace */
99
100
#endif