blob: de6dc280e759a2839e1b234ec75dd77120d81c99 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
|
/*
* Copyright (C) 2008 The Android Open Source Project
*
* 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.replica.replicaisland;
/**
* ObjectManagers are "group nodes" in the game graph. They contain child objects, and updating
* an object manager invokes update on its children. ObjectManagers themselves are derived from
* BaseObject, so they may be strung together into a hierarchy of objects. ObjectManager may
* be specialized to implement special types of traversals (e.g. PhasedObjectManager sorts its
* children).
*/
public class ObjectManager extends BaseObject {
protected static final int DEFAULT_ARRAY_SIZE = 64;
private FixedSizeArray<BaseObject> mObjects;
private FixedSizeArray<BaseObject> mPendingAdditions;
private FixedSizeArray<BaseObject> mPendingRemovals;
public ObjectManager() {
super();
mObjects = new FixedSizeArray<BaseObject>(DEFAULT_ARRAY_SIZE);
mPendingAdditions = new FixedSizeArray<BaseObject>(DEFAULT_ARRAY_SIZE);
mPendingRemovals = new FixedSizeArray<BaseObject>(DEFAULT_ARRAY_SIZE);
}
public ObjectManager(int arraySize) {
super();
mObjects = new FixedSizeArray<BaseObject>(arraySize);
mPendingAdditions = new FixedSizeArray<BaseObject>(arraySize);
mPendingRemovals = new FixedSizeArray<BaseObject>(arraySize);
}
@Override
public void reset() {
commitUpdates();
final int count = mObjects.getCount();
for (int i = 0; i < count; i++) {
BaseObject object = mObjects.get(i);
object.reset();
}
}
public void commitUpdates() {
final int additionCount = mPendingAdditions.getCount();
if (additionCount > 0) {
final Object[] additionsArray = mPendingAdditions.getArray();
for (int i = 0; i < additionCount; i++) {
BaseObject object = (BaseObject)additionsArray[i];
mObjects.add(object);
}
mPendingAdditions.clear();
}
final int removalCount = mPendingRemovals.getCount();
if (removalCount > 0) {
final Object[] removalsArray = mPendingRemovals.getArray();
for (int i = 0; i < removalCount; i++) {
BaseObject object = (BaseObject)removalsArray[i];
mObjects.remove(object, true);
}
mPendingRemovals.clear();
}
}
@Override
public void update(float timeDelta, BaseObject parent) {
commitUpdates();
final int count = mObjects.getCount();
if (count > 0) {
final Object[] objectArray = mObjects.getArray();
for (int i = 0; i < count; i++) {
BaseObject object = (BaseObject)objectArray[i];
object.update(timeDelta, this);
}
}
}
public final FixedSizeArray<BaseObject> getObjects() {
return mObjects;
}
public final int getCount() {
return mObjects.getCount();
}
/** Returns the count after the next commitUpdates() is called. */
public final int getConcreteCount() {
return mObjects.getCount() + mPendingAdditions.getCount() - mPendingRemovals.getCount();
}
public final BaseObject get(int index) {
return mObjects.get(index);
}
public void add(BaseObject object) {
mPendingAdditions.add(object);
}
public void remove(BaseObject object) {
mPendingRemovals.add(object);
}
public void removeAll() {
final int count = mObjects.getCount();
final Object[] objectArray = mObjects.getArray();
for (int i = 0; i < count; i++) {
mPendingRemovals.add((BaseObject)objectArray[i]);
}
mPendingAdditions.clear();
}
/**
* Finds a child object by its type. Note that this may invoke the class loader and therefore
* may be slow.
* @param classObject The class type to search for (e.g. BaseObject.class).
* @return
*/
public <T> T findByClass(Class<T> classObject) {
T object = null;
final int count = mObjects.getCount();
for (int i = 0; i < count; i++) {
BaseObject currentObject = mObjects.get(i);
if (currentObject.getClass() == classObject) {
object = classObject.cast(currentObject);
break;
}
}
return object;
}
protected FixedSizeArray<BaseObject> getPendingObjects() {
return mPendingAdditions;
}
}
|
