/*
* Copyright (C) 2008, Shawn O. Pearce <spearce@spearce.org>
*
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or
* without modification, are permitted provided that the following
* conditions are met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* - Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
*
* - Neither the name of the Git Development Community nor the
* names of its contributors may be used to endorse or promote
* products derived from this software without specific prior
* written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND
* CONTRIBUTORS "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES,
* INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
package org.spearce.jgit.revwalk;
import java.util.AbstractList;
/**
* An ordered list of {@link RevObject} subclasses.
*
* @param <E>
* type of subclass of RevObject the list is storing.
*/
public class RevObjectList<E extends RevObject> extends AbstractList<E> {
static final int BLOCK_SHIFT = 8;
static final int BLOCK_SIZE = 1 << BLOCK_SHIFT;
Block contents;
int size;
/** Create an empty object list. */
public RevObjectList() {
clear();
}
public void add(final int index, final E element) {
if (index != size)
throw new UnsupportedOperationException("Not add-at-end: " + index);
set(index, element);
size++;
}
public E set(int index, E element) {
Block s = contents;
while (index >> s.shift >= BLOCK_SIZE) {
s = new Block(s.shift + BLOCK_SHIFT);
s.contents[0] = contents;
contents = s;
}
while (s.shift > 0) {
final int i = index >> s.shift;
index -= i << s.shift;
if (s.contents[i] == null)
s.contents[i] = new Block(s.shift - BLOCK_SHIFT);
s = (Block) s.contents[i];
}
final Object old = s.contents[index];
s.contents[index] = element;
return (E) old;
}
public E get(int index) {
Block s = contents;
if (index >> s.shift >= 1024)
return null;
while (s != null && s.shift > 0) {
final int i = index >> s.shift;
index -= i << s.shift;
s = (Block) s.contents[i];
}
return s != null ? (E) s.contents[index] : null;
}
public int size() {
return size;
}
@Override
public void clear() {
contents = new Block(0);
size = 0;
}
static class Block {
final Object[] contents = new Object[BLOCK_SIZE];
final int shift;
Block(final int s) {
shift = s;
}
}
}