提交: 7eaabcbd2cd8e2c72d073b56d71f341c257b2b38 - IPOGwBDD (git)

IPODwBDD

Commit MetaInfo

• 修訂: 7eaabcbd2cd8e2c72d073b56d71f341c257b2b38 (tree)
• 時間: 2018-12-21 10:54:44
• 作者: Tatsuhiro Tsuchiya <t-tutiya@ist....>
• Commiter: Tatsuhiro Tsuchiya

Log Message

add some comments

Change Summary

• modified: .classpath
• modified: src/v1/CombinationGenerator.java
• modified: src/v1/IPOGnoconst.java

差異

--- a/.classpath
+++ b/.classpath
@@ -1,7 +1,7 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <classpath>
 	<classpathentry kind="src" path="src"/>
-	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/jre-10.0.2">
+	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER">
 		<attributes>
 			<attribute name="module" value="true"/>
 		</attributes>

--- a/src/v1/CombinationGenerator.java
+++ b/src/v1/CombinationGenerator.java
@@ -1,9 +1,11 @@
 package v1;
 
-class CombinationGenerator {
+// Naive implementation of Knuth's algorithm
+public class CombinationGenerator {
 	private int c[];
 	private int j;
 	private final int t;
+	
 	/** 
 	 * @param n number of things 
 	 * @param t combination size 
@@ -68,7 +70,7 @@ class CombinationGenerator {
 		return sum;
 	}
 
-	static int getCombinationID(int[] c) {
+	private static int getCombinationID(int[] c) {
 		int sum = 0;
 		for (int i = 1; i <= c.length; i++) {
 			int ci = c[i-1];
@@ -87,6 +89,7 @@ class CombinationGenerator {
 
 	static int getTotalNumber(int n, int t) {
 		int[] comb = new int[t];
+		// create the last combination
 		for (int i = 0; i < t; i++) {
 			comb[i] = n - t + i;
 		}

--- a/src/v1/IPOGnoconst.java
+++ b/src/v1/IPOGnoconst.java
@@ -5,7 +5,7 @@ import java.util.List;
 
 import v1.Main.Randstar;
 
-public class IPOGnoconst extends Generator {
+class IPOGnoconst extends Generator {
 
 	protected int matrix[][]; 
 	protected int strength;