Function quickSort

src/PyListProxyHandler.cc:1656–1683

Adapted from Kernigan&Ritchie's C book

// Adapted from Kernigan&Ritchie's C book
static void quickSort(PyObject *list, int left, int right, JSContext *cx, JS::HandleFunction callBack) {

  if (left >= right) {
    // base case
    return;
  }

  swapItems(list, left, (left + right) / 2);

  JS::RootedValue leftValue(cx, jsTypeFactory(cx, PyList_GetItem(list, left)));

  int last = left;
  for (int index = left + 1; index <= right; index++) {
    int result = invokeCallBack(list, index, leftValue, cx, callBack);
    if (PyErr_Occurred()) {
      return;
    }
    if (result < 0) {
      swapItems(list, ++last, index);
    }
  }

  swapItems(list, left, last);

  quickSort(list, left, last - 1, cx, callBack);

  quickSort(list, last + 1, right, cx, callBack);
}

// private
static bool js_sort_compare_default(JSContext *cx, unsigned argc, JS::Value *vp) {