-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathPicks.java
More file actions
152 lines (131 loc) · 3.76 KB
/
Picks.java
File metadata and controls
152 lines (131 loc) · 3.76 KB
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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
import java.util.Arrays;
import java.util.LinkedList;
public class Picks {
private Match[] pairs;
private Match[] oldPairs;
private int numMatch =0;
private int numNonMatch =0;
private int numUnkown;
public int size() {
return pairs.length;
}
public Picks(Match[] pairs) {
this.pairs = pairs;
this.oldPairs = pairs.clone();
numUnkown= pairs.length -numMatch - numNonMatch;
}
public Picks(LinkedList<Match> p) {
pairs = new Match[p.size()];
for(int i=0; i<p.size(); i++){
pairs[i] = p.get(i);
}
numUnkown= pairs.length -numMatch - numNonMatch;
}
public Match[] getPairs() {
return pairs;
}
public void restore(){
this.pairs = this.oldPairs.clone();
}
public Match getPair(int i) {
return pairs[i];
}
public int getNumUnkown() {
return numUnkown;
}
public int getNumMatch() {
return numMatch;
}
public void setNumNonMatch(int numNonMatch) {
this.numNonMatch = numNonMatch;
}
public void setNumUnkown(int numUnkown) {
this.numUnkown = numUnkown;
}
public void addNumMatch(int toAdd) {
this.numMatch = numMatch + toAdd;
numUnkown= pairs.length -numMatch - numNonMatch;
}
public int getNumNonMatch() {
return numNonMatch;
}
public void addNumNonMatch(int num) {
this.numNonMatch = numNonMatch + num;
numUnkown= pairs.length -numMatch - numNonMatch;
}
@Override
public String toString() {
return "Picks{" +
"pairs=" + Arrays.toString(pairs) +
'}';
}
public Match[] getUntestedPair(int num){
Match[] matches = new Match[num];
int i=0;
int j=0;
while(j<num && i<pairs.length){
if(pairs[i].isunconfirmed()){
matches[j] = pairs[i];
j++;
}
i++;
}
return matches;
}
public LinkedList<Person> getConfirmed(){
LinkedList<Person> confirmed = new LinkedList<>();
for(int i=0; i<pairs.length; i++){
if(pairs[i].ismatch()){
confirmed.add(pairs[i].getP1());
confirmed.add(pairs[i].getP2());
}
}
return confirmed;
}
public LinkedList<Match> getUnConfirmed(){
LinkedList<Match> nonConfirmed = new LinkedList<>();
for(int i=0; i<pairs.length; i++){
if(pairs[i].isunconfirmed()){
nonConfirmed.add(pairs[i]);
}
}
return nonConfirmed;
}
public void swapPair(PairSwap ps){
oldPairs = pairs.clone();
ps.toString();
int j=0;
for(int i =0; i< pairs.length; i++){
if(pairs[i].equals(ps.getOldP()[0]) || pairs[i].equals(ps.getOldP()[1])){
pairs[i]= ps.getNewP()[j];
j++;
}
}
return;
}
public void swapAllnonMatches(LinkedList<Match> newPairs){
System.out.println("swapAllnonMatches");
System.out.println("newPairs.size()=" + newPairs.size());
System.out.println("numNonM=" + numNonMatch);
System.out.println(this.toString());
int j =0;
setNumNonMatch(0);
for(int i=0; i<pairs.length; i++){
if(!pairs[i].ismatch()){
pairs[i] = newPairs.get(j);
j++;
}
}
this.numNonMatch = 0;
this.numUnkown = this.pairs.length - this.numMatch - this.numNonMatch;
}
public int cntNumNonMatch(){
int num =0;
for(int i=0; i<pairs.length; i++){
if(!pairs[i].ismatch()){
num++;
}
}
return num;
}
}