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
|
/* This file is part of the FaCT++ DL reasoner
Copyright (C) 2015-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
*/
#ifndef TAXGATHERINGWALKER_H
#define TAXGATHERINGWALKER_H
#include "WalkerInterface.h"
#include "taxVertex.h"
/// taxonomy walkers that gathers all the relevant nodes
class TaxGatheringWalker : public WalkerInterface
{
protected: // types
/// vec of vertices
typedef std::vector<const TaxonomyVertex*> VertexVec;
protected: // members
/// vertices that satisfy the condition
std::vector<const TaxonomyVertex*> found;
protected: // methods
/// check whether actor is applicable to the ENTRY
virtual bool applicable ( const ClassifiableEntry* entry ) const = 0;
/// @return true iff current entry is visible
bool tryEntry ( const ClassifiableEntry* p ) const { return !p->isSystem() && applicable(p); }
/// @return true if at least one entry of a vertex V is visible
bool tryVertex ( const TaxonomyVertex& v ) const
{
if ( tryEntry(v.getPrimer()) )
return true;
for ( TaxonomyVertex::syn_iterator p = v.begin_syn(), p_end=v.end_syn(); p != p_end; ++p )
if ( tryEntry(*p) )
return true;
return false;
}
public: // interface
/// empty d'tor
virtual ~TaxGatheringWalker ( void ) {}
// found management
/// clear found
virtual void clear ( void ) { found.clear(); }
/// taxonomy walking method.
/// @return true if node was processed
/// @return false if node can not be processed in current settings
virtual bool apply ( const TaxonomyVertex& v )
{
if ( tryVertex(v) )
{
found.push_back(&v);
return true;
}
return false;
}
}; // WalkerInterface
#endif
|
