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
|
/*
Copyright (c) 1998 - 2024
ILK - Tilburg University
CLST - Radboud University
CLiPS - University of Antwerp
This file is part of timbl
timbl 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 3 of the License, or
(at your option) any later version.
timbl is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, see <http://www.gnu.org/licenses/>.
For questions and suggestions, see:
https://github.com/LanguageMachines/timbl/issues
or send mail to:
lamasoftware (at ) science.ru.nl
*/
#ifndef TIMBL_BESTARRAY_H
#define TIMBL_BESTARRAY_H
#include <vector>
#include <iosfwd>
#include <cstddef>
#include "unicode/unistr.h"
#include "libxml/parser.h"
#include "ticcutils/json.hpp"
#include "timbl/Targets.h"
namespace Timbl {
class neighborSet;
class BestRec {
friend std::ostream& operator<< ( std::ostream&, const BestRec * );
public:
BestRec();
BestRec( const BestRec& ) = delete; // forbid copies
BestRec& operator=( const BestRec& ) = delete; // forbid copies
~BestRec();
size_t totalBests() const { return aggregateDist.totalSize(); };
double bestDistance;
ClassDistribution aggregateDist;
std::vector<ClassDistribution*> bestDistributions;
std::vector<icu::UnicodeString> bestInstances;
private:
};
class BestArray {
friend std::ostream& operator<< ( std::ostream&, const BestArray& );
public:
BestArray(): _storeInstances(false),
_showDi(false),
_showDb(false),
size(0),
maxBests(0)
{};
~BestArray();
void init( unsigned int, unsigned int, bool, bool, bool );
double addResult( double,
const ClassDistribution *,
const icu::UnicodeString& );
void initNeighborSet( neighborSet& ) const;
void addToNeighborSet( neighborSet& , size_t ) const;
xmlNode *toXML() const;
nlohmann::json to_JSON() const;
nlohmann::json record_to_json( const BestRec *, size_t ) const;
private:
bool _storeInstances;
bool _showDi;
bool _showDb;
unsigned int size;
unsigned int maxBests;
std::vector<BestRec *> bestArray;
};
}
#endif // TIMBL_BESTARRAY_H
|