amaunz / libfminer

Fminer library

This URL has Read+Write access

libfminer / globals.h
100644 64 lines (50 sloc) 1.692 kb
raw blame history 
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

// globals.h
// © 2008 by Andreas Maunz, andreas@maunz.de, jun 2008
 
/*
    This file is part of LibFminer (libfminer).
 
    LibFminer 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.
 
    LibFminer 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 LibFminer.  If not, see <http://www.gnu.org/licenses/>.
 */
 
#ifndef GLOBALS_H
#define GLOBALS H
 
#include "database.h"
#include "constraints.h"
 
namespace fm {
 
    unsigned int minfreq;
    int type;
    bool do_backbone;
    bool updated;
    bool adjust_ub;
    bool do_pruning;
    bool instance_present;
    bool console_out;
    bool aromatic;
    bool refine_singles;
    bool do_output;
    bool do_yaml;
    bool gsp_out;
    bool pvalues;
    bool bbrc_sep;
    bool most_specific_trees_only;
    bool line_nrs;
 
    Database* database=NULL;
    Statistics* statistics=NULL;
    ChisqConstraint* chisq=NULL;
    GraphState* graphstate=NULL;
    CloseLegOccurrences* closelegoccurrences=NULL; 
    LegOccurrences* legoccurrences=NULL;
 
    vector<string>* result=NULL;
    vector<LegOccurrences> candidatelegsoccurrences;
    vector<vector< CloseLegOccurrences> > candidatecloselegsoccs;
    vector<bool> candidatecloselegsoccsused;
 
    bool closelegsoccsused;
 
}
 
#endif