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
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
|
/*
* Copyright (C) 2014 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 android.media;
import android.util.Log;
import android.util.Pair;
import android.util.Range;
import android.util.Rational;
import android.util.Size;
import java.util.Arrays;
import java.util.Comparator;
import java.util.Vector;
import static com.android.internal.util.Preconditions.checkNotNull;
// package private
class Utils {
private static final String TAG = "Utils";
/**
* Sorts distinct (non-intersecting) range array in ascending order.
* @throws java.lang.IllegalArgumentException if ranges are not distinct
*/
public static <T extends Comparable<? super T>> void sortDistinctRanges(Range<T>[] ranges) {
Arrays.sort(ranges, new Comparator<Range<T>>() {
@Override
public int compare(Range<T> lhs, Range<T> rhs) {
if (lhs.getUpper().compareTo(rhs.getLower()) < 0) {
return -1;
} else if (lhs.getLower().compareTo(rhs.getUpper()) > 0) {
return 1;
}
throw new IllegalArgumentException(
"sample rate ranges must be distinct (" + lhs + " and " + rhs + ")");
}
});
}
/**
* Returns the intersection of two sets of non-intersecting ranges
* @param one a sorted set of non-intersecting ranges in ascending order
* @param another another sorted set of non-intersecting ranges in ascending order
* @return the intersection of the two sets, sorted in ascending order
*/
public static <T extends Comparable<? super T>>
Range<T>[] intersectSortedDistinctRanges(Range<T>[] one, Range<T>[] another) {
int ix = 0;
Vector<Range<T>> result = new Vector<Range<T>>();
for (Range<T> range: another) {
while (ix < one.length &&
one[ix].getUpper().compareTo(range.getLower()) < 0) {
++ix;
}
while (ix < one.length &&
one[ix].getUpper().compareTo(range.getUpper()) < 0) {
result.add(range.intersect(one[ix]));
++ix;
}
if (ix == one.length) {
break;
}
if (one[ix].getLower().compareTo(range.getUpper()) <= 0) {
result.add(range.intersect(one[ix]));
}
}
return result.toArray(new Range[result.size()]);
}
/**
* Returns the index of the range that contains a value in a sorted array of distinct ranges.
* @param ranges a sorted array of non-intersecting ranges in ascending order
* @param value the value to search for
* @return if the value is in one of the ranges, it returns the index of that range. Otherwise,
* the return value is {@code (-1-index)} for the {@code index} of the range that is
* immediately following {@code value}.
*/
public static <T extends Comparable<? super T>>
int binarySearchDistinctRanges(Range<T>[] ranges, T value) {
return Arrays.binarySearch(ranges, Range.create(value, value),
new Comparator<Range<T>>() {
@Override
public int compare(Range<T> lhs, Range<T> rhs) {
if (lhs.getUpper().compareTo(rhs.getLower()) < 0) {
return -1;
} else if (lhs.getLower().compareTo(rhs.getUpper()) > 0) {
return 1;
}
return 0;
}
});
}
/**
* Returns greatest common divisor
*/
static int gcd(int a, int b) {
if (a == 0 && b == 0) {
return 1;
}
if (b < 0) {
b = -b;
}
if (a < 0) {
a = -a;
}
while (a != 0) {
int c = b % a;
b = a;
a = c;
}
return b;
}
/** Returns the equivalent factored range {@code newrange}, where for every
* {@code e}: {@code newrange.contains(e)} implies that {@code range.contains(e * factor)},
* and {@code !newrange.contains(e)} implies that {@code !range.contains(e * factor)}.
*/
static Range<Integer>factorRange(Range<Integer> range, int factor) {
if (factor == 1) {
return range;
}
return Range.create(divUp(range.getLower(), factor), range.getUpper() / factor);
}
/** Returns the equivalent factored range {@code newrange}, where for every
* {@code e}: {@code newrange.contains(e)} implies that {@code range.contains(e * factor)},
* and {@code !newrange.contains(e)} implies that {@code !range.contains(e * factor)}.
*/
static Range<Long>factorRange(Range<Long> range, long factor) {
if (factor == 1) {
return range;
}
return Range.create(divUp(range.getLower(), factor), range.getUpper() / factor);
}
private static Rational scaleRatio(Rational ratio, int num, int den) {
int common = gcd(num, den);
num /= common;
den /= common;
return new Rational(
(int)(ratio.getNumerator() * (double)num), // saturate to int
(int)(ratio.getDenominator() * (double)den)); // saturate to int
}
static Range<Rational> scaleRange(Range<Rational> range, int num, int den) {
if (num == den) {
return range;
}
return Range.create(
scaleRatio(range.getLower(), num, den),
scaleRatio(range.getUpper(), num, den));
}
static Range<Integer> alignRange(Range<Integer> range, int align) {
return range.intersect(
divUp(range.getLower(), align) * align,
(range.getUpper() / align) * align);
}
static int divUp(int num, int den) {
return (num + den - 1) / den;
}
private static long divUp(long num, long den) {
return (num + den - 1) / den;
}
/**
* Returns least common multiple
*/
private static long lcm(int a, int b) {
if (a == 0 || b == 0) {
throw new IllegalArgumentException("lce is not defined for zero arguments");
}
return (long)a * b / gcd(a, b);
}
static Range<Integer> intRangeFor(double v) {
return Range.create((int)v, (int)Math.ceil(v));
}
static Range<Long> longRangeFor(double v) {
return Range.create((long)v, (long)Math.ceil(v));
}
static Size parseSize(Object o, Size fallback) {
try {
return Size.parseSize((String) o);
} catch (ClassCastException e) {
} catch (NumberFormatException e) {
} catch (NullPointerException e) {
return fallback;
}
Log.w(TAG, "could not parse size '" + o + "'");
return fallback;
}
static int parseIntSafely(Object o, int fallback) {
try {
String s = (String)o;
return Integer.parseInt(s);
} catch (ClassCastException e) {
} catch (NumberFormatException e) {
} catch (NullPointerException e) {
return fallback;
}
Log.w(TAG, "could not parse integer '" + o + "'");
return fallback;
}
static Range<Integer> parseIntRange(Object o, Range<Integer> fallback) {
try {
String s = (String)o;
int ix = s.indexOf('-');
if (ix >= 0) {
return Range.create(
Integer.parseInt(s.substring(0, ix), 10),
Integer.parseInt(s.substring(ix + 1), 10));
}
int value = Integer.parseInt(s);
return Range.create(value, value);
} catch (ClassCastException e) {
} catch (NumberFormatException e) {
} catch (NullPointerException e) {
return fallback;
} catch (IllegalArgumentException e) {
}
Log.w(TAG, "could not parse integer range '" + o + "'");
return fallback;
}
static Range<Long> parseLongRange(Object o, Range<Long> fallback) {
try {
String s = (String)o;
int ix = s.indexOf('-');
if (ix >= 0) {
return Range.create(
Long.parseLong(s.substring(0, ix), 10),
Long.parseLong(s.substring(ix + 1), 10));
}
long value = Long.parseLong(s);
return Range.create(value, value);
} catch (ClassCastException e) {
} catch (NumberFormatException e) {
} catch (NullPointerException e) {
return fallback;
} catch (IllegalArgumentException e) {
}
Log.w(TAG, "could not parse long range '" + o + "'");
return fallback;
}
static Range<Rational> parseRationalRange(Object o, Range<Rational> fallback) {
try {
String s = (String)o;
int ix = s.indexOf('-');
if (ix >= 0) {
return Range.create(
Rational.parseRational(s.substring(0, ix)),
Rational.parseRational(s.substring(ix + 1)));
}
Rational value = Rational.parseRational(s);
return Range.create(value, value);
} catch (ClassCastException e) {
} catch (NumberFormatException e) {
} catch (NullPointerException e) {
return fallback;
} catch (IllegalArgumentException e) {
}
Log.w(TAG, "could not parse rational range '" + o + "'");
return fallback;
}
static Pair<Size, Size> parseSizeRange(Object o) {
try {
String s = (String)o;
int ix = s.indexOf('-');
if (ix >= 0) {
return Pair.create(
Size.parseSize(s.substring(0, ix)),
Size.parseSize(s.substring(ix + 1)));
}
Size value = Size.parseSize(s);
return Pair.create(value, value);
} catch (ClassCastException e) {
} catch (NumberFormatException e) {
} catch (NullPointerException e) {
return null;
} catch (IllegalArgumentException e) {
}
Log.w(TAG, "could not parse size range '" + o + "'");
return null;
}
}
|