All Downloads are FREE. Search and download functionalities are using the official Maven repository.

apoc.util.SortedArraySet Maven / Gradle / Ivy

There is a newer version: 5.25.1
Show newest version
/*
 * Copyright (c) "Neo4j"
 * Neo4j Sweden AB [http://neo4j.com]
 *
 * This file is part of Neo4j.
 *
 * Licensed 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.
 */
package apoc.util;

import java.lang.reflect.Array;
import java.util.Arrays;

/**
 * @author mh
 * @since 22.06.17
 */
public class SortedArraySet> {
    private static final int GROWTH = 10;
    T[] data;
    private int capacity;
    private int size;

    public SortedArraySet(Class type, int capacity) {
        this.capacity = capacity;
        this.size = 0;
        //noinspection unchecked
        this.data = (T[]) Array.newInstance(type, capacity);
    }

    public T get(int idx) {

        return data[idx];
    }

    public T find(T key) {
        if (key == null) throw new IllegalArgumentException("lookup key must not be null");
        if (size == 0) return null;
        int offset = Arrays.binarySearch(data, 0, size, key);
        return offset < 0 ? null : data[offset];
    }

    public T add(T value) {
        int offset = Arrays.binarySearch(data, 0, size, value);
        if (offset < 0) {
            int idx = -(offset + 1);
            if (size == capacity) {
                capacity += GROWTH;
                data = Arrays.copyOf(data, capacity);
            }
            if (idx != size) {
                System.arraycopy(data, idx, data, idx + 1, size - idx);
            }
            size++;
            data[idx] = value;
            return value;
        } else {
            return data[offset];
        }
    }

    public int getCapacity() {
        return capacity;
    }

    public int getSize() {
        return size;
    }

    public T[] items() {
        return Arrays.copyOf(data, size);
    }
}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy