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 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545
|
/*
# C-Header for sorting and ordering
# S3 atomic 64bit integers for R
# (c) 2011, 2012 Jens Oehlschägel
# Licence: GPL2
# Provided 'as is', use at your own risk
# Created: 2011-12-11
# Last changed: 2012-10-03
*/
#ifndef _SORT64_INLCUDED
#define _SORT64_INLCUDED
/*****************************************************************************/
/** **/
/** MODULES USED **/
/** **/
/*****************************************************************************/
#include <R.h>
#include <Rdefines.h>
//#include <Rinternals.h>
//CRAN disallows rand: #include <stdlib.h> // rand
#include "integer64.h"
//#include "timing.h"
/*****************************************************************************/
/** **/
/** DEFINITIONS AND MACROS **/
/** **/
/*****************************************************************************/
#define DEBUG_COUNTING 0
#define DEBUG_INIT // compare_counter = 0; move_counter = 0; //initTicks();
//#define DEBUG_RETURN getNewTicks()
#define DEBUG_RETURN ret;
// #define DEBUG_RETURN move_counter;
#define DEBUG_DONE Rprintf("compare_counter=%d move_counter=%d\n", compare_counter, move_counter); R_FlushConsole(); //doneTicks();
#if defined(WIN32) || defined(WIN64) || defined(_WIN32_) || defined(_WIN64_) || defined(__WIN32__) || defined(__WIN64__)
#define MULTI_THREADING 0
#else
#define MULTI_THREADING 1
#endif
#if MULTI_THREADING
#include <pthread.h>
#endif
// dummy for counting comp ops
#define COUNTLESS
#define LESS(A,B) ((A)<(B))
#define GREATER(A, B) LESS((B), (A))
//#define MOVE(TO,FROM){move_counter++; TO=FROM;}
#define MOVE(TO,FROM) TO=FROM;
#define EXCH(A,B,t) {MOVE(t,A) MOVE(A,B) MOVE(B,t)}
#define COMPEXCH(A,B,t) if (LESS(B,A)) EXCH(A,B,t)
#define KEY(A) (data[A])
#define KEYLESS(A,B) (LESS(KEY(A),KEY(B)))
#define KEYCOMPEXCH(A,B,t) if (KEYLESS(B,A)) EXCH(A,B,t)
#define COMPEXCHi(A,B,t,Ai,Bi,ti) if (LESS(B,A)) {EXCH(A,B,t) EXCH(Ai,Bi,ti)}
#define INSERTIONSORT_LIMIT_MERGE 16
#define INSERTIONSORT_LIMIT_QUICK 16
/*****************************************************************************/
/** **/
/** TYPEDEFS AND STRUCTURES **/
/** **/
/*****************************************************************************/
typedef int IndexT;
typedef long long ValueT;
typedef unsigned long long UValueT;
/*****************************************************************************/
/** **/
/** EXPORTED VARIABLES **/
/** **/
/*****************************************************************************/
#ifndef _SORT64_C_SRC
extern IndexT compare_counter;
extern IndexT move_counter;
#endif
/*****************************************************************************/
/** **/
/** EXPORTED FUNCTIONS **/
/** **/
/*****************************************************************************/
void R_Busy (int which);
// post sorting NA handling
int ram_integer64_fixsortNA(
ValueT *data // RETURNED: pointer to data vector
, IndexT n // length of data vector
, int has_na // 0 for pure doubles, 1 if NA or NaN can be present
, int na_last // 0 for placing NA NaN left, 1 for placing NA NaN right
, int decreasing // 0 for ascending, 1 for descending (must match the same parameter in sorting)
);
// post sortordering NA handling
int ram_integer64_fixsortorderNA(
ValueT *data // RETURNED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT n // length of vectors
, int has_na // 0 for pure doubles, 1 if NA or NaN can be present
, int na_last // 0 for placing NA NaN left, 1 for placing NA NaN right
, int decreasing // 0 for ascending, 1 for descending (must match the same parameter in sorting)
, IndexT *auxindex // MODIFIED: pointer to auxilliary index vector
);
// post ordering NA handling
int ram_integer64_fixorderNA(
ValueT *data // UNCHANGED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT n // length of vectors
, int has_na // 0 for pure doubles, 1 if NA or NaN can be present
, int na_last // 0 for placing NA NaN left, 1 for placing NA NaN right
, int decreasing // 0 for ascending, 1 for descending (must match the same parameter in sorting)
, IndexT *auxindex // MODIFIED: pointer to auxilliary index vector
);
// ascending insertion sorting
void ram_integer64_insertionsort_asc(
ValueT *data // RETURNED: pointer to data vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// ascending insertion sortordering
void ram_integer64_insertionsortorder_asc(
ValueT *data // RETURNED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// ascending insertion sortordering
void ram_integer64_insertionorder_asc(
ValueT *data // UNCHANGED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// descending insertion sorting
void ram_integer64_insertionsort_desc(
ValueT *data // RETURNED: pointer to data vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// descending insertion sortordering
void ram_integer64_insertionsortorder_desc(
ValueT *data // RETURNED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// descending insertion sortordering
void ram_integer64_insertionorder_desc(
ValueT *data // UNCHANGED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// ascending shell sorting
void ram_integer64_shellsort_asc(
ValueT *data // RETURNED: pointer to data vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// ascending shell sortordering
void ram_integer64_shellsortorder_asc(
ValueT *data // RETURNED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// ascending shell sortordering
void ram_integer64_shellorder_asc(
ValueT *data // UNCHANGED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// descending shell sorting
void ram_integer64_shellsort_desc(
ValueT *data // RETURNED: pointer to data vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// descending shell sortordering
void ram_integer64_shellsortorder_desc(
ValueT *data // RETURNED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// descending shell sortordering
void ram_integer64_shellorder_desc(
ValueT *data // UNCHANGED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// ascending merge for sorting
void ram_integer64_sortmerge_asc(
ValueT *c // RETURNED: pointer to merge target data vector
, ValueT *a // UNCHANGED: pointer to merge source data vector a
, ValueT *b // UNCHANGED: pointer to merge source data vector b
, IndexT na // number of elements in merge source vector a
, IndexT nb // number of elements in merge source vector b
);
// ascending merge for ordering
void ram_integer64_ordermerge_asc(
ValueT *data // UNCHANGED: pointer to data vector
, IndexT *c // RETURNED: pointer to merge target index vector
, IndexT *a // UNCHANGED: pointer to merge source index vector a
, IndexT *b // UNCHANGED: pointer to merge source index vector b
, IndexT na // number of elements in merge source vector a
, IndexT nb // number of elements in merge source vector b
);
// ascending merge for sortordering
void ram_integer64_sortordermerge_asc(
ValueT *c // RETURNED: pointer to merge target data vector
, ValueT *a // UNCHANGED: pointer to merge source data vector a
, ValueT *b // UNCHANGED: pointer to merge source data vector b
, IndexT *ci // RETURNED: pointer to merge target index vector
, IndexT *ai // UNCHANGED: pointer to merge source index vector a
, IndexT *bi // UNCHANGED: pointer to merge source index vector b
, IndexT na // number of elements in merge source vector a
, IndexT nb // number of elements in merge source vector b
);
// descending merge for sorting
void ram_integer64_sortmerge_desc(
ValueT *c // RETURNED: pointer to merge target data vector
, ValueT *a // UNCHANGED: pointer to merge source data vector a
, ValueT *b // UNCHANGED: pointer to merge source data vector b
, IndexT na // number of elements in merge source vector a
, IndexT nb // number of elements in merge source vector b
);
// descending merge for ordering
void ram_integer64_ordermerge_desc(
ValueT *data // UNCHANGED: pointer to data vector
, IndexT *c // RETURNED: pointer to merge target index vector
, IndexT *a // UNCHANGED: pointer to merge source index vector a
, IndexT *b // UNCHANGED: pointer to merge source index vector b
, IndexT na // number of elements in merge source vector a
, IndexT nb // number of elements in merge source vector b
);
// descending merge for sortordering
void ram_integer64_sortordermerge_desc(
ValueT *c // RETURNED: pointer to merge target data vector
, ValueT *a // UNCHANGED: pointer to merge source data vector a
, ValueT *b // UNCHANGED: pointer to merge source data vector b
, IndexT *ci // RETURNED: pointer to merge target index vector
, IndexT *ai // UNCHANGED: pointer to merge source index vector a
, IndexT *bi // UNCHANGED: pointer to merge source index vector b
, IndexT na // number of elements in merge source vector a
, IndexT nb // number of elements in merge source vector b
);
// merge sorts b ascending and leaves result in a (following Sedgewick 8.4 Mergesort with no copying)
void ram_integer64_mergesort_asc_rec(
ValueT *a // RETURNED: pointer to target data vector
, ValueT *b // MODIFIED: pointer to source data vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// merge sorting b ascending leaving result in a (following Sedgewick 8.4 Mergesort with no copying)
void ram_integer64_mergeorder_asc_rec(
ValueT *data // UNCHANGED: pointer to data vector
, IndexT *a // RETURNED: pointer to target index vector
, IndexT *b // MODIFIED: pointer to source index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// merge sortordering b ascending leaving result in a (following Sedgewick 8.4 Mergesort with no copying)
void ram_integer64_mergesortorder_asc_rec(
ValueT *a // RETURNED: pointer to target data vector
, ValueT *b // MODIFIED: pointer to source data vector
, IndexT *ai // RETURNED: pointer to target index vector
, IndexT *bi // MODIFIED: pointer to source index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// merge sorts b descending and leaves result in a (following Sedgewick 8.4 Mergesort with no copying)
void ram_integer64_mergesort_desc_rec(
ValueT *a // RETURNED: pointer to target data vector
, ValueT *b // MODIFIED: pointer to source data vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// merge sorting b descending leaving result in a (following Sedgewick 8.4 Mergesort with no copying)
void ram_integer64_mergeorder_desc_rec(
ValueT *data // UNCHANGED: pointer to data vector
, IndexT *a // RETURNED: pointer to target index vector
, IndexT *b // MODIFIED: pointer to source index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// merge sortordering b descending leaving result in a (following Sedgewick 8.4 Mergesort with no copying)
void ram_integer64_mergesortorder_desc_rec(
ValueT *a // RETURNED: pointer to target data vector
, ValueT *b // MODIFIED: pointer to source data vector
, IndexT *ai // RETURNED: pointer to target index vector
, IndexT *bi // MODIFIED: pointer to source index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// ascending partitioning of data between l and r around pivot in r for quick sorting
IndexT ram_integer64_quicksortpart_asc_no_sentinels(
ValueT *data // RETURNED: pointer to data
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// ascending partitioning of data between l and r around pivot in r for quick ordering
IndexT ram_integer64_quickorderpart_asc_no_sentinels(
ValueT *data // UNCHANGED: pointer to data
, IndexT *index // RETURNED: pointer to index
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// ascending partitioning of data between l and r around pivot in r for quick sortordering
IndexT ram_integer64_quicksortorderpart_asc_no_sentinels(
ValueT *data // RETURNED: pointer to data
, IndexT *index // RETURNED: pointer to index
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// descending partitioning of data between l and r around pivot in r for quick sorting
IndexT ram_integer64_quicksortpart_desc_no_sentinels(
ValueT *data // RETURNED: pointer to data
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// descending partitioning of data between l and r around pivot in r for quick ordering
IndexT ram_integer64_quickorderpart_desc_no_sentinels(
ValueT *data // UNCHANGED: pointer to data
, IndexT *index // RETURNED: pointer to index
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// descending partitioning of data between l and r around pivot in r for quick sortordering
IndexT ram_integer64_quicksortorderpart_desc_no_sentinels(
ValueT *data // RETURNED: pointer to data
, IndexT *index // RETURNED: pointer to index
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// ascending quick sorting
void ram_integer64_quicksort_asc_mdr3_no_sentinels(
ValueT *data // RETURNED: pointer to data vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// ascending quick sortordering
void ram_integer64_quicksortorder_asc_mdr3_no_sentinels(
ValueT *data // RETURNED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// ascending quick sortordering
void ram_integer64_quickorder_asc_mdr3_no_sentinels(
ValueT *data // UNCHANGED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// descending quick sorting
void ram_integer64_quicksort_desc_mdr3_no_sentinels(
ValueT *data // RETURNED: pointer to data vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// descending quick sortordering
void ram_integer64_quicksortorder_desc_mdr3_no_sentinels(
ValueT *data // RETURNED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// descending quick sortordering
void ram_integer64_quickorder_desc_mdr3_no_sentinels(
ValueT *data // UNCHANGED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
);
// ascending intro sorting (switches to shellsort when no restlevels left)
void ram_integer64_quicksort_asc_intro(
ValueT *data // RETURNED: pointer to data vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
, int restlevel // number of remaining levels for quicksort recursion before switching to shellsort
);
// ascending intro sortordering (switches to shellsort when no restlevels left)
void ram_integer64_quicksortorder_asc_intro(
ValueT *data // RETURNED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
, int restlevel // number of remaining levels for quicksort recursion before switching to shellsort
);
// ascending intro sortordering (switches to shellsort when no restlevels left)
void ram_integer64_quickorder_asc_intro(
ValueT *data // UNCHANGED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
, int restlevel // number of remaining levels for quicksort recursion before switching to shellsort
);
// descending intro sorting (switches to shellsort when no restlevels left)
void ram_integer64_quicksort_desc_intro(
ValueT *data // RETURNED: pointer to data vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
, int restlevel // number of remaining levels for quicksort recursion before switching to shellsort
);
// descending intro sortordering (switches to shellsort when no restlevels left)
void ram_integer64_quicksortorder_desc_intro(
ValueT *data // RETURNED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
, int restlevel // number of remaining levels for quicksort recursion before switching to shellsort
);
// descending intro sortordering (switches to shellsort when no restlevels left)
void ram_integer64_quickorder_desc_intro(
ValueT *data // UNCHANGED: pointer to data vector
, IndexT *index // RETURNED: pointer to index vector
, IndexT l // leftmost position to be sorted
, IndexT r // rightmost position to be sorted
, int restlevel // number of remaining levels for quicksort recursion before switching to shellsort
);
// LSB radix sorting
void ram_integer64_radixsort(
UValueT * data // RETURNED: pointer to data vector coerced to unsigned
, UValueT * auxdata // MODIFIED: pointer to auxilliary data vector coerced to unsigned
, IndexT * stats // MODIFIED: pointer to counting vector with nradixes*(pow(2, radixbits)+1) elements
, IndexT ** pstats // MODIFIED: pointer to vector of pointers with nradixes elements
, IndexT n // number of elements in data and auxdata
, int nradixes // number of radixes where nradixes*radixbits==total number of bits
, int radixbits // number of bits in radix where nradixes*radixbits==total number of bits
, Rboolean decreasing // one of {0=ascending, 1=descending}
);
// LSB radix ordering
void ram_integer64_radixorder(
UValueT * data // UNCHANGED: pointer to data vector
, IndexT * index // RETURNED: pointer to index vector
, IndexT * auxindex // MODIFIED: pointer to auxilliary index vector
, IndexT * stats // MODIFIED: pointer to counting vector with nradixes*(pow(2, radixbits)+1) elements
, IndexT ** pstats // MODIFIED: pointer to vector of pointers with nradixes elements
, IndexT n // number of elements in data and auxdata
, int nradixes // number of radixes where nradixes*radixbits==total number of bits
, int radixbits // number of bits in radix where nradixes*radixbits==total number of bits
, Rboolean decreasing // one of {0=ascending, 1=descending}
);
// LSB radix sortordering
void ram_integer64_radixsortorder(
UValueT * data // RETURNED: pointer to data vector coerced to unsigned
, UValueT * auxdata // MODIFIED: pointer to auxilliary data vector coerced to unsigned
, IndexT * index // RETURNED: pointer to index vector
, IndexT * auxindex // MODIFIED: pointer to auxilliary index vector
, IndexT * stats // MODIFIED: pointer to counting vector with nradixes*(pow(2, radixbits)+1) elements
, IndexT ** pstats // MODIFIED: pointer to vector of pointers with nradixes elements
, IndexT n // number of elements in data and auxdata
, int nradixes // number of radixes where nradixes*radixbits==total number of bits
, int radixbits // number of bits in radix where nradixes*radixbits==total number of bits
, Rboolean decreasing // one of {0=ascending, 1=descending}
);
#endif
/*****************************************************************************/
/** **/
/** EOF **/
/** **/
/*****************************************************************************/
|