すらいむLv1024@wiki

CountImp

2010-04-22T12:25:36+09:00

package ncount; public interface CountImp { public void Plus(); public int[] GetData(); }

Count

2010-04-22T12:24:54+09:00

package ncount; public class Count implements [[CountImp]]{ int num;//繰り返した回数 int ans;//現在の数字 int n;//n進数 int[] q;//Q0～3の値 public Count(int n){ q = new int[4]; this.n=n; num=0; ans=0; } public void Plus(){ num++; ans++; SetData(); } public int[] GetData(){ return q; } private void SetData(){ if(ans==n){ ans=0; } for(int i=0;i<4;i++){ q[i]=(ans>>i)&1; } } }

ClassTest

2010-04-22T12:23:46+09:00

package ncount; public class ClassTest { /** * @param args */ public static void main(String[] args) { [[Count]] c; c = new Count(11); for(int i=0;i<20;i++){ System.out.println(i+"回目:"); c.Plus(); int ans[]=c.GetData(); for(int j=3;j>=0;j--){ System.out.print(ans[j]+" "); } System.out.println(""); } } } countclass生成時に呼びだすコンストラクタで～進数のカウンタにするか決めてます。

ｎ進数カウンタ

2010-04-22T12:31:43+09:00

30～40分位で作ったので非常に汚いソースですが一応うｐ論理回路とかで使えそうなもの。というか俺が使うために用意しｔry [[CountImp.java>>CountImp]] interface [[Count.java>>Count]] [[ClassTest.java>>ClassTest]] テスト用ご意見ご感想はこちらへお願いします！ #comment

SortTester

2010-04-12T15:52:16+09:00

package sort; import java.util.Iterator; import java.util.[[List]]; import java.util.Vector; public class SortTester { private [[SortableData]] [] data={ new [[MyData]]("test0",100), new MyData("test1",73), new MyData("test2",34), new MyData("test3",11), new MyData("test4",98), new MyData("test5",54), new MyData("test6",3), }; private Vector vdata; public static void main(String [] args)throws Exception{ String sorterName= "sort.[[IncreasingSorter]]"; if(args.length>0){ sorterName=args[0]; } new SortTester(sorterName); } public SortTester(String sorterName)throws Exception{ [[Sorter]] sorter = getSorter(sorterName,data); Iterator i = sorter.sort(); while(i.hasNext()){ System.out.println(i.next()); } } public Sorter getSorter(String sorterName,SortableData[] data2)throws ClassNotFoundException,InstantiationException,IllegalAccessException{ Class cls = Class.for

Sorter

2010-04-12T15:50:27+09:00

package sort; import java.util.Iterator; import java.util.[[List]]; public interface Sorter { public void setData([[SortableData]][] data); public void setData(List data); public int size(); public Iterator sort(); }

SortableDataComparator

2010-04-12T15:47:36+09:00

package sort; import java.util.Comparator; public class SortableDataComparator implements Comparator { @Override public int compare(Object o1, Object o2) { [[SortableData]] sd1 = (SortableData)o1; SortableData sd2 = (SortableData)o2; // TODO 自動生成されたメソッド・スタブ if(sd1.getSortKey()>sd2.getSortKey()){ return 1; }else if(sd1.getSortKey()

SortableData

2010-04-12T15:46:31+09:00

package sort; public interface SortableData { public int getSortKey(); }

MyData

2010-04-12T15:45:13+09:00

package sort; public class MyData implements [[SortableData]]{ private String name; private int value; public MyData(String n,int v){ name=n; value=v; } public String getName(){ return name; } public int getValue(){ return value; } public int getSortKey(){ return value; } public String toString(){ return name+" "+value; } }

IncreasingSorter

2010-04-12T14:01:41+09:00

package sort; import java.util.Iterator; import java.util.[[List]]; public class IncreasingSorter extends [[BasicSorter]]{ public IncreasingSorter(){ } public IncreasingSorter([[SortableData]] [] in){ setData(in); } public IncreasingSorter(List in){ setData(in); } @Override public Iterator sort() { int num2=size(); for(int i=0;itarget[j].getSortKey()){ swap(i,j); } } } return getIterator(); } }