com.badlogic.gdx.ai.fma.BoundedSlotAssignmentStrategy Maven / Gradle / Ivy
/*******************************************************************************
* Copyright 2014 See AUTHORS file.
*
* 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 com.badlogic.gdx.ai.fma;
import com.badlogic.gdx.math.Vector;
import com.badlogic.gdx.utils.Array;
/** {@code BoundedSlotAssignmentStrategy} is an abstract implementation of {@link SlotAssignmentStrategy} that supports roles.
* Generally speaking, there are hard and soft roles. Hard roles cannot be broken, soft roles can.
*
* This abstract class provides an implementation of the {@link #calculateNumberOfSlots(Array) calculateNumberOfSlots} method that
* is more general (and costly) than the simplified implementation in {@link FreeSlotAssignmentStrategy}. It scans the assignment
* list to find the number of filled slots, which is the highest slot number in the assignments.
*
* @param Type of vector, either 2D or 3D, implementing the {@link Vector} interface
*
* @author davebaol */
public abstract class BoundedSlotAssignmentStrategy> implements SlotAssignmentStrategy {
@Override
public abstract void updateSlotAssignments (Array> assignments);
@Override
public int calculateNumberOfSlots (Array> assignments) {
// Find the number of filled slots: it will be the
// highest slot number in the assignments
int filledSlots = -1;
for (int i = 0; i < assignments.size; i++) {
SlotAssignment assignment = assignments.get(i);
if (assignment.slotNumber >= filledSlots) filledSlots = assignment.slotNumber;
}
// Add one to go from the index of the highest slot to the number of slots needed.
return filledSlots + 1;
}
@Override
public void removeSlotAssignment (Array> assignments, int index) {
int sn = assignments.get(index).slotNumber;
for (int i = 0; i < assignments.size; i++) {
SlotAssignment sa = assignments.get(i);
if (sa.slotNumber >= sn) sa.slotNumber--;
}
assignments.removeIndex(index);
}
}