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
|
/*
* KSeg
* Copyright (C) 1999-2006 Ilya Baran
*
* 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.
*
* This program 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, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*
* Send comments and/or bug reports to:
* ibaran@mit.edu
*/
#include "G_refSearcher.H"
bool G_refSearcher::search(const G_refs &refs)
{
int i;
bool flag;
//first check if any given refs are true or if all given refs are false
flag = true;
for(i = 0; i < int(refs.size()); ++i) {
hash_map<G_ref *, bool>::const_iterator it = known_refs.find(refs[i]);
if(it != known_refs.end()) {
if((*it).second == true) return true;
}
else flag = false;
}
if(flag) return false;
//now do the recursive search
for(i = 0; i < int(refs.size()); ++i) {
hash_map<G_ref *, bool>::const_iterator it = known_refs.find(refs[i]);
if(it != known_refs.end()) { // if we already know about this ref
if((*it).second == true) return true;
else continue;
}
if(is_found(refs[i])) { //if the current object is what we're looking for, we're done.
known_refs[refs[i]] = true;
return true;
}
//temporaries have a life at least until the end of the block
const G_refs &next = search_next(refs[i]);
bool result;
if(next.size()) result = search(next); //recursively search
else result = false;
known_refs[refs[i]] = result;
if(result == true) return true;
}
return false;
}
|
