equal
deleted
inserted
replaced
65 difficulty = strLst[6].toUInt(); |
65 difficulty = strLst[6].toUInt(); |
66 for(int i = 0; i < 8; i++) |
66 for(int i = 0; i < 8; i++) |
67 { |
67 { |
68 HHName[i]=strLst[i * 2 + 7]; |
68 HHName[i]=strLst[i * 2 + 7]; |
69 HHHat[i]=strLst[i * 2 + 8]; |
69 HHHat[i]=strLst[i * 2 + 8]; |
|
70 // Somehow claymore managed an empty hat. Until we figure out how, this should avoid a repeat |
|
71 // Checking net teams is probably pointless, but can't hurt. |
|
72 if (HHHat[i].length() == 0) HHHat[i] = "NoHat"; |
70 } |
73 } |
71 } |
74 } |
72 |
75 |
73 HWTeam::HWTeam() : |
76 HWTeam::HWTeam() : |
74 difficulty(0), |
77 difficulty(0), |
127 str.remove(0, 3); |
130 str.remove(0, 3); |
128 long i = str.left(1).toLong(); |
131 long i = str.left(1).toLong(); |
129 if ((i < 0) || (i > 7)) continue; |
132 if ((i < 0) || (i > 7)) continue; |
130 str.remove(0, 2); |
133 str.remove(0, 2); |
131 HHHat[i] = str; |
134 HHHat[i] = str; |
|
135 // Somehow claymore managed an empty hat. Until we figure out how, this should avoid a repeat |
|
136 if (HHHat[i].length() == 0) HHHat[i] = "NoHat"; |
132 } else |
137 } else |
133 if (str.startsWith("grave ")) |
138 if (str.startsWith("grave ")) |
134 { |
139 { |
135 str.remove(0, 6); |
140 str.remove(0, 6); |
136 Grave = str; |
141 Grave = str; |