-
Notifications
You must be signed in to change notification settings - Fork 0
/
task1.cs
285 lines (241 loc) · 7.41 KB
/
task1.cs
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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
internal static class Program
{
private const int TopN = 25;
private const int StopWordsCount = 2;
private const string FilePath = @"C:\Users\vbardin\Desktop\Task 1.txt";
private static readonly string[] StopWords = {"the", "a"};
public static unsafe void Main()
{
var textToProcess = File.ReadAllText(FilePath);
var textToProcessLength = 0;
var whitespaces = 0;
countTextLength:
{
try
{
if (textToProcess[textToProcessLength] != '\0')
{
textToProcessLength++;
goto countTextLength;
}
}
catch
{
textToProcessLength--;
}
}
// Convert text to lower case
if (textToProcessLength == 0)
{
return;
}
fixed (char* pSource = textToProcess)
{
var charIdx = 0;
// Convert letter to lower case and count whitespaces
toLowerCycleStart:
{
uint letter = *(pSource + charIdx);
if (letter - 'A' <= 'Z' - 'A')
{
letter += 32;
*(pSource + charIdx) = (char) letter;
}
if (letter is ' ' or ',' or '!' or '?' or '.')
{
whitespaces++;
}
}
charIdx++;
if (charIdx < textToProcessLength)
{
goto toLowerCycleStart;
}
}
// Split words
var indexer = 0;
var words = new string[whitespaces + 1];
var savedAmount = 0;
var firstWhiteSpaceIdx = 0;
var wordStartIndex = indexer;
var wordEndIndex = indexer;
findWhiteSpace:
if (textToProcess[indexer] == ' ')
{
firstWhiteSpaceIdx = indexer;
// to exit from cycle
indexer = textToProcessLength;
}
indexer++;
if (indexer < textToProcessLength)
{
goto findWhiteSpace;
}
wordEndIndex = firstWhiteSpaceIdx == wordStartIndex
? textToProcessLength
: firstWhiteSpaceIdx;
words[savedAmount] = textToProcess[wordStartIndex..wordEndIndex];
savedAmount++;
// cause the word starts after the whitespace character
var currPos = firstWhiteSpaceIdx + 1;
wordStartIndex = currPos;
wordEndIndex = currPos;
findWordEnd:
if (textToProcess[currPos] == ' ' ||
textToProcess[currPos] == ',' ||
textToProcess[currPos] == '!' ||
textToProcess[currPos] == '?' ||
textToProcess[currPos] == '.')
{
wordEndIndex = currPos;
words[savedAmount] = textToProcess[wordStartIndex..wordEndIndex];
savedAmount++;
wordStartIndex = wordEndIndex += 1;
}
currPos++;
if (currPos < textToProcessLength)
{
goto findWordEnd;
}
wordEndIndex = wordStartIndex == wordEndIndex
? textToProcessLength
: wordEndIndex;
words[savedAmount] = textToProcess[wordStartIndex..wordEndIndex];
// Remove stop words
var stopWords = 0;
var stwIdx = 0;
removeStopWords:
{
var currStopWord = StopWords[stwIdx];
var currTtpWordIdx = 0;
internalCycle:
{
if (words[currTtpWordIdx] == currStopWord)
{
words[currTtpWordIdx] = "";
stopWords++;
}
currTtpWordIdx++;
}
if (currTtpWordIdx < whitespaces + 1)
{
goto internalCycle;
}
currTtpWordIdx = 0;
stwIdx++;
}
if (stwIdx < StopWordsCount)
{
goto removeStopWords;
}
var tfDescriptors = new TermFrequencyDescriptor[whitespaces + 1 - stopWords];
var descriptorsExists = 0;
var currWordIdx = 0;
createTermFrequencyDescriptors:
{
var descriptorFound = false;
if (words[currWordIdx] != "")
{
var tfdIdx = 0;
findTfxDescriptor:
{
if (tfdIdx < descriptorsExists &&
tfDescriptors[tfdIdx].Term == words[currWordIdx])
{
tfDescriptors[tfdIdx].Frequency++;
descriptorFound = true;
}
tfdIdx++;
}
if (tfdIdx < descriptorsExists)
{
goto findTfxDescriptor;
}
if (!descriptorFound)
{
var tfd = new TermFrequencyDescriptor(words[currWordIdx], 1);
tfDescriptors[descriptorsExists] = tfd;
descriptorsExists++;
}
}
currWordIdx++;
}
if (currWordIdx < whitespaces + 1)
{
goto createTermFrequencyDescriptors;
}
// Create terms descriptors and order them
var currTfdIdx = 0;
order:
{
var idx = 0;
innerLoop:
{
if (tfDescriptors[idx].Frequency < tfDescriptors[idx + 1].Frequency)
{
(tfDescriptors[idx], tfDescriptors[idx + 1]) =
(tfDescriptors[idx + 1], tfDescriptors[idx]);
}
idx++;
}
if (idx < whitespaces - stopWords - currTfdIdx)
{
goto innerLoop;
}
currTfdIdx++;
}
if (currTfdIdx < whitespaces - stopWords)
{
goto order;
}
// take top N
var mostlyUsed = new TermFrequencyDescriptor[TopN];
var descriptorsSelected = 0;
currTfdIdx = 0;
takeTopN:
{
if (tfDescriptors[currTfdIdx].Term != "")
{
mostlyUsed[descriptorsSelected] = tfDescriptors[currTfdIdx];
descriptorsSelected++;
}
else
{
goto printRes;
}
currTfdIdx++;
}
if (currTfdIdx < descriptorsExists &&
currTfdIdx < TopN)
{
goto takeTopN;
}
printRes:
{
var pIdx = 0;
printCycle:
{
Console.WriteLine(mostlyUsed[pIdx]);
pIdx++;
}
if (pIdx < descriptorsSelected)
{
goto printCycle;
}
}
}
}
struct TermFrequencyDescriptor
{
public string Term { get; set; }
public int Frequency { get; set; }
public TermFrequencyDescriptor(string term, int frequency)
{
Term = term;
Frequency = frequency;
}
public override string ToString()
{
return $"{Term} - {Frequency}";
}
}