< prev index next >

openjfx9/modules/javafx.graphics/src/main/java/com/sun/marlin/MergeSort.java

Print this page


   1 /*
   2  * Copyright (c) 2009, 2015, 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.  Oracle designates this
   8  * particular file as subject to the "Classpath" exception as provided
   9  * by Oracle in the LICENSE file that accompanied this code.
  10  *
  11  * This code is distributed in the hope that it will be useful, but WITHOUT
  12  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  13  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  14  * version 2 for more details (a copy is included in the LICENSE file that
  15  * accompanied this code).
  16  *
  17  * You should have received a copy of the GNU General Public License version
  18  * 2 along with this work; if not, write to the Free Software Foundation,
  19  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  20  *
  21  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  22  * or visit www.oracle.com if you need additional information or have any
  23  * questions.
  24  */
  25 
  26 package sun.java2d.marlin;
  27 
  28 /**
  29  * MergeSort adapted from (OpenJDK 8) java.util.Array.legacyMergeSort(Object[])
  30  * to swap two arrays at the same time (x & y)
  31  * and use external auxiliary storage for temporary arrays
  32  */
  33 final class MergeSort {
  34 
  35     // insertion sort threshold
  36     public static final int INSERTION_SORT_THRESHOLD = 14;
  37 
  38     /**
  39      * Modified merge sort:
  40      * Input arrays are in both auxX/auxY (sorted: 0 to insertionSortIndex)
  41      *                     and x/y (unsorted: insertionSortIndex to toIndex)
  42      * Outputs are stored in x/y arrays
  43      */
  44     static void mergeSortNoCopy(final int[] x, final int[] y,
  45                                 final int[] auxX, final int[] auxY,
  46                                 final int toIndex,


   1 /*
   2  * Copyright (c) 2009, 2016, 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.  Oracle designates this
   8  * particular file as subject to the "Classpath" exception as provided
   9  * by Oracle in the LICENSE file that accompanied this code.
  10  *
  11  * This code is distributed in the hope that it will be useful, but WITHOUT
  12  * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  13  * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  14  * version 2 for more details (a copy is included in the LICENSE file that
  15  * accompanied this code).
  16  *
  17  * You should have received a copy of the GNU General Public License version
  18  * 2 along with this work; if not, write to the Free Software Foundation,
  19  * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
  20  *
  21  * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
  22  * or visit www.oracle.com if you need additional information or have any
  23  * questions.
  24  */
  25 
  26 package com.sun.marlin;
  27 
  28 /**
  29  * MergeSort adapted from (OpenJDK 8) java.util.Array.legacyMergeSort(Object[])
  30  * to swap two arrays at the same time (x & y)
  31  * and use external auxiliary storage for temporary arrays
  32  */
  33 final class MergeSort {
  34 
  35     // insertion sort threshold
  36     public static final int INSERTION_SORT_THRESHOLD = 14;
  37 
  38     /**
  39      * Modified merge sort:
  40      * Input arrays are in both auxX/auxY (sorted: 0 to insertionSortIndex)
  41      *                     and x/y (unsorted: insertionSortIndex to toIndex)
  42      * Outputs are stored in x/y arrays
  43      */
  44     static void mergeSortNoCopy(final int[] x, final int[] y,
  45                                 final int[] auxX, final int[] auxY,
  46                                 final int toIndex,


< prev index next >