Main.java Source code

Introduction

Here is the source code for Main.java

Source

//package com.java2s;
/**
 * Licensed to the Apache Software Foundation (ASF) under one
 * or more contributor license agreements.  See the NOTICE file
 * distributed with this work for additional information
 * regarding copyright ownership.  The ASF licenses this file
 * to you under the Apache License, Version 2.0 (the
 * "License"); you may not use this file except in compliance
 * with the License.  You may obtain a copy of the License at
 *
 *   http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing,
 * software distributed under the License is distributed on an
 * "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY
 * KIND, either express or implied.  See the License for the
 * specific language governing permissions and limitations
 * under the License.
 */

import java.lang.reflect.Array;

public class Main {
    public static <E> E[] arrayRemove(E[] array, E elementToRemove) {
        @SuppressWarnings("unchecked")
        E[] result = (E[]) arrayRemoveInternal(array, elementToRemove);
        return result;
    }

    public static Object arrayRemove(Object array, Object elementToRemove) {
        return arrayRemoveInternal(array, elementToRemove);
    }

    private static Object arrayRemoveInternal(Object array, Object elementToRemove) {
        boolean found = false;
        final int oldLength = Array.getLength(array);
        if (oldLength == 0) {
            return array;
        }
        final int newLength = oldLength - 1;
        final Object result = Array.newInstance(array.getClass().getComponentType(), newLength);
        int nextIndex = 0;
        for (int i = 0; i < oldLength; i++) {
            final Object e = Array.get(array, i);
            if (e.equals(elementToRemove)) {
                found = true;
            } else {
                if (nextIndex == newLength) {
                    break;
                }
                Array.set(result, nextIndex, e);
                nextIndex++;
            }
        }
        if (!found) {
            return array;
        }
        return result;
    }
}