Java Array.removeIndex方法代码示例

import com.badlogic.gdx.utils.Array; //导入方法依赖的package包/类
private boolean removeListenerInVector(Array<EventListener> listeners, EventListener listener) {
	if(listeners == null) {return false;}
	
	for(int i = listeners.size - 1; i >= 0; --i) {
		EventListener l = listeners.get(i);
		if(l == listener) {
			l.setRegistered(false);
			if(l.getAssociatedNode() != null) {
				dissociateNodeAndEventListener(l.getAssociatedNode(), l);
				l.setAssociatedNode(null);
			}
			if(_inDispatch <= 0) {
				listeners.removeIndex(i);
			} else {
				_toRemovedListeners.add(l);
			}
			return true;
		}
	}
	return false;
}
 

import com.badlogic.gdx.utils.Array; //导入方法依赖的package包/类
private void removeAllListenersInVector(Array<EventListener> listenerVector) {
	if (listenerVector == null) {return;}
    
    for (int i = listenerVector.size - 1; i >= 0; --i) {
    	EventListener l = listenerVector.get(i);
    	INode node;
    	if((node = l.getAssociatedNode()) != null) {
    		dissociateNodeAndEventListener(node, l);
    		l.setAssociatedNode(null);
    	}
    	
    	if(_inDispatch == 0) {
    		listenerVector.removeIndex(i);
    	}
    }
}
 

import com.badlogic.gdx.utils.Array; //导入方法依赖的package包/类
private float updateAverage(Array<Float> list, float value) {
    // this is not very efficient as it will trigger a memcopy every time
    if (list.size > INPUT_SAMPLE_SIZE) {
        list.removeIndex(0);
    }

    list.add(value);

    float total = 0.f;
    for (float gyro : list) {
        total += gyro;
    }

    return total / list.size;
}
 

import com.badlogic.gdx.utils.Array; //导入方法依赖的package包/类
public void resetTile(@NotNull TileType newType) {
	// check for entities that will not be allowed on the new tile, and move them to the closest adjacent tile they are allowed on.
	Array<Tile> surroundingTiles = getAdjacentTiles(true);
	for(Entity entity: level.getOverlappingEntities(getBounds())) {
		// for each entity, check if it can walk on the new tile type. If not, fetch the surrounding tiles, remove those the entity can't walk on, and then fetch the closest tile of the remaining ones.
		if(newType.getProp(SolidProperty.class).isPermeableBy(entity)) continue; // no worries for this entity.
		
		Array<Tile> aroundTiles = new Array<>(surroundingTiles);
		for(int i = 0; i < aroundTiles.size; i++) {
			if(!aroundTiles.get(i).groundType.getProp(SolidProperty.class).isPermeableBy(entity)) {
				aroundTiles.removeIndex(i);
				i--;
			}
		}
		
		Tile closest = entity.getClosestTile(aroundTiles);
		// if none remain (returned tile is null), take no action for that entity. If a tile is returned, then move the entity to the center of that tile.
		if(closest != null)
			entity.moveTo(closest);
	}
	
	TileType prev = getType();
	
	if(!newType.isGroundTile()) {
		// the new type has no defined under type, so the previous tile type should be conserved.
		// also, since you should never place one surface tile directly on another surface tile, I can technically assume that the current data array only has the ground tile data. But, since creative mode could be a thing, and it isn't too hard, I'm goinf to double check anyway.
		
		int[] newData = newType.getInitialData();
		int groundDataLen = groundType.getDataLength();
		int[] fullData = new int[groundDataLen + newData.length];
		System.arraycopy(data, 0, fullData, 0, groundDataLen); // copy ground tile data, first
		System.arraycopy(newData, 0, fullData, groundDataLen, newData.length); // copy surface tile data
		data = fullData;
		
		surfaceType = newType;
	}
	else { // new type is ground tile, remove surface type if present
		data = newType.getInitialData();
		surfaceType = null;
		
		groundType = newType;
	}
	
	newType.getProp(CoveredTileProperty.class).tilePlaced(this, prev);
}