|
1
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
2
|
// Copyright 2016 Leszek Koltunski //
|
|
3
|
// //
|
|
4
|
// This file is part of Distorted. //
|
|
5
|
// //
|
|
6
|
// Distorted is free software: you can redistribute it and/or modify //
|
|
7
|
// it under the terms of the GNU General Public License as published by //
|
|
8
|
// the Free Software Foundation, either version 2 of the License, or //
|
|
9
|
// (at your option) any later version. //
|
|
10
|
// //
|
|
11
|
// Distorted is distributed in the hope that it will be useful, //
|
|
12
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of //
|
|
13
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the //
|
|
14
|
// GNU General Public License for more details. //
|
|
15
|
// //
|
|
16
|
// You should have received a copy of the GNU General Public License //
|
|
17
|
// along with Distorted. If not, see <http://www.gnu.org/licenses/>. //
|
|
18
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
19
|
|
|
20
|
package org.distorted.library.main;
|
|
21
|
|
|
22
|
import java.util.ArrayList;
|
|
23
|
|
|
24
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
25
|
/**
|
|
26
|
* This static class handles assigning jobs to other classes. It does it once, at the beginning of
|
|
27
|
* each frame.
|
|
28
|
* <p>
|
|
29
|
* Not part of public API, do not document (public only because has to be used in PostprocessEffects)
|
|
30
|
*
|
|
31
|
* @y.exclude
|
|
32
|
*/
|
|
33
|
public class DistortedMaster
|
|
34
|
{
|
|
35
|
private static ArrayList<Slave> mSlaves = new ArrayList<>();
|
|
36
|
|
|
37
|
public interface Slave
|
|
38
|
{
|
|
39
|
void doWork();
|
|
40
|
}
|
|
41
|
|
|
42
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
43
|
|
|
44
|
private DistortedMaster()
|
|
45
|
{
|
|
46
|
|
|
47
|
}
|
|
48
|
|
|
49
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
50
|
|
|
51
|
static boolean toDo()
|
|
52
|
{
|
|
53
|
Slave slave;
|
|
54
|
int num = mSlaves.size();
|
|
55
|
|
|
56
|
try
|
|
57
|
{
|
|
58
|
for(int i=0; i<num; i++)
|
|
59
|
{
|
|
60
|
slave = mSlaves.remove(0);
|
|
61
|
|
|
62
|
if( slave!=null ) slave.doWork();
|
|
63
|
}
|
|
64
|
}
|
|
65
|
catch(IndexOutOfBoundsException ie)
|
|
66
|
{
|
|
67
|
// onDestroy must have been called, ignore
|
|
68
|
}
|
|
69
|
|
|
70
|
return ( num>0 );
|
|
71
|
}
|
|
72
|
|
|
73
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
74
|
|
|
75
|
public static void newSlave(Slave s)
|
|
76
|
{
|
|
77
|
int num = mSlaves.size();
|
|
78
|
boolean found = false;
|
|
79
|
Slave tmp;
|
|
80
|
|
|
81
|
try
|
|
82
|
{
|
|
83
|
for(int i=0; i<num; i++)
|
|
84
|
{
|
|
85
|
tmp = mSlaves.get(i);
|
|
86
|
|
|
87
|
if( tmp==s )
|
|
88
|
{
|
|
89
|
found = true;
|
|
90
|
break;
|
|
91
|
}
|
|
92
|
}
|
|
93
|
}
|
|
94
|
catch(IndexOutOfBoundsException ie)
|
|
95
|
{
|
|
96
|
// onDestroy must have been called, ignore
|
|
97
|
}
|
|
98
|
|
|
99
|
if( !found ) mSlaves.add(s);
|
|
100
|
}
|
|
101
|
|
|
102
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
103
|
// Can make this logarithmic but the typical number of children is very small anyway.
|
|
104
|
//
|
|
105
|
// We want to keep same buckets next to each other, while avoiding changes in order of the children
|
|
106
|
// (if possible!) We want to keep bucket=0 (i.e. the non-postprocessed children) at the beginning.
|
|
107
|
|
|
108
|
static void addSortingByBuckets(ArrayList<DistortedNode> mChildren, DistortedNode newChild)
|
|
109
|
{
|
|
110
|
int i,num = mChildren.size();
|
|
111
|
long bucket = newChild.getPostprocessQueue().getID();
|
|
112
|
boolean sameBucket = false;
|
|
113
|
|
|
114
|
for(i=0; i<num; i++)
|
|
115
|
{
|
|
116
|
if( mChildren.get(i).getPostprocessQueue().getID() == bucket )
|
|
117
|
{
|
|
118
|
sameBucket=true;
|
|
119
|
}
|
|
120
|
else if( sameBucket || bucket==0 )
|
|
121
|
{
|
|
122
|
break;
|
|
123
|
}
|
|
124
|
}
|
|
125
|
|
|
126
|
mChildren.add(i,newChild);
|
|
127
|
|
|
128
|
//android.util.Log.e("newChild", "newBucket="+bucket+" new child at "+i+" total num ="+num);
|
|
129
|
}
|
|
130
|
|
|
131
|
///////////////////////////////////////////////////////////////////////////////////////////////////
|
|
132
|
|
|
133
|
static void onDestroy()
|
|
134
|
{
|
|
135
|
mSlaves.clear();
|
|
136
|
}
|
|
137
|
}
|