Mercurial > hg > graal-compiler

comparison src/share/vm/utilities/quickSort.cpp @ 18041:52b4284cb496

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Merge with jdk8u20-b26
author Gilles Duboscq <duboscq@ssw.jku.at>
date Wed, 15 Oct 2014 16:02:50 +0200
parents 836a62f43af9 78bbf4d43a14
children
comparison
equal deleted inserted replaced
17606:45d7b2c7029d 18041:52b4284cb496
1 /* 1 /*
2 * Copyright (c) 2011, 2013, Oracle and/or its affiliates. All rights reserved. 2 * Copyright (c) 2011, 2014, Oracle and/or its affiliates. All rights reserved.
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
4 * 4 *
5 * This code is free software; you can redistribute it and/or modify it 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 6 * under the terms of the GNU General Public License version 2 only, as
7 * published by the Free Software Foundation. 7 * published by the Free Software Foundation.
75 void QuickSort::print_array(const char* prefix, int* array, int length) { 75 void QuickSort::print_array(const char* prefix, int* array, int length) {
76 tty->print("%s:", prefix); 76 tty->print("%s:", prefix);
77 for (int i = 0; i < length; i++) { 77 for (int i = 0; i < length; i++) {
78 tty->print(" %d", array[i]); 78 tty->print(" %d", array[i]);
79 } 79 }
80 tty->print_cr(""); 80 tty->cr();
81 } 81 }
82 82
83 bool QuickSort::compare_arrays(int* actual, int* expected, int length) { 83 bool QuickSort::compare_arrays(int* actual, int* expected, int length) {
84 for (int i = 0; i < length; i++) { 84 for (int i = 0; i < length; i++) {
85 if (actual[i] != expected[i]) { 85 if (actual[i] != expected[i]) {