org.conqat.lib.commons.collections.ManagedIntArray Maven / Gradle / Ivy

Show more of this group Show more artifacts with this name
Show all versions of teamscale-lib-commons Show documentation

Provides common utility functions

There is a newer version: 2024.7.2

Show newest version

/*
 * Copyright (c) CQSE GmbH
 *
 * 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 org.conqat.lib.commons.collections;

import java.io.Serializable;

import org.conqat.lib.commons.test.IndexValueClass;

import com.fasterxml.jackson.annotation.JsonProperty;

/**
 * A class containing an int array that is managed in the sense that it can grow dynamically (using
 * exponential growth). It is useful for cases where an ArrayList seems like overkill due
 * to the high memory footprint of the Integer objects and the amount of work performed for auto
 * (un)boxing. Note however, that a subclass has full access to the internals and thus might cause
 * chaos.
 */
@IndexValueClass
public class ManagedIntArray implements Serializable {

	private static final long serialVersionUID = 1L;

	/** The current size of the array. */
	@JsonProperty("size")
	protected int size = 0;

	/** The actual array. */
	@JsonProperty("array")
	protected int[] array = new int[8];

	/** Add space for a single element to the end of the array. */
	protected void addArrayElement() {
		addArrayElements(1);
	}

	/** Add space for multiple elements to the end of the array. */
	private void addArrayElements(int count) {
		if (size + count >= array.length) {
			int newSize = 2 * array.length;
			while (newSize <= size + count) {
				newSize *= 2;
			}

			int[] oldArray = array;
			array = new int[newSize];
			System.arraycopy(oldArray, 0, array, 0, size);
		}
		size += count;
	}
}