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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
|
/*
* This program is free software; you can redistribute it and/or modify it under the
* terms of the GNU Lesser General Public License, version 2.1 as published by the Free Software
* Foundation.
*
* You should have received a copy of the GNU Lesser General Public License along with this
* program; if not, you can obtain a copy at http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html
* or from the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*
* This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
* without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU Lesser General Public License for more details.
*
* Copyright (c) 2009 Pentaho Corporation. All rights reserved.
*/
package org.pentaho.reporting.libraries.base.util;
/**
* A utility class to support reordering operations of arrays.
*
* @author Thomas Morgner
*/
public class BulkDataUtility
{
/**
* Private constructor prevents instantiation.
*/
private BulkDataUtility()
{
}
/**
* Pushes the selected elements up. The elements are given in the data-array, while a selector on whether they
* should be pushed up is given in the selection array. The operation modifies the data-array.
*
* @param data the array holding the data-objects.
* @param selection the selection of which elements should be pushed up.
*/
public static void pushUp(final Object[] data, final boolean[] selection)
{
if (data == null)
{
throw new NullPointerException();
}
if (selection == null)
{
throw new NullPointerException();
}
if (selection.length != data.length)
{
throw new IllegalArgumentException();
}
for (int i = 1; i < data.length; i++)
{
final Object o = data[i];
final boolean selected = selection[i];
if (selected && (selection[i - 1] == false))
{
data[i] = data[i - 1];
selection[i] = selection[i - 1];
data[i - 1] = o;
selection[i - 1] = true;
}
}
}
/**
* Pushes the selected elements down. The elements are given in the data-array, while a selector on whether they
* should be pushed down is given in the selection array. The operation modifies the data-array.
*
* @param data the array holding the data-objects.
* @param selection the selection of which elements should be pushed down.
*/
public static void pushDown(final Object[] data, final boolean[] selection)
{
if (data == null)
{
throw new NullPointerException();
}
if (selection == null)
{
throw new NullPointerException();
}
if (selection.length != data.length)
{
throw new IllegalArgumentException();
}
for (int i = data.length - 2; i >= 0; i--)
{
final Object o = data[i];
final boolean selected = selection[i];
if (selected && (selection[i + 1] == false))
{
data[i] = data[i + 1];
selection[i] = selection[i + 1];
data[i + 1] = o;
selection[i + 1] = true;
}
}
}
/**
* Pushes up the selected element. The element is compared via reference-equality, so <code>equals()</code> will not
* be called. It is assumed that the selected object is part of the data-collection.
* The operation modifies the data-array.
*
* @param data the array holding the data-objects.
* @param selection the selectioned object that be pushed up.
*/
public static void pushUpSingleValue(final Object[] data, final Object selection)
{
if (data == null)
{
throw new NullPointerException();
}
if (selection == null)
{
throw new NullPointerException();
}
for (int i = 1; i < data.length; i++)
{
final Object o = data[i];
//noinspection ObjectEquality
final boolean selected = (selection == o);
if (selected)
{
data[i] = data[i - 1];
data[i - 1] = o;
}
}
}
/**
* Pushes the selected element down. The element is compared via reference-equality, so <code>equals()</code> will not
* be called. It is assumed that the selected object is part of the data-collection.
* The operation modifies the data-array.
*
* @param data the array holding the data-objects.
* @param selection the selectioned object that be pushed down.
*/
public static void pushDownSingleValue(final Object[] data, final Object selection)
{
if (data == null)
{
throw new NullPointerException();
}
if (selection == null)
{
throw new NullPointerException();
}
for (int i = data.length - 2; i >= 0; i--)
{
final Object o = data[i];
//noinspection ObjectEquality
final boolean selected = selection == o;
if (selected)
{
data[i] = data[i + 1];
data[i + 1] = o;
}
}
}
}
|
