2 |
26 Feb 07 |
jari |
1 |
/* |
2 |
26 Feb 07 |
jari |
* Created on Feb 17, 2005 |
2 |
26 Feb 07 |
jari |
3 |
*/ |
2 |
26 Feb 07 |
jari |
4 |
package org.tigr.microarray.mev.cluster.gui.impl.usc; |
2 |
26 Feb 07 |
jari |
5 |
|
2 |
26 Feb 07 |
jari |
6 |
import org.tigr.microarray.mev.r.REXP; |
2 |
26 Feb 07 |
jari |
7 |
import org.tigr.microarray.mev.r.RSrvException; |
2 |
26 Feb 07 |
jari |
8 |
import org.tigr.microarray.mev.r.Rconnection; |
2 |
26 Feb 07 |
jari |
9 |
|
2 |
26 Feb 07 |
jari |
10 |
/** |
2 |
26 Feb 07 |
jari |
* @author vu |
2 |
26 Feb 07 |
jari |
12 |
*/ |
2 |
26 Feb 07 |
jari |
13 |
public class USCTest { |
2 |
26 Feb 07 |
jari |
14 |
// |
2 |
26 Feb 07 |
jari |
15 |
public USCTest() { |
2 |
26 Feb 07 |
jari |
16 |
try { |
2 |
26 Feb 07 |
jari |
17 |
Rconnection rc = new Rconnection(); |
2 |
26 Feb 07 |
jari |
18 |
REXP x = rc.eval("R.version.string"); |
2 |
26 Feb 07 |
jari |
19 |
System.out.println(x.asString()); |
2 |
26 Feb 07 |
jari |
20 |
|
2 |
26 Feb 07 |
jari |
21 |
} catch( RSrvException e ) { |
2 |
26 Feb 07 |
jari |
22 |
e.printStackTrace(); |
2 |
26 Feb 07 |
jari |
23 |
} |
2 |
26 Feb 07 |
jari |
24 |
} |
2 |
26 Feb 07 |
jari |
25 |
|
2 |
26 Feb 07 |
jari |
26 |
|
2 |
26 Feb 07 |
jari |
27 |
public static void main( String[] args ) { |
2 |
26 Feb 07 |
jari |
28 |
USCTest u = new USCTest(); |
2 |
26 Feb 07 |
jari |
29 |
} |
2 |
26 Feb 07 |
jari |
30 |
|
2 |
26 Feb 07 |
jari |
31 |
|
2 |
26 Feb 07 |
jari |
32 |
private int computeCombinations( int n, int c ) { |
2 |
26 Feb 07 |
jari |
33 |
int toReturn = 0; |
2 |
26 Feb 07 |
jari |
34 |
|
2 |
26 Feb 07 |
jari |
35 |
int nFactorial = n; |
2 |
26 Feb 07 |
jari |
36 |
for( int i = n - 1; i > 0; i -- ) { |
2 |
26 Feb 07 |
jari |
37 |
nFactorial = nFactorial * i; |
2 |
26 Feb 07 |
jari |
38 |
} |
2 |
26 Feb 07 |
jari |
39 |
|
2 |
26 Feb 07 |
jari |
40 |
int cFactorial = c; |
2 |
26 Feb 07 |
jari |
41 |
for( int i = ( c - 1 ); i > 0; i -- ) { |
2 |
26 Feb 07 |
jari |
42 |
cFactorial = cFactorial * i; |
2 |
26 Feb 07 |
jari |
43 |
} |
2 |
26 Feb 07 |
jari |
44 |
|
2 |
26 Feb 07 |
jari |
45 |
int diff = ( n - c ); |
2 |
26 Feb 07 |
jari |
46 |
int diffFactorial = diff; |
2 |
26 Feb 07 |
jari |
47 |
for( int i = ( diff - 1 ); i > 0; i -- ) { |
2 |
26 Feb 07 |
jari |
48 |
diffFactorial = diffFactorial * i; |
2 |
26 Feb 07 |
jari |
49 |
} |
2 |
26 Feb 07 |
jari |
50 |
|
2 |
26 Feb 07 |
jari |
51 |
toReturn = ( nFactorial / ( cFactorial * diffFactorial ) ); |
2 |
26 Feb 07 |
jari |
52 |
System.out.println( toReturn + " combinations of " + n ); |
2 |
26 Feb 07 |
jari |
53 |
|
2 |
26 Feb 07 |
jari |
54 |
return toReturn; |
2 |
26 Feb 07 |
jari |
55 |
}//computeCombinations |
2 |
26 Feb 07 |
jari |
56 |
} |