1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
|
package sort;
import java.io.File;
import java.util.HashMap;
import fileIO.TextFile;
import shared.Shared;
import shared.Tools;
import stream.Read;
/**
* @author Brian Bushnell
* @date Oct 27, 2014
*
*/
public final class ReadComparatorList extends ReadComparator {
public ReadComparatorList(String fname){
String[] array;
if(new File(fname).exists()){
array=TextFile.toStringLines(fname);
}else{
array=fname.split(",");
}
int mapSize=(int)Tools.min(Shared.MAX_ARRAY_LEN, (array.length*3L)/2);
map=new HashMap<String, Integer>(mapSize);
for(int i=0; i<array.length; i++){
map.put(array[i], i);
}
}
@Override
public int compare(Read r1, Read r2) {
int x=compareInner(r1, r2);
return ascending*x;
}
public int compareInner(Read r1, Read r2) {
Integer a=(r1.id==null ? null : map.get(r1.id));
Integer b=(r2.id==null ? null : map.get(r2.id));
if(a==null && b==null){return r1.pairnum()-r2.pairnum();}
if(a==null){return 1;}
if(b==null){return -1;}
int dif=a-b;
if(dif==0){return r1.pairnum()-r2.pairnum();}
return dif;
}
private int ascending=1;
@Override
public void setAscending(boolean asc){
ascending=(asc ? 1 : -1);
}
private HashMap<String, Integer> map;
}
|
