MorphDeserializer.cpp
3.55 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
/*
* File: MorphDeserializer.cpp
* Author: mlenart
*
* Created on 12 listopad 2013, 15:31
*/
#include <map>
#include <algorithm>
//#include <cstdint>
#include "MorphDeserializer.hpp"
#include "EncodedInterpretation.hpp"
#include "InterpsGroup.hpp"
const uint8_t LEMMA_ONLY_LOWER = 0;
const uint8_t LEMMA_UPPER_PREFIX = 1;
const uint8_t LEMMA_MIXED_CASE = 2;
const unsigned int MAX_WORD_SIZE = 256;
MorphDeserializer::MorphDeserializer() {
}
MorphDeserializer::~MorphDeserializer() {
}
//static void deserializeLemma(const unsigned char*& ptr, EncodedForm& lemma) {
// // XXX uważać na poprawność danych
// lemma.suffixToCut = *ptr;
// ptr++;
// lemma.suffixToAdd = (const char*) ptr;
// ptr += strlen((const char*) ptr) + 1;
// assert(lemma.casePattern.size() == 0);
//// lemma.casePattern.resize(MAX_WORD_SIZE, false);
// uint8_t casePatternType = *ptr;
// ptr++;
// uint8_t prefixLength;
// uint8_t patternLength;
// switch (casePatternType) {
// case LEMMA_ONLY_LOWER:
// break;
// case LEMMA_UPPER_PREFIX:
// prefixLength = *ptr;
// ptr++;
// for (unsigned int i = 0; i < prefixLength; i++) {
//// lemma.casePattern[i] = true;
// lemma.casePattern.push_back(true);
// }
//// lemma.casePattern.resize(prefixLength, true);
// break;
// case LEMMA_MIXED_CASE:
// patternLength = *ptr;
// ptr++;
// for (unsigned int i = 0; i < patternLength; i++) {
// uint8_t idx = *ptr;
// ptr++;
//// lemma.casePattern[idx] = true;
// lemma.casePattern.resize(idx + 1, false);
// lemma.casePattern[idx] = true;
// }
// break;
// }
//}
//
//static void deserializeInterp(const unsigned char*& ptr, EncodedInterpretation& interp) {
// interp.type = *ptr;
// ptr++;
// deserializeLemma(ptr, interp.value);
// interp.tag = ntohs(*(reinterpret_cast<const uint16_t*>(ptr)));
// ptr += 2;
// interp.nameClassifier = *ptr;
// ptr++;
//}
long MorphDeserializer::deserialize(const unsigned char* ptr, vector<InterpsGroup>& interps) const {
const unsigned char* currPtr = ptr;
uint8_t interpTypesNum = *currPtr;
currPtr++;
interps.clear();
interps.reserve(interpTypesNum);
for (unsigned int i = 0; i < interpTypesNum; i++) {
InterpsGroup ig;
ig.type = *currPtr;
currPtr++;
ig.size = ntohs(*(reinterpret_cast<const uint16_t*>(currPtr)));
currPtr += 2;
ig.ptr = currPtr;
currPtr += ig.size;
interps.push_back(ig);
}
return currPtr - ptr;
}
//long MorphDeserializer::deserialize(const unsigned char* ptr, vector<InterpsGroup>& interps) const {
// const unsigned char* currPtr = ptr;
// uint8_t interpsNum = *ptr;
// interps.clear();
// interps.reserve(interpsNum);
// currPtr++;
// // FIXME - to jest do poprawy
// map<int, InterpsGroup> results;
// for (unsigned int i = 0; i < interpsNum; ++i) {
// EncodedInterpretation interp;
// deserializeInterp(currPtr, interp);
// if (results.count(interp.type) == 0) {
// results[interp.type] = InterpsGroup(interp.type);
// }
// results[interp.type].addInterpretation(interp);
//// interps.push_back(interp);
// }
// map<int, InterpsGroup>::iterator it;
// for (it = results.begin(); it != results.end(); ++it) {
// interps.push_back((*it).second);
// }
// return currPtr - ptr;
//}