yosys-master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
Sort.h
Go to the documentation of this file.
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 "Vec.h"
25 
26 //=================================================================================================
27 // Some sorting algorithms for vec's
28 
29 
30 namespace Minisat {
31 
32 template<class T>
34  bool operator () (T x, T y) { return x < y; }
35 };
36 
37 
38 template <class T, class LessThan>
39 void selectionSort(T* array, int size, LessThan lt)
40 {
41  int i, j, best_i;
42  T tmp;
43 
44  for (i = 0; i < size-1; i++){
45  best_i = i;
46  for (j = i+1; j < size; j++){
47  if (lt(array[j], array[best_i]))
48  best_i = j;
49  }
50  tmp = array[i]; array[i] = array[best_i]; array[best_i] = tmp;
51  }
52 }
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 void sort(T* array, int size, LessThan lt)
58 {
59  if (size <= 15)
60  selectionSort(array, size, lt);
61 
62  else{
63  T pivot = array[size / 2];
64  T tmp;
65  int i = -1;
66  int j = size;
67 
68  for(;;){
69  do i++; while(lt(array[i], pivot));
70  do j--; while(lt(pivot, array[j]));
71 
72  if (i >= j) break;
73 
74  tmp = array[i]; array[i] = array[j]; array[j] = tmp;
75  }
76 
77  sort(array , i , lt);
78  sort(&array[i], size-i, lt);
79  }
80 }
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 template <class T, class LessThan> void sort(vec<T>& v, LessThan lt) {
90  sort((T*)v, v.size(), lt); }
91 template <class T> void sort(vec<T>& v) {
92  sort(v, LessThan_default<T>()); }
93 
94 
95 //=================================================================================================
96 }
97 
98 #endif
void sort(T *array, int size, LessThan lt)
Definition: Sort.h:57
void selectionSort(T *array, int size, LessThan lt)
Definition: Sort.h:39
Size size(void) const
Definition: Vec.h:64
bool operator()(T x, T y)
Definition: Sort.h:34