1 /*
   2  * Copyright (c) 2014, Oracle and/or its affiliates. All rights reserved.
   3  * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
   4  *
   5  * This code is free software; you can redistribute it and/or modify it
   6  * under the terms of the GNU General Public License version 2 only, as
   7  * published by the Free Software Foundation.
   8  *
   9  * This code is distributed in the hope that it will be useful, but WITHOUT
  10  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  11  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  12  * version 2 for more details (a copy is included in the LICENSE file that
  13  * accompanied this code).
  14  *
  15  * You should have received a copy of the GNU General Public License version
  16  * 2 along with this work; if not, write to the Free Software Foundation,
  17  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  18  *
  19  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  20  * or visit www.oracle.com if you need additional information or have any
  21  * questions.
  22  *
  23  */
  24 
  25 #include "prims/jvm.h"
  26 #include "utilities/quickSort.hpp"
  27 #include "unittest.hpp"
  28 
  29 static int int_comparator(int a, int b) {
  30   if (a == b) {
  31     return 0;
  32   } else if (a < b) {
  33     return -1;
  34   }
  35 
  36   // a > b
  37   return 1;
  38 }
  39 
  40 TEST(utilities, quicksort) {
  41   int test_array[] = {3,2,1};
  42   QuickSort::sort(test_array, 3, int_comparator, false);
  43 
  44   ASSERT_EQ(1, test_array[0]);
  45   ASSERT_EQ(2, test_array[1]);
  46   ASSERT_EQ(3, test_array[2]);
  47 }