Function simplicity_rsort

src/simplicity/rsort.c:249–255

Sorts an array of pointers to 'sha256_midstate's in place in memcmp order. * If malloc fails, returns false. * Otherwise, returns true. * * The time complexity of rsort is O('len'). * * We are sorting in memcmp order, which is the lexicographical order of the object representation, i.e. the order that one * gets when casting 'sha256_midstate' to a 'unsigned char[]'. This representation is i

 * Precondition: For all 0 <= i < len, NULL != a[i];
 */
bool simplicity_rsort(const sha256_midstate** a, uint_fast32_t len) {
  uint32_t *stack = simplicity_malloc(((CHAR_COUNT - 1)*(sizeof((*a)->s)) + 1) * sizeof(uint32_t));
  if (!stack) return false;
  rsort_ex(a, len, NULL, stack);
  simplicity_free(stack);
  return true;
}

/* Searches for duplicates in an array of 'sha256_midstate's.
 * If malloc fails, returns -1.