author | Stephen Talley <stephen.talley@oracle.com> |
Mon, 28 Mar 2011 10:53:34 -0400 | |
changeset 685 | 767674b0a2fb |
parent 219 | 57841c113efe |
permissions | -rw-r--r-- |
0 | 1 |
/* |
2 |
* CDDL HEADER START |
|
3 |
* |
|
4 |
* The contents of this file are subject to the terms of the |
|
5 |
* Common Development and Distribution License (the "License"). |
|
6 |
* You may not use this file except in compliance with the License. |
|
7 |
* |
|
8 |
* You can obtain a copy of the license at usr/src/OPENSOLARIS.LICENSE |
|
9 |
* or http://www.opensolaris.org/os/licensing. |
|
10 |
* See the License for the specific language governing permissions |
|
11 |
* and limitations under the License. |
|
12 |
* |
|
13 |
* When distributing Covered Code, include this CDDL HEADER in each |
|
14 |
* file and include the License file at usr/src/OPENSOLARIS.LICENSE. |
|
15 |
* If applicable, add the following below this CDDL HEADER, with the |
|
16 |
* fields enclosed by brackets "[]" replaced with your own identifying |
|
17 |
* information: Portions Copyright [yyyy] [name of copyright owner] |
|
18 |
* |
|
19 |
* CDDL HEADER END |
|
20 |
*/ |
|
21 |
||
22 |
/* |
|
685
767674b0a2fb
18094 s/StringBuffer/StringBuilder/g
Stephen Talley <stephen.talley@oracle.com>
parents:
219
diff
changeset
|
23 |
* Copyright (c) 2009, 2011, Oracle and/or its affiliates. All rights reserved. |
0 | 24 |
*/ |
25 |
||
219
57841c113efe
6788 package names should share o.o.o.vp prefix
Stephen Talley <stephen.talley@sun.com>
parents:
0
diff
changeset
|
26 |
package org.opensolaris.os.vp.util.misc; |
0 | 27 |
|
28 |
public class MathUtil { |
|
29 |
// |
|
30 |
// Static methods |
|
31 |
// |
|
32 |
||
33 |
public static int min(int... array) { |
|
34 |
int min = array[0]; |
|
35 |
for (int i = 1; i < array.length; i++) { |
|
36 |
if (array[i] < min) { |
|
37 |
min = array[i]; |
|
38 |
} |
|
39 |
} |
|
40 |
return min; |
|
41 |
} |
|
42 |
||
43 |
public static int max(int... array) { |
|
44 |
int max = array[0]; |
|
45 |
for (int i = 1; i < array.length; i++) { |
|
46 |
if (array[i] > max) { |
|
47 |
max = array[i]; |
|
48 |
} |
|
49 |
} |
|
50 |
return max; |
|
51 |
} |
|
52 |
||
53 |
public static String toBinary(long l, int bits) { |
|
685
767674b0a2fb
18094 s/StringBuffer/StringBuilder/g
Stephen Talley <stephen.talley@oracle.com>
parents:
219
diff
changeset
|
54 |
StringBuilder buffer = new StringBuilder(bits); |
0 | 55 |
|
56 |
for (int i = 0; i < bits; i++) { |
|
57 |
buffer.insert(0, l & 1); |
|
58 |
l >>>= 1; |
|
59 |
} |
|
60 |
||
61 |
return buffer.toString(); |
|
62 |
} |
|
63 |
||
64 |
public static String toBinary(long l) { |
|
65 |
return toBinary(l, 64); |
|
66 |
} |
|
67 |
||
68 |
public static String toBinary(int l) { |
|
69 |
return toBinary(l, 32); |
|
70 |
} |
|
71 |
||
72 |
public static String toBinary(short l) { |
|
73 |
return toBinary(l, 16); |
|
74 |
} |
|
75 |
||
76 |
public static String toBinary(char l) { |
|
77 |
return toBinary(l, 16); |
|
78 |
} |
|
79 |
||
80 |
public static String toBinary(byte l) { |
|
81 |
return toBinary(l, 8); |
|
82 |
} |
|
83 |
} |