Revize 54fb2bde
Přidáno uživatelem Alex Konig před asi 4 roky(ů)
Server/ServerApp/Parser/Parsers/LogInParser.cs | ||
---|---|---|
38 | 38 |
loadedData = ProcessOneLogInFileAsDays(fileName); |
39 | 39 |
// parse by interval length |
40 | 40 |
else |
41 |
{ |
|
42 |
// pokud: konec dne nebo konec aktuálního intervalu -> vemu to co sem nasčítal |
|
43 |
throw new NotImplementedException(); |
|
44 |
} |
|
41 |
loadedData = ProcessOneLoginFileAsIntervals(fileName, interval); |
|
45 | 42 | |
46 | 43 |
list.AddRange(loadedData); |
47 | 44 |
} |
... | ... | |
131 | 128 | |
132 | 129 |
private static List<ActivityInfo> ProcessOneLoginFileAsIntervals(string path, int interval) |
133 | 130 |
{ |
134 |
throw new NotImplementedException(); |
|
131 |
if (!File.Exists(path)) |
|
132 |
return null; |
|
133 | ||
134 |
List<ActivityInfo> loignInfo = new List<ActivityInfo>(); |
|
135 |
List<LogInInstance> list = CsvDataLoader.LoadLoginFile(path); |
|
136 | ||
137 |
// data for each faculty |
|
138 |
int[] recordedAmount = new int[TagInfo.faculties.Length]; |
|
139 |
// min/max hour taken into account |
|
140 |
int[] minmaxHour = new int[] { 7, 18 }; |
|
141 |
int range = minmaxHour[1] - minmaxHour[0]; |
|
142 | ||
143 |
if (interval > range) |
|
144 |
return null; |
|
145 | ||
146 |
int indices = (int)Math.Ceiling(range / (double)interval); |
|
147 |
int[] to = new int[indices]; |
|
148 |
int[][] data = new int[indices][]; |
|
149 |
for (int i = 0; i < to.Length; i++) |
|
150 |
{ |
|
151 |
to[i] = minmaxHour[0] + interval * (i + 1); |
|
152 |
data[i] = new int[TagInfo.faculties.Length]; |
|
153 |
} |
|
154 |
|
|
155 |
// 0.15h sem todle už dělal |
|
156 |
// +1h |
|
157 |
// udělat gitignore |
|
158 | ||
159 |
// first day |
|
160 |
DateTime lastStartTime = new DateTime(list[0].date.Year, list[0].date.Month, list[0].date.Day, minmaxHour[0], 0, 0); |
|
161 |
int index = 0; |
|
162 |
for (int i = 0; i < list.Count; i++) |
|
163 |
{ |
|
164 |
int currHour = list[i].lessonStart.Hour; |
|
165 |
if (currHour < minmaxHour[0] || currHour > minmaxHour[1]) |
|
166 |
continue; |
|
167 | ||
168 |
// start of the day -> make an instance |
|
169 |
string place = list[i].building; |
|
170 |
DateTime date = new DateTime(list[i].date.Year, list[i].date.Month, list[i].date.Day, list[i].lessonStart.Hour, 0, 0); |
|
171 | ||
172 |
// end of the day |
|
173 |
if (!(date.Year == lastStartTime.Year && date.Month == lastStartTime.Month && date.Day == lastStartTime.Day)) |
|
174 |
{ |
|
175 |
// note down all aggregated data |
|
176 |
for (int k = 0; k < to.Length; k++) |
|
177 |
{ |
|
178 |
DateTime stTime = new DateTime(lastStartTime.Year, lastStartTime.Month, lastStartTime.Day, to[k] - interval, 0, 0); |
|
179 | ||
180 |
// data for each faculty separate |
|
181 |
for (int l = 0; l < TagInfo.faculties.Length; l++) |
|
182 |
{ |
|
183 |
ActivityInfo dayInfo = new ActivityInfo(TagInfo.faculties[l], data[k][l], stTime, interval); |
|
184 |
loignInfo.Add(dayInfo); |
|
185 |
} |
|
186 | ||
187 |
data[k] = new int[TagInfo.faculties.Length]; |
|
188 |
} |
|
189 |
lastStartTime = date; |
|
190 |
} |
|
191 | ||
192 |
// find index for current instance |
|
193 |
index = 0; |
|
194 |
for (int k = 1; k < to.Length; k++) |
|
195 |
{ |
|
196 |
if (to[k] > list[i].lessonStart.Hour && to[k - 1] <= list[i].lessonStart.Hour) |
|
197 |
{ |
|
198 |
index = k; |
|
199 |
break; |
|
200 |
} |
|
201 |
} |
|
202 | ||
203 |
// aggregate data |
|
204 |
if (TagInfo.buildingTags.ContainsKey(place)) |
|
205 |
{ |
|
206 |
int faculty = TagInfo.buildingTags[place]; |
|
207 |
// to all |
|
208 |
if (faculty == -1) |
|
209 |
for (int l = 0; l < TagInfo.faculties.Length; l++) |
|
210 |
data[index][l] += list[i].amount; |
|
211 |
// to first two |
|
212 |
else if (faculty == -2) |
|
213 |
{ |
|
214 |
data[index][0] += list[i].amount; |
|
215 |
data[index][1] += list[i].amount; |
|
216 |
} |
|
217 |
else |
|
218 |
data[index][faculty] += list[i].amount; |
|
219 | ||
220 |
} |
|
221 |
else |
|
222 |
{ |
|
223 |
// TODO uknown code handling |
|
224 |
Console.WriteLine("Unknown code " + list[i].building); |
|
225 |
} |
|
226 | ||
227 |
} |
|
228 | ||
229 |
for (int k = 0; k < to.Length; k++) |
|
230 |
{ |
|
231 |
DateTime stTime = new DateTime(lastStartTime.Year, lastStartTime.Month, lastStartTime.Day, to[k] - interval, 0, 0); |
|
232 | ||
233 |
// data for each faculty separate |
|
234 |
for (int l = 0; l < TagInfo.faculties.Length; l++) |
|
235 |
{ |
|
236 |
ActivityInfo dayInfo = new ActivityInfo(TagInfo.faculties[l], data[k][l], stTime, interval); |
|
237 |
loignInfo.Add(dayInfo); |
|
238 |
} |
|
239 |
} |
|
240 | ||
241 |
return loignInfo; |
|
135 | 242 |
} |
136 | 243 | |
137 | 244 |
} |
138 |
} |
|
245 |
} |
Také k dispozici: Unified diff
re #8611 Login parser for interval lengths