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
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
|
/***************************************************************************
Vocabulary Expression for KDE Edu
-----------------------------------------------------------------------
copyright : (C) 1999-2001 Ewald Arnold
(C) 2001 The KDE-EDU team
(C) 2005 Peter Hedlung
email : peter.hedlund@kdemail.net
***************************************************************************/
/***************************************************************************
* *
* This program is free software; you can redistribute it and/or modify *
* it under the terms of the GNU General Public License as published by *
* the Free Software Foundation; either version 2 of the License, or *
* (at your option) any later version. *
* *
***************************************************************************/
#ifndef KEDUVOCEXPRESSION_H
#define KEDUVOCEXPRESSION_H
#define KV_MAX_GRADE 7
#define KV_MIN_GRADE 0
#define KV_NORM_GRADE 0 // not queried yet
#define KV_NORM_COLOR Qt::black
#define KV_NORM_TEXT I18N_NOOP("Not Queried Yet")
#define KV_LEV1_GRADE 1
#define KV_LEV1_TEXT I18N_NOOP("Level 1")
#define KV_LEV2_GRADE 2
#define KV_LEV2_TEXT I18N_NOOP("Level 2")
#define KV_LEV3_GRADE 3
#define KV_LEV3_TEXT I18N_NOOP("Level 3")
#define KV_LEV4_GRADE 4
#define KV_LEV4_TEXT I18N_NOOP("Level 4")
#define KV_LEV5_GRADE 5
#define KV_LEV5_TEXT I18N_NOOP("Level 5")
#define KV_LEV6_GRADE 6
#define KV_LEV6_TEXT I18N_NOOP("Level 6")
#define KV_LEV7_GRADE 7
#define KV_LEV7_TEXT I18N_NOOP("Level 7")
#include <time.h>
#include <vector>
using namespace std;
#include "grammarmanager.h"
#include "multiplechoice.h"
typedef signed char grade_t;
typedef unsigned short count_t;
/***************************************************************
* This class contains one expression as original or in one
* translations
**************************************************************/
class KEduVocExpression
{
public:
/** default constructor for an expression in different languages
*/
~KEduVocExpression ();
KEduVocExpression ();
KEduVocExpression (TQString &s, TQString separator, int lesson = 0);
/** Constructor for an expression in different languages
*
* @param expr expression
*/
KEduVocExpression (TQString &expr, int lesson = 0);
/** adds a new translation of this entry
* @param expr translation
* @param grade grade of knowledge of this translation
* @param rev_grade dito, in opposite direction
*/
void addTranslation (TQString expr, grade_t grade=KV_NORM_GRADE,
grade_t rev_grade=KV_NORM_GRADE);
/** removes translation
*
* @param index number of translation 1..x
*/
void removeTranslation (int index);
/** returns index of lesson (0 = none)
*/
int getLesson () const;
/** sets index of lesson (0 = none)
*/
void setLesson (int l);
/** returns original expression of this entry
*/
TQString getOriginal () const;
/** sets original expression of this entry
*/
void setOriginal (const TQString & expr);
/** returns number of max. translations of all expressions
*/
int numTranslations() const;
/** returns flag if entry is "selected" for queries
*/
bool isInQuery() const {return inquery; }
/** set entry "selected"
*/
void setInQuery(bool flag = true) { inquery = flag; }
/** returns flag if entry is activated for queries
*/
bool isActive() const {return active; }
/** set entry active (enabled for queries)
*/
void setActive(bool flag = true) { active = flag; }
/** returns translation of this expression
*
* @param index number of translation
* @result expression or "" if no translation available
*/
TQString getTranslation (int index) const;
/** sets translation of this expression
*
* @param index number of translation
* @param expr expression of this index
*/
void setTranslation (int index, const TQString & expr);
/** sets remark of this expression
*
* @param index index of expression
* @param expr remark of this index
*/
void setPronunce (int index, const TQString & expr);
/** returns pronunciation of this expression
*
* @param index index of expression
* @result pronunciation or "" if none available
*/
TQString getPronunce (int index) const;
/** returns remarks of this expression
*
* @param index index of expression
* @result remark or "" if no remark available
*/
TQString getRemark (int index) const;
/** sets remark of this expression
*
* @param index index of expression
* @param expr remark of this index
*/
void setRemark (int index, const TQString & expr);
/** sets false friend of this expression
*
* @param index index of expression
* @param expr false friend of this index
* @param rev_grade dito, in opposite direction
*/
void setFauxAmi (int index, const TQString & expr, bool rev_ami = false);
/** returns false friend of this expression
*
* @param index index of expression
* @param rev_grade dito, in opposite direction
* @result false friend or "" if no string available
*/
TQString getFauxAmi (int index, bool rev_ami = false) const;
/** sets synonym this expression
*
* @param index index of expression
* @param expr synonym of this index
*/
void setSynonym (int index, const TQString & expr);
/** returns synonym of this expression
*
* @param index index of expression
* @result synonym or "" if no string available
*/
TQString getSynonym (int index) const;
/** sets example this expression
*
* @param index index of expression
* @param expr example of this index
*/
void setExample (int index, const TQString & expr);
/** returns example of this expression
*
* @param index index of expression
* @result example or "" if no string available
*/
TQString getExample (int index) const;
/** sets usage label this expression
*
* @param index index of expression
* @param usage usage label of this index
*/
void setUsageLabel (int index, const TQString & usage);
/** returns usage label of this expression
*
* @param index index of expression
* @result usage or "" if no string available
*/
TQString getUsageLabel (int index) const;
/** sets paraphrase of this expression
*
* @param index index of expression
* @param usage paraphrase of this index
*/
void setParaphrase (int index, const TQString & usage);
/** returns paraphrase of this expression
*
* @param index index of expression
* @result paraphrase or "" if no string available
*/
TQString getParaphrase (int index) const;
/** sets antonym this expression
*
* @param index index of expression
* @param expr antonym of this index
*/
void setAntonym (int index, const TQString & expr);
/** returns antonym of this expression
*
* @param index index of expression
* @result antonym or "" if no string available
*/
TQString getAntonym (int index) const;
/** returns type of this expression
*
* @result type or "" if no type available
*/
TQString getType (int index) const;
/** all langs have same type ?
*
* @result true if all have same type
*/
bool uniqueType () const;
/** sets type of this expression
*
* @param index index of type
* @param type type of this expression ("" = none)
*/
void setType (int index, const TQString &type);
/** returns grade of given translation as string
*
* @param index index of expression
* @param rev_grade dito, in opposite direction
* @result number of knowlegde: 0=known, x=numbers not knows
*/
TQString gradeStr (int index, bool rev_grade = false) const;
/** sets grade of given translation
*
* @param index index of translation
* @param grade number of knowlegde: 0=known, x=numbers not knows
*/
void setGrade (int index, grade_t grade, bool rev_grade = false);
/** returns grade of given translation as int
*
* @param index index of translation
* @param rev_grade dito, in opposite direction
* @result number of knowlegde: 0=known, x=numbers not knows
*/
grade_t getGrade (int index, bool rev_grade = false) const;
/** increments grade of given translation
*
* @param index index of translation
* @param rev_grade dito, in opposite direction
*/
void incGrade (int index, bool rev_grade = false);
/** decrements grade of given translation
*
* @param index index of translation
* @param rev_grade dito, in opposite direction
*/
void decGrade (int index, bool rev_grade = false);
/** returns last query date of given translation as int
*
* @param index index of translation
* @param rev_date dito, in opposite direction
*/
time_t getQueryDate (int index, bool rev_date = false) const;
/** set last query date of given translation as int
*
* @param index index of translation
* @param rev_date dito, in opposite direction
*/
void setQueryDate (int index, time_t date, bool rev_date = false);
/** returns conjugations if available
*
* @param index index of translation
*/
Conjugation getConjugation(int index) const;
/** sets conjugations
*
* @param index index of translation
* @param con conjugation block
*/
void setConjugation(int index, const Conjugation &con);
/** returns comparison if available
*
* @param index index of translation
*/
Comparison getComparison(int index) const;
/** sets comparison
*
* @param index index of translation
* @param con comparison block
*/
void setComparison(int index, const Comparison &comp);
/** returns multiple choice if available
*
* @param index index of multiple choice
*/
MultipleChoice getMultipleChoice(int index) const;
/** sets multiple choice
*
* @param index index of translation
* @param con multiple choice block
*/
void setMultipleChoice(int index, const MultipleChoice &mc);
/** returns query count of given translation as int
*
* @param index index of translation
* @param rev_count dito, in opposite direction
*/
count_t getQueryCount (int index, bool rev_count = false) const;
/** set query count of given translation as int
*
* @param index index of translation
* @param rev_count dito, in opposite direction
*/
void setQueryCount (int index, count_t count, bool rev_count = false);
/** returns bad query count of given translation as int
*
* @param index index of translation
* @param rev_count dito, in opposite direction
*/
count_t getBadCount (int index, bool rev_count = false) const;
/** set bad query count of given translation as int
*
* @param index index of translation
* @param rev_count dito, in opposite direction
*/
void setBadCount (int index, count_t count, bool rev_count = false);
/** increment bad query count of given translation by 1
*
* @param index index of translation
* @param rev_count dito, in opposite direction
*/
void incBadCount (int index, bool rev_count = false);
/** increment query count of given translation by 1
*
* @param index index of translation
* @param rev_count dito, in opposite direction
*/
void incQueryCount (int index, bool rev_count = false);
protected:
void Init();
private:
TQString origin;
// all these vectors must be deleted in removeTranslation()
vector<TQString> exprtypes;
vector<TQString> translations;
vector<TQString> remarks;
vector<TQString> usageLabels;
vector<TQString> paraphrases;
vector<TQString> fauxAmi;
vector<TQString> rev_fauxAmi;
vector<TQString> synonym;
vector<TQString> example;
vector<TQString> antonym;
vector<TQString> pronunces;
vector<grade_t> grades;
vector<grade_t> rev_grades;
vector<count_t> qcounts;
vector<count_t> rev_qcounts;
vector<count_t> bcounts;
vector<count_t> rev_bcounts;
vector<time_t> qdates;
vector<time_t> rev_qdates;
vector<Conjugation> conjugations;
vector<Comparison> comparisons;
vector<MultipleChoice> mcs;
int lesson;
bool inquery;
bool active;
};
#endif // KEduVocExpression_H
|