src/share/classes/com/sun/tools/javac/util/ArrayUtils.java

changeset 0
959103a6100f
child 2525
2eb010b6cb22
     1.1 --- /dev/null	Thu Jan 01 00:00:00 1970 +0000
     1.2 +++ b/src/share/classes/com/sun/tools/javac/util/ArrayUtils.java	Wed Apr 27 01:34:52 2016 +0800
     1.3 @@ -0,0 +1,88 @@
     1.4 +/*
     1.5 + * Copyright (c) 1999, 2013, Oracle and/or its affiliates. All rights reserved.
     1.6 + * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
     1.7 + *
     1.8 + * This code is free software; you can redistribute it and/or modify it
     1.9 + * under the terms of the GNU General Public License version 2 only, as
    1.10 + * published by the Free Software Foundation.  Oracle designates this
    1.11 + * particular file as subject to the "Classpath" exception as provided
    1.12 + * by Oracle in the LICENSE file that accompanied this code.
    1.13 + *
    1.14 + * This code is distributed in the hope that it will be useful, but WITHOUT
    1.15 + * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
    1.16 + * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
    1.17 + * version 2 for more details (a copy is included in the LICENSE file that
    1.18 + * accompanied this code).
    1.19 + *
    1.20 + * You should have received a copy of the GNU General Public License version
    1.21 + * 2 along with this work; if not, write to the Free Software Foundation,
    1.22 + * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
    1.23 + *
    1.24 + * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
    1.25 + * or visit www.oracle.com if you need additional information or have any
    1.26 + * questions.
    1.27 + */
    1.28 +
    1.29 +package com.sun.tools.javac.util;
    1.30 +
    1.31 +import java.lang.reflect.Array;
    1.32 +
    1.33 +/** <p><b>This is NOT part of any supported API.
    1.34 + *  If you write code that depends on this, you do so at your own risk.
    1.35 + *  This code and its internal interfaces are subject to change or
    1.36 + *  deletion without notice.</b>
    1.37 + */
    1.38 +public class ArrayUtils {
    1.39 +
    1.40 +    private static int calculateNewLength(int currentLength, int maxIndex) {
    1.41 +        while (currentLength < maxIndex + 1)
    1.42 +            currentLength = currentLength * 2;
    1.43 +        return currentLength;
    1.44 +    }
    1.45 +
    1.46 +    public static <T> T[] ensureCapacity(T[] array, int maxIndex) {
    1.47 +        if (maxIndex < array.length) {
    1.48 +            return array;
    1.49 +        } else {
    1.50 +            int newLength = calculateNewLength(array.length, maxIndex);
    1.51 +            @SuppressWarnings("unchecked")
    1.52 +            T[] result = (T[]) Array.newInstance(array.getClass().getComponentType(), newLength);
    1.53 +            System.arraycopy(array, 0, result, 0, array.length);
    1.54 +            return result;
    1.55 +        }
    1.56 +    }
    1.57 +
    1.58 +    public static byte[] ensureCapacity(byte[] array, int maxIndex) {
    1.59 +        if (maxIndex < array.length) {
    1.60 +            return array;
    1.61 +        } else {
    1.62 +            int newLength = calculateNewLength(array.length, maxIndex);
    1.63 +            byte[] result = new byte[newLength];
    1.64 +            System.arraycopy(array, 0, result, 0, array.length);
    1.65 +            return result;
    1.66 +        }
    1.67 +    }
    1.68 +
    1.69 +    public static char[] ensureCapacity(char[] array, int maxIndex) {
    1.70 +        if (maxIndex < array.length) {
    1.71 +            return array;
    1.72 +        } else {
    1.73 +            int newLength = calculateNewLength(array.length, maxIndex);
    1.74 +            char[] result = new char[newLength];
    1.75 +            System.arraycopy(array, 0, result, 0, array.length);
    1.76 +            return result;
    1.77 +        }
    1.78 +    }
    1.79 +
    1.80 +    public static int[] ensureCapacity(int[] array, int maxIndex) {
    1.81 +        if (maxIndex < array.length) {
    1.82 +            return array;
    1.83 +        } else {
    1.84 +            int newLength = calculateNewLength(array.length, maxIndex);
    1.85 +            int[] result = new int[newLength];
    1.86 +            System.arraycopy(array, 0, result, 0, array.length);
    1.87 +            return result;
    1.88 +        }
    1.89 +    }
    1.90 +
    1.91 +}

mercurial