-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathNumberUtils.java
More file actions
482 lines (416 loc) · 12.4 KB
/
NumberUtils.java
File metadata and controls
482 lines (416 loc) · 12.4 KB
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
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
/*
* Copyright 2013 Stephen Asbury
* Released under the MIT license
* http://opensource.org/licenses/MIT
*/
import java.math.*;
/**
* Static methods for working with numbers.
*/
public class NumberUtils
{
/**
* Convert a short to its byte components.
* @param s The short
* @return The equivalent bytes
*/
public static byte[] convertToBinary(short s)
{
byte[] retVal = new byte[2];
retVal[0] = (byte) ((s >>> 0) & 0xFF);
retVal[1] = (byte) ((s >>> 8) & 0xFF);
return retVal;
}
/**
* Convert bytes to a short.
* @param bytes The bytes to convert
* @return The short created from the bytes.
*/
public static short convertToShort(byte[] bytes)
{
short retVal = 0;
int i,j;
if(bytes.length > 1)
{
i = (int) bytes[0];
j = (int) bytes[1];
if(j < 0) j = -(j ^ 0xff) - 1;
if(i < 0) i = -(i ^ 0xff) - 1;
retVal = (short) ((i << 0) + (j << 8));
}
else if(bytes.length == 1)
{
i = (int) bytes[0];
retVal = (short) (i << 0);
}
return retVal;
}
/**
* Convert a int to its byte components.
* @param i The int
* @return The equivalent bytes
*/
public static byte[] convertToBinary(int i)
{
byte[] retVal = new byte[4];
int index,shift;
for(index = 0, shift = 0; index < 4; index++)
{
retVal[index] = (byte) ((i >>> shift) & 0xFF);
shift += 8;
}
return retVal;
}
/**
* Convert bytes to an int. Works with 4,2 or 1 byte.
* @param bytes The bytes to convert
* @return The int created from the bytes.
*/
public static int convertToInt(byte[] bytes)
{
int retVal = 0;
int i;
int index,shift;
if(bytes.length > 3)
{
for(index = 0, shift = 0; index < 4; index++)
{
i = (int) bytes[index];
if(i < 0) i = -(i ^ 0xff) - 1;
retVal += (i << shift);
shift += 8;
}
}
else if(bytes.length > 1)
{
retVal = (int) convertToShort(bytes);
}
else if(bytes.length == 1)
{
i = (int) bytes[0];
retVal = (i << 0);
}
return retVal;
}
/**
* Convert a long to its byte components.
* @param i The long
* @return The equivalent bytes
*/
public static byte[] convertToBinary(long i)
{
byte[] retVal = new byte[8];
int index,shift;
for(index = 0, shift = 0; index < 8; index++)
{
retVal[index] = (byte) ((i >>> shift) & 0xFF);
shift += 8;
}
return retVal;
}
/**
* Convert bytes to an long. Works with 8,4,2 or 1 byte.
* @param bytes The bytes to convert
* @return The long created from the bytes.
*/
public static long convertToLong(byte[] bytes)
{
long retVal = 0;
long i;
int shift;
int index;
if(bytes.length > 7)
{
for(index = 0, shift = 0; index < 8; index++)
{
i = (long) bytes[index];
if(i < 0) i = -(i ^ 0xff) - 1;
retVal += (i << shift);
shift += 8;
}
}
else if(bytes.length > 3)
{
retVal = (long) convertToInt(bytes);
}
else if(bytes.length > 1)
{
retVal = convertToShort(bytes);
}
else if(bytes.length == 1)
{
i = (int) bytes[0];
retVal = (int) (i << 0);
}
return retVal;
}
/**
* Convert a double to its byte components.
* @param f The double
* @return The equivalent bytes
*/
public static byte[] convertToBinary(double f)
{
long i = Double.doubleToLongBits(f);
return convertToBinary(i);
}
/**
* Convert bytes to an double. Works with 4,2 or 1 byte.
* @param bytes The bytes to convert
* @return The double created from the bytes.
*/
public static double convertToDouble(byte[] bytes)
{
long i = convertToLong(bytes);
return Double.longBitsToDouble(i);
}
/**
* Convert a float to its byte components.
* @param f The float
* @return The equivalent bytes
*/
public static byte[] convertToBinary(float f)
{
int i = Float.floatToIntBits(f);
return convertToBinary(i);
}
/**
* Convert bytes to an float. Works with 4,2 or 1 byte.
* @param bytes The bytes to convert
* @return The float created from the bytes.
*/
public static float convertToFloat(byte[] bytes)
{
int i = convertToInt(bytes);
return Float.intBitsToFloat(i);
}
/**
* Convert a BigInteger to its byte components.
* @param i The BigInteger
* @return The equivalent bytes
*/
public static byte[] convertToBinary(BigInteger i)
{
return i.toByteArray();
}
/**
* Convert bytes to an BigInteger. Works with 4,2 or 1 byte.
* @param bytes The bytes to convert
* @return The BigInteger created from the bytes.
*/
public static BigInteger convertToBigInteger(byte[] bytes)
{
return new BigInteger(bytes);
}
/**
* Convert a BigDecimal to its byte components.
* @param i The BigDecimal
* @return The equivalent bytes
*/
public static byte[] convertToBinary(BigDecimal i)
{
byte[] retVal = null;
try
{
retVal = i.toString().getBytes("UTF-8");
}
catch(Exception exp)
{
retVal = new byte[0];
}
return retVal;
}
/**
* Convert bytes to an BigDecimal. Works with 4,2 or 1 byte.
* @param bytes The bytes to convert
* @return The BigDecimal created from the bytes.
*/
public static BigDecimal convertToBigDecimal(byte[] bytes)
{
BigDecimal retVal = null;
try
{
retVal = new BigDecimal(new String(bytes, "UTF-8"));
}
catch(Exception exp)
{
retVal = null;
}
return retVal;
}
/**
* Find the closest prime above a value, up to 11000.
* @param aValue The int to check
* @return The closes prime
*/
public static int ceilPrime(int aValue)
{
int retVal;
retVal = aValue;
if(aValue <= 5)
retVal = 5;
else if(aValue <= 7)
retVal = 7;
else if(aValue <= 13)
retVal = 13;
else if(aValue <= 17)
retVal = 17;
else if(aValue <= 51)
retVal = 51;
else if(aValue <= 71)
retVal = 71;
else if(aValue <= 125)
retVal = 97;
else if(aValue <= 275)
retVal = 241;
else if(aValue <= 425)
retVal = 397;
else if(aValue <= 525)
retVal = 499;
else if(aValue <= 800)
retVal = 743;
else if(aValue <= 1100)
retVal = 997;
else if(aValue <= 1750)
retVal = 1499;
else if(aValue <= 2250)
retVal = 1999;
else if(aValue <= 4250)
retVal = 3989;
else if(aValue <= 5500)
retVal = 4999;
else if(aValue <= 8000)
retVal = 7499;
else if(aValue <= 11000)
retVal = 9973;
else if((aValue % 2) == 0) retVal += 1;
return retVal;
}
/**
* Calculates the sum of 1->n.
* @param n
* @return
*/
public static int calculateSum(int n)
{
int retVal = 0;
if(n%2==1)
{
retVal = ((n-1)/2)*n;
retVal += n;
}
else
{
retVal = (n/2)*n;
retVal += n/2;
}
return retVal;
}
/**
* Encode a number on an interval to a set of bits representing the binary value
* for the step closest to the number. The number of steps must be >0 and <1024.
* @param number
* @param min
* @param max
* @param steps
* @return
*/
public static byte[] encodeToInterval(int number,int min,int max,int steps)
{
if(steps<=0) throw new IllegalArgumentException("Steps must be > 0");
if(steps>128) throw new IllegalArgumentException("Steps must be < 128");
int bits=0;
int temp = steps;
while(temp>0)
{
bits++;
temp/=2;
}
byte[] retVal = new byte[bits];
int scaled = number-min;
double stepSize = (double)((double)(max-min))/(double)steps;
int numSteps = (int) Math.round(scaled/stepSize);
byte[] binary = convertToBinary(numSteps);
int curByte;
for(int i=0;i<bits;i++)
{
curByte = i/8;
retVal[i] = (byte) (binary[curByte] & 0x01);
binary[curByte]=(byte)(((int)binary[curByte])>>>1);
}
return retVal;
}
public static int decodeFromInterval(byte encoded[],int min,int max,int steps)
{
if(steps<=0) throw new IllegalArgumentException("Steps must be > 0");
if(steps>128) throw new IllegalArgumentException("Steps must be < 128");
int bits = encoded.length;
double stepSize = (double)((double)(max-min))/(double)steps;
int retVal = 0;
int numSteps = 0;
int twoCount=1;
for(int i=0;i<bits;i++)
{
if(encoded[i]>0) numSteps+=twoCount;
twoCount*=2;
}
retVal = ((int)(numSteps*stepSize)) + min;
return retVal;
}
public static int mapToInterval(int number,int min,int max,int steps)
{
int scaled = number-min;
double stepSize = (double)((double)(max-min))/(double)steps;
int closest = (int) Math.round(scaled/stepSize);
return ((int)(closest*stepSize))+min;
}
public static byte[] encodeToInterval(double number,double min,double max,int steps)
{
if(steps<=0) throw new IllegalArgumentException("Steps must be > 0");
if(steps>1024) throw new IllegalArgumentException("Steps must be < 1024");
int bits=0;
int temp = steps;
while(temp>0)
{
bits++;
temp/=2;
}
byte[] retVal = new byte[bits];
double stepSize = (max-min)/(double)steps;
double scaled = number-min-(stepSize/2);
int numSteps = (int) Math.round(scaled/stepSize);
byte[] binary = convertToBinary(numSteps);
int curByte;
for(int i=0;i<bits;i++)
{
curByte = i/8;
retVal[i] = (byte) (binary[curByte] & 0x01);
binary[curByte]=(byte)(((int)binary[curByte])>>>1);
}
return retVal;
}
public static double decodeFromInterval(byte encoded[],double min,double max,int steps)
{
if(steps<=0) throw new IllegalArgumentException("Steps must be > 0");
if(steps>1024) throw new IllegalArgumentException("Steps must be < 1024");
int bits = encoded.length;
double stepSize = (max-min)/(double)steps;
double retVal = 0;
int numSteps = 0;
int twoCount=1;
for(int i=0;i<bits;i++)
{
if(encoded[i]>0) numSteps+=twoCount;
twoCount*=2;
}
retVal = (numSteps*stepSize) + min+(stepSize/2);
return retVal;
}
public static double mapToInterval(double number,double min,double max,int steps)
{
double stepSize = (max-min)/(double)steps;
double scaled = number-min-(stepSize/2);
int closest = (int) Math.round(scaled/stepSize);
return (closest*stepSize)+min+(stepSize/2);
}
}