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
|
/* This file is part of the FaCT++ DL reasoner
Copyright (C) 2003-2015 Dmitry Tsarkov and The University of Manchester
Copyright (C) 2015-2016 Dmitry Tsarkov
This library is free software; you can redistribute it and/or
modify it under the terms of the GNU Lesser General Public
License as published by the Free Software Foundation; either
version 2.1 of the License, or (at your option) any later version.
This library 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
Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public
License along with this library; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*/
/*******************************************************\
|* Implementation of taxonomy vertex class *|
\*******************************************************/
#include "taxVertex.h"
#include "logging.h"
// removes given pointer from neigh.
bool TaxonomyVertex :: removeLink ( bool upDirection, TaxonomyVertex* p )
{
// for all neighbours of current vertex...
for ( iterator q = begin(upDirection), q_end = end(upDirection); q < q_end; ++q )
if ( *q == p ) // if given neighbour found...
{
*q = neigh(upDirection).back();
neigh(upDirection).pop_back(); // remove last entry (by resizing)
return true; // there is at most one link for each node
}
return false; // no such link
}
void TaxonomyVertex :: incorporate ( void )
{
// setup links
iterator u, u_end = end(/*upDirection=*/true), d, d_end = end(/*upDirection=*/false);
// correct links on lower concepts...
for ( d = begin(/*upDirection=*/false); d != d_end; ++d )
{
// remove all down links
for ( u = begin(/*upDirection=*/true); u != u_end; ++u )
if ( (*d)->removeLink ( /*upDirection=*/true, *u ) )
(*u)->removeLink ( /*upDirection=*/false, *d );
// add new link between v and current
(*d)->removeLink (/*upDirection=*/true, this); // safe in general case, crucial for incremental
(*d)->addNeighbour (/*upDirection=*/true, this);
}
// add new link between v and current
for ( u = begin(/*upDirection=*/true); u != u_end; ++u )
(*u)->addNeighbour ( /*upDirection=*/false, this );
CHECK_LL_RETURN(llTaxInsert);
LL << "\nTAX:inserting '" << getPrimer()->getName() << "' with up = {";
u = begin(/*upDirection=*/true);
if ( u != u_end )
{
LL << (*u)->getPrimer()->getName();
for ( ++u; u != u_end; ++u )
LL << "," << (*u)->getPrimer()->getName();
}
LL << "} and down = {";
d = begin(/*upDirection=*/false);
if ( d != d_end )
{
LL << (*d)->getPrimer()->getName();
for ( ++d; d != d_end; ++d )
LL << "," << (*d)->getPrimer()->getName();
}
LL << "}";
}
/// remove one half of a given node from a graph
void
TaxonomyVertex :: removeLinks ( bool upDirection )
{
for ( iterator p = begin(upDirection), p_end = end(upDirection); p != p_end; ++p )
(*p)->removeLink ( !upDirection, this );
clearLinks(upDirection);
}
void TaxonomyVertex :: printSynonyms ( std::ostream& o ) const
{
fpp_assert ( sample != NULL );
if ( likely(synonyms.empty()) )
o << '"' << getPrimer()->getName() << '"';
else
{
o << "(\"" << getPrimer()->getName();
for ( syn_iterator q = begin_syn(), q_end = end_syn(); q < q_end; ++q )
o << "\"=\"" << (*q)->getName();
o << "\")";
}
}
void TaxonomyVertex :: printNeighbours ( std::ostream& o, bool upDirection ) const
{
// write number of elements
o << " {" << neigh(upDirection).size() << ":";
TVSet sorted ( begin(upDirection), end(upDirection) );
for ( TVSet::const_iterator p = sorted.begin(), p_end = sorted.end(); p != p_end; ++p )
o << " \"" << (*p)->getPrimer()->getName() << '"';
o << "}";
}
/// print taxonomy vertex in format <equals parents children>
void
TaxonomyVertex :: print ( std::ostream& o ) const
{
printSynonyms(o);
printNeighbours ( o, true );
printNeighbours ( o, false );
o << "\n";
}
|
