import gnu.trove.list.linked.TIntLinkedList; //导入依赖的package包/类
/**
 * Expands the set to accommodate new values.
 *
 * @param newCapacity an <code>int</code> value
 */
@Override
protected void rehash(int newCapacity) {
    TIntLinkedList oldOrder = new TIntLinkedList(order);
    int oldSize = size();

    Object oldSet[] = _set;

    order.clear();
    _set = new Object[newCapacity];
    Arrays.fill(_set, FREE);

    for (TIntIterator iterator = oldOrder.iterator(); iterator.hasNext();) {
        int i = iterator.next();
        E o = (E) oldSet[i];
        if (o == FREE || o == REMOVED) {
            throw new IllegalStateException("Iterating over empty location while rehashing");
        }

        if (o != FREE && o != REMOVED) {
            int index = insertKey(o);
            if (index < 0) { // everyone pays for this because some people can't RTFM
                throwObjectContractViolation(_set[(-index - 1)], o, size(), oldSize, oldSet);
            }

            if (!order.add(index))
                throw new IllegalStateException("Order not changed after insert");
        }
    }

}
 

import gnu.trove.list.linked.TIntLinkedList; //导入依赖的package包/类
public static ItemStack[] simMassInvInsert(final IInventory inv, final ItemStack[] items, final int side) {
    final TIntLinkedList resultInd = new TIntLinkedList();
    final ItemStack[] result = new ItemStack[items.length];
    for (int i = 0; i < result.length; ++i) {
        if (items[i] != null && items[i].stackSize > 0) {
            result[i] = items[i].copy();
            resultInd.add(i);
        }
    }
    return simMassInvInsert_do(inv, side, resultInd, result);
}
 

import gnu.trove.list.linked.TIntLinkedList; //导入依赖的package包/类
/**
 * Expands the set to accommodate new values.
 *
 * @param newCapacity an <code>int</code> value
 */
@Override
@SuppressWarnings("unchecked")
protected void rehash(int newCapacity) {
    TIntLinkedList oldOrder = new TIntLinkedList(order);
    int oldSize = size();

    Object oldSet[] = _set;

    order.clear();
    _set = new Object[newCapacity];
    Arrays.fill(_set, FREE);

    for (TIntIterator iterator = oldOrder.iterator(); iterator.hasNext();) {
        int i = iterator.next();
        E o = (E) oldSet[i];
        if (o == FREE || o == REMOVED) {
            throw new IllegalStateException("Iterating over empty location while rehashing");
        }

        if (o != FREE && o != REMOVED) {
            int index = insertKey(o);
            if (index < 0) { // everyone pays for this because some people can't RTFM
                throwObjectContractViolation(_set[(-index - 1)], o, size(), oldSize, oldSet);
            }

            if (!order.add(index))
                throw new IllegalStateException("Order not changed after insert");
        }
    }

}
 

import gnu.trove.list.linked.TIntLinkedList; //导入依赖的package包/类
public Predict(int n) {
	this.n = n;
	scores = new TFloatLinkedList();
	labels = new TIntLinkedList();
}
 

import gnu.trove.list.linked.TIntLinkedList; //导入依赖的package包/类
private void analyse()
{
	if (nBlinks == -1)
	{
		if (isEmpty())
		{
			nBlinks = 0;
			onTimes = offTimes = null;
			return;
		}
		if (results.size() == 1)
		{
			nBlinks = 1;
			onTimes = new int[] { 1 };
			offTimes = null;
			return;
		}

		// Ensure in the correct time-order
		sort();
		TIntLinkedList on = new TIntLinkedList();
		TIntLinkedList off = new TIntLinkedList();

		nBlinks = 1;
		int t1 = results.get(0).getFrame();
		int onStart = t1;
		for (int i = 0; i < results.size() - 1; i++)
		{
			int t2 = results.get(i + 1).getFrame();
			int diff = t2 - t1;
			if (diff > 1)
			{
				off.add(diff - 1);
				on.add(t1 - onStart + 1);
				nBlinks++;
				onStart = t2;
			}
			t1 = t2;
		}
		on.add(t1 - onStart + 1);
		
		onTimes = on.toArray();
		offTimes = off.toArray();
	}
}