/usr/include/spooles/Utilities/DVsort.h is in libspooles-dev 2.2-9.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 | /* DVsort.h */
/*--------------------------------------------------------------------*/
/*
-----------------------------------------------------------
The insert and quick sort methods in this file are based on
Jon L. Bentley and M. Douglas McIlroy,
"Engineering a sort function",
Software -- Practice and Experience, vol 23(11), 1249-1265,
November 1993.
This quick sort method uses
1) a median of three medians to find a split value, and
2) split-end partitioning to handle many elements equal
to the split value.
-----------------------------------------------------------
*/
/*--------------------------------------------------------------------*/
/*
----------------------------------------------------------------
sort an array of doubles into ascending order using insert sort
created -- 95nov25, cca
----------------------------------------------------------------
*/
void
DVisortUp (
int n,
double dvec[]
) ;
/*
-----------------------------------------------------------------
sort an array of doubles into descending order using insert sort
created -- 95sep29, cca
-----------------------------------------------------------------
*/
void
DVisortDown (
int n,
double dvec[]
) ;
/*
------------------------------------------
use insert sort to sort a pair or arrays.
on output the first is in ascending order.
dvec1[] is the array of keys
dvec2[] is the companion array
example,
dvec1[] = 5 8 3 2 9
dvec2[] = 1 2 3 4 5
becomes
dvec1[] = 2 3 5 8 9
dvec2[] = 4 3 1 2 5
created -- 95nov25, cca
------------------------------------------
*/
void
DV2isortUp (
int n,
double dvec1[],
double dvec2[]
) ;
/*
-------------------------------------------
use insert sort to sort a pair or arrays.
on output the first is in descending order.
dvec1[] is the array of keys
dvec2[] is the companion array
example,
dvec1[] = 5 8 3 2 9
dvec2[] = 1 2 3 4 5
becomes
dvec1[] = 9 8 5 3 2
dvec2[] = 5 2 1 3 4
created -- 95sep29, cca
-------------------------------------------
*/
void
DV2isortDown (
int n,
double dvec1[],
double dvec2[]
) ;
/*
---------------------------------------------------------------
sort an array of doubles into ascending order using quick sort
created -- 95nov25, cca
---------------------------------------------------------------
*/
void
DVqsortUp (
int n,
double dvec[]
) ;
/*
----------------------------------------------------------------
sort an array of doubles into descending order using quick sort
created -- 95sep29, cca
----------------------------------------------------------------
*/
void
DVqsortDown (
int n,
double dvec[]
) ;
/*
------------------------------------------
use quick sort to sort a pair or arrays.
on output the first is in ascending order.
dvec1[] is the array of keys
dvec2[] is the companion array
example,
dvec1[] = 5 8 3 2 9
dvec2[] = 1 2 3 4 5
becomes
dvec1[] = 2 3 5 8 9
dvec2[] = 4 3 1 2 5
created -- 95sep29, cca
------------------------------------------
*/
void
DV2qsortUp (
int n,
double dvec1[],
double dvec2[]
) ;
/*
-------------------------------------------
use quick sort to sort a pair or arrays.
on output the first is in descending order.
dvec1[] is the array of keys
dvec2[] is the companion array
example,
dvec1[] = 5 8 3 2 9
dvec2[] = 1 2 3 4 5
becomes
dvec1[] = 9 8 5 3 2
dvec2[] = 5 2 1 3 4
created -- 95sep29, cca
-------------------------------------------
*/
void
DV2qsortDown (
int n,
double dvec1[],
double dvec2[]
) ;
/*
----------------------------------------------------
return 1 if elements in array are in ascending order
return 0 otherwise
created -- 95nov25, cca
----------------------------------------------------
*/
int
DVisascending (
int n,
double dvec[]
) ;
/*
-----------------------------------------------------
return 1 if elements in array are in descending order
return 0 otherwise
created -- 95sep29, cca
-----------------------------------------------------
*/
int
DVisdescending (
int n,
double dvec[]
) ;
/*--------------------------------------------------------------------*/
/*
------------------------------------------
use insert sort to sort a pair of arrays.
on output the first is in ascending order.
dvec[] is the array of keys
ivec[] is the companion array
example,
ivec[] = 4 2 7 5 6
dvec[] = 5.0 8.0 3.0 2.0 9.0
becomes
ivec[] = 5 7 4 2 6
dvec[] = 2.0 3.0 5.0 8.0 9.0
created -- 97apr03, cca
------------------------------------------
*/
void
DVIVisortUp (
int n,
double dvec[],
int ivec[]
) ;
/*
-------------------------------------------
use insert sort to sort a pair or arrays.
on output the first is in descending order.
ivec[] is the array of keys
dvec[] is the companion array
example,
ivec[] = 4 2 7 5 6
dvec[] = 5.0 8.0 3.0 2.0 9.0
becomes
ivec[] = 5 7 4 2 6
dvec[] = 2.0 3.0 5.0 8.0 9.0
created -- 95sep29, cca
-------------------------------------------
*/
void
DVIVisortDown (
int n,
double dvec[],
int ivec[]
) ;
/*
------------------------------------------
use quick sort to sort a pair or arrays.
on output the first is in ascending order.
ivec[] is the array of keys
dvec[] is the companion array
example,
ivec[] = 4 2 7 5 6
dvec[] = 5.0 8.0 3.0 2.0 9.0
becomes
ivec[] = 5 7 4 2 6
dvec[] = 2.0 3.0 5.0 8.0 9.0
created -- 97apr03, cca
------------------------------------------
*/
void
DVIVqsortUp (
int n,
double dvec[],
int ivec[]
) ;
/*
-------------------------------------------
use quick sort to sort a pair or arrays.
on output the first is in descending order.
ivec[] is the array of keys
dvec[] is the companion array
example,
ivec[] = 4 2 7 5 6
dvec[] = 5.0 8.0 3.0 2.0 9.0
becomes
ivec[] = 5 7 4 2 6
dvec[] = 2.0 3.0 5.0 8.0 9.0
created -- 97apr03, cca
-------------------------------------------
*/
void
DVIVqsortDown (
int n,
double dvec[],
int ivec[]
) ;
/*--------------------------------------------------------------------*/
|