Mercurial > hg > Database > Alice
view src/alice/test/codesegment/local/bitonicsort/OddPhase.java @ 211:b8f72b378f18 working
refactor bintonic sort
author | one |
---|---|
date | Wed, 27 Mar 2013 16:39:51 +0900 |
parents | 214a13d5ee31 |
children | b5daccf36104 |
line wrap: on
line source
package alice.test.codesegment.local.bitonicsort; import alice.codesegment.CodeSegment; import alice.datasegment.CommandType; import alice.datasegment.Receiver; public class OddPhase extends CodeSegment{ private Receiver info0 = ids.create(CommandType.PEEK); // range private Receiver info1; // Array1 private Receiver info2; // Array2 private Receiver info3 = ids.create(CommandType.PEEK); // block_num //private Receiver info4 = ids.create(CommandType.PEEK); // last_block_num private Receiver info5 = ids.create(CommandType.PEEK); // sort_count private Receiver info6 = ids.create(CommandType.TAKE); // count public OddPhase(String key0,String key1,String key2,int index,String key6){ info0.setKey(key0); info1 = ids.create(CommandType.TAKE); info1.setKey(key1,index); info2 = ids.create(CommandType.TAKE); info2.setKey(key2,index); info3.setKey("block_num"); info5.setKey("sort_count"); info6.setKey(key6); } @Override public void run() { RangeInfo info = info0.asClass(RangeInfo.class); int sort_count = info5.asInteger(); int count = info6.asInteger(); //System.out.println("count is " +count); int i = info.range; if (count<sort_count){ DataList list1 = (DataList)info1.obj; DataList list2 = (DataList)info2.obj; Sort.quickSort(list1,0,list1.table.length-1); Sort.quickSort(list2,0,list2.table.length-1); DataList.merge(list1,list2); ods.flip(info1); ods.flip(info2); if (i+2 < SetInfo.array.length){ String f = (count%2==1) ? SetInfo.array[i] : SetInfo.array[i+1]; String b = (count%2==1) ? SetInfo.array[i+1] : SetInfo.array[i+2]; new OddPhase(info0.key, f, b,count,info6.key); } } else { ods.put(SetInfo.result[i*2], info1); ods.put(SetInfo.result[i*2+1], info2); } ods.update(info6.key, count+1); } }