/*-*- mode:c;indent-tabs-mode:nil;c-basic-offset:2;tab-width:8;coding:utf-8 -*-│
│vi: set net ft=c ts=2 sts=2 sw=2 fenc=utf-8                                :vi│
╞══════════════════════════════════════════════════════════════════════════════╡
│ Copyright 2023 Justine Alexandra Roberts Tunney                              │
│                                                                              │
│ Permission to use, copy, modify, and/or distribute this software for         │
│ any purpose with or without fee is hereby granted, provided that the         │
│ above copyright notice and this permission notice appear in all copies.      │
│                                                                              │
│ THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL                │
│ WARRANTIES WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED                │
│ WARRANTIES OF MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE             │
│ AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL         │
│ DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR        │
│ PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER               │
│ TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR             │
│ PERFORMANCE OF THIS SOFTWARE.                                                │
╚─────────────────────────────────────────────────────────────────────────────*/
#include "libc/mem/alg.h"
#include "libc/mem/mem.h"
#include "libc/runtime/runtime.h"
#include "libc/str/str.h"

// Credit: Andrew Schein. 2009. Open-source C++ implementation of Radix
//         Sort for double-precision floating points. (2009).

#define HIST_SIZE               (size_t)2048
#define get_byte_0(v)           ((v)&0x7FF)
#define get_byte_1(v)           (((v) >> 11) & 0x7FF)
#define get_byte_2_flip_sign(v) (((unsigned)(v) >> 22) ^ 0x200)

bool radix_sort_int32(int32_t *A, size_t n) {
  int32_t *T, *reader, *writer;
  size_t i, pos, sum0, sum1, sum2, tsum, *b0, *b1, *b2;

  if (n < HIST_SIZE) {
    _intsort(A, n);
    return true;
  }

  if (!(T = (int32_t *)malloc(n * sizeof(int32_t)))) {
    return false;
  }

  if (!(b0 = (size_t *)calloc(HIST_SIZE * 3, sizeof(size_t)))) {
    free(T);
    return false;
  }

  b1 = b0 + HIST_SIZE;
  b2 = b1 + HIST_SIZE;

  for (i = 0; i < n; i++) {
    b0[get_byte_0(A[i])]++;
    b1[get_byte_1(A[i])]++;
    b2[get_byte_2_flip_sign(A[i])]++;
  }

  sum0 = sum1 = sum2 = tsum = 0;

  for (i = 0; i < HIST_SIZE; i++) {
    tsum = b0[i] + sum0;
    b0[i] = sum0 - 1;
    sum0 = tsum;

    tsum = b1[i] + sum1;
    b1[i] = sum1 - 1;
    sum1 = tsum;

    tsum = b2[i] + sum2;
    b2[i] = sum2 - 1;
    sum2 = tsum;
  }

  writer = T;
  reader = A;
  for (i = 0; i < n; i++) {
    pos = get_byte_0(reader[i]);
    writer[++b0[pos]] = reader[i];
  }

  writer = A;
  reader = T;
  for (i = 0; i < n; i++) {
    pos = get_byte_1(reader[i]);
    writer[++b1[pos]] = reader[i];
  }

  writer = T;
  reader = A;
  for (i = 0; i < n; i++) {
    pos = get_byte_2_flip_sign(reader[i]);
    writer[++b2[pos]] = reader[i];
  }

  memcpy(A, T, n * sizeof(int));

  free(b0);
  free(T);
  return true;
}