非运行时分配解决方案 - ArrayList(Non runtime allocation solution - ArrayList)

 我正在用Java进行游戏。 我需要一些针对当前运行时分配的解决方案，这是由我的ArrayList引起的。 垃圾收集器每分钟或30秒开始运行，因为我正在调用通过此集合的绘制和更新方法。 
 
 我应该如何做一个非运行时分配解决方案？ 
 
 在此先感谢，如果需要，我的代码从我的Manager类中公布，其中包含对象的ArrayList ： 
 
 一些代码： 
 
@Override
public void draw(GL10 gl) {
  final int size = objects.size();
  for(int x = 0; x < size; x++) {
    Object object = objects.get(x);
    object.draw(gl);
  }
}

public void add(Object parent) {
  objects.add(parent);
}

     //Get collection, and later we call the draw function from these objects
public ArrayList<Object> getObjects() {
   return objects;
}

public int getNumberOfObjects() {
   return objects.size();
}
 
 更多解释：我与这种混合的原因是（1）我看到ArrayList实现很慢并导致滞后，（2）我想将对象/组件合并在一起。 当从我的Thread-class发起更新调用时，它会通过我的集合，使用Manager的更新函数将事物向下发送到树/图上。 
 
 在查看Replica Island的开源项目时，我发现他使用了他自己编写的替代类FixedSizeArray。 由于我对Java不太擅长，我想让事情变得更简单，现在我正在寻找另一种解决方案。 最后，他解释了为什么他做了这个特殊班级： 
 
 
 
 FixedSizeArray是像ArrayList这样的标准Java集合的替代品。 它旨在提供一个连续的固定长度数组，可以访问，排序和搜索，而无需任何运行时分配 。 此实现区分数组的“容量”（它可包含的最大对象数）和数组的“计数”（插入到数组中的当前数目）。 诸如set（）和remove（）之类的操作只能对已经显式添加（）的对象进行操作; 也就是说，大于getCount（）但小于getCapacity（）的索引不能单独使用。 
 

I'm making a game in Java. I need some solution for my current runtime allocation, caused by my ArrayList. Every single minute or 30 seconds the garbage collector starts to runs because of I am calling for draw and updates-method through this collection.
 
How should I be able to do a non runtime allocation solution?
 
Thanks in advance and if needed, my code is posted below from my Manager class which contains the ArrayList of objects.:
 
Some code:
 
@Override
public void draw(GL10 gl) {
  final int size = objects.size();
  for(int x = 0; x < size; x++) {
    Object object = objects.get(x);
    object.draw(gl);
  }
}

public void add(Object parent) {
  objects.add(parent);
}

     //Get collection, and later we call the draw function from these objects
public ArrayList<Object> getObjects() {
   return objects;
}

public int getNumberOfObjects() {
   return objects.size();
}
 
More explanation: The reason I mix with this is because (1) I see that the ArrayList implementation is slow and causing lags and (2) that I want to merge the objects/components together. When firing an update call from my Thread-class, it goes through my collection, send things down the tree/graph using the Manager's update function.
 
When looking at an Open Source project, Replica Island, I found that he used an alternative class FixedSizeArray that he wrotes on his own. Since I'm not that good at Java, I wanted to make things easier and now I'm looking for another solution. And at last, he explained WHY he made the special class:
 
 
 
FixedSizeArray is an alternative to a standard Java collection like ArrayList. It is designed to provide a contiguous array of fixed length which can be accessed, sorted, and searched without requiring any runtime allocation. This implementation makes a distinction between the "capacity" of an array (the maximum number of objects it can contain) and the "count" of an array (the current number of objects inserted into the array). Operations such as set() and remove() can only operate on objects that have been explicitly add()-ed to the array; that is, indexes larger than getCount() but smaller than getCapacity() can't be used on their own.
 

原文：https://stackoverflow.com/questions/4382021