/usr/include/timbl/IBtree.h is in libtimbl4-dev 6.4.6-1build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 | /*
$Id: IBtree.h 16820 2014-01-06 10:12:30Z sloot $
$URL: https://ilk.uvt.nl/svn/trunk/sources/Timbl6/include/timbl/IBtree.h $
Copyright (c) 1998 - 2014
ILK - Tilburg 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:
http://ilk.uvt.nl/software.html
or send mail to:
timbl@uvt.nl
*/
#ifndef TIMBL_IBTREE_H
#define TIMBL_IBTREE_H
#include "ticcutils/TreeHash.h"
#include "ticcutils/XMLtools.h"
//#define IBSTATS
namespace Timbl {
class IB_InstanceBase;
class IG_InstanceBase;
class TRIBL_InstanceBase;
class TRIBL2_InstanceBase;
class Feature;
class FeatureValue;
class Instance;
class Target;
class TargetValue;
class ValueDistribution;
class WValueDistribution;
class IBtree {
friend class InstanceBase_base;
friend class IB_InstanceBase;
friend class IG_InstanceBase;
friend class TRIBL_InstanceBase;
friend class TRIBL2_InstanceBase;
friend std::ostream &operator<<( std::ostream&, const IBtree& );
friend std::ostream &operator<<( std::ostream&, const IBtree * );
friend xmlNode *to_xml( IBtree *pnt );
friend int count_next( const IBtree * );
public:
const TargetValue* targetValue() const { return TValue; };
private:
FeatureValue *FValue;
const TargetValue *TValue;
ValueDistribution *TDistribution;
IBtree *link;
IBtree *next;
IBtree();
IBtree( FeatureValue * );
~IBtree();
IBtree *Reduce( const TargetValue *, unsigned long&, long );
#ifdef IBSTATS
inline IBtree *add_feat_val( FeatureValue *, unsigned int&, IBtree **, unsigned long& );
#else
inline IBtree *add_feat_val( FeatureValue *, IBtree **, unsigned long& );
#endif
inline ValueDistribution *sum_distributions( bool );
inline IBtree *make_unique( const TargetValue *, unsigned long& );
void cleanDistributions();
void re_assign_defaults( bool, bool );
void assign_defaults( bool, bool, size_t );
void redo_distributions();
void countBranches( unsigned int,
std::vector<unsigned int>&,
std::vector<unsigned int>& );
const ValueDistribution *exact_match( const Instance& ) const;
protected:
const IBtree *search_node( FeatureValue * ) const;
IBtree( const IBtree& );
IBtree& operator=( const IBtree& );
};
typedef std::map<size_t, const IBtree*> FI_map;
class InstanceBase_base: public MsgClass {
friend class IG_InstanceBase;
friend class TRIBL_InstanceBase;
friend class TRIBL2_InstanceBase;
InstanceBase_base( const InstanceBase_base& );
InstanceBase_base& operator=( const InstanceBase_base& );
friend std::ostream& operator<<( std::ostream &os,
const InstanceBase_base& );
friend std::ostream& operator<<( std::ostream &os,
const InstanceBase_base * );
public:
InstanceBase_base( size_t, unsigned long&, bool, bool );
virtual ~InstanceBase_base( void );
void AssignDefaults( void );
void RedoDistributions();
bool AddInstance( const Instance& );
void RemoveInstance( const Instance& );
void summarizeNodes( std::vector<unsigned int>&,
std::vector<unsigned int>& );
virtual bool MergeSub( InstanceBase_base * );
const ValueDistribution *ExactMatch( const Instance& I ) const {
return InstBase->exact_match( I ); };
virtual const ValueDistribution *InitGraphTest( std::vector<FeatureValue *>&,
const std::vector<FeatureValue *> *,
size_t,
size_t );
virtual const ValueDistribution *NextGraphTest( std::vector<FeatureValue *>&,
size_t& );
unsigned long int GetDistSize( ) const { return NumOfTails; };
virtual const ValueDistribution *IG_test( const Instance& , size_t&, bool&,
const TargetValue *& );
virtual IB_InstanceBase *TRIBL_test( const Instance& , size_t,
const TargetValue *&,
const ValueDistribution *&,
size_t& );
virtual IB_InstanceBase *TRIBL2_test( const Instance& ,
const ValueDistribution *&,
size_t& );
bool read_hash( std::istream &, Hash::StringHash *, Hash::StringHash * ) const;
virtual InstanceBase_base *Copy() const = 0;
virtual InstanceBase_base *clone() const = 0;
void Save( std::ostream &, bool=false );
void Save( std::ostream &, Hash::StringHash *, Hash::StringHash *, bool=false );
void toXML( std::ostream& );
void printStatsTree( std::ostream&, unsigned int startLevel );
virtual bool ReadIB( std::istream&, std::vector<Feature *>&,
Target *, int );
virtual bool ReadIB( std::istream &, std::vector<Feature *>&, Target *,
Hash::StringHash *, Hash::StringHash *, int );
virtual void Prune( const TargetValue *, long = 0 );
virtual bool IsPruned() const { return false; };
void CleanPartition( bool );
unsigned long int GetSizeInfo( unsigned long int&, double & ) const;
const ValueDistribution *TopDist() const { return TopDistribution; };
bool HasDistributions() const;
const TargetValue *TopTarget( bool & );
bool PersistentD() const { return PersistentDistributions; };
unsigned long int nodeCount() const { return ibCount;} ;
const IBtree *instBase() const { return InstBase; };
#ifdef IBSTATS
std::vector<unsigned int> mismatch;
#endif
protected:
bool DefAss;
bool DefaultsValid;
bool Random;
bool PersistentDistributions;
int Version;
ValueDistribution *TopDistribution;
WValueDistribution *WTop;
const TargetValue *TopT;
FI_map fast_index;
bool tiedTop;
IBtree *InstBase;
IBtree *LastInstBasePos;
const IBtree **RestartSearch;
const IBtree **SkipSearch;
const IBtree **InstPath;
unsigned long int tree_size;
unsigned long int& ibCount;
size_t Depth;
unsigned long int NumOfTails;
IBtree *read_list( std::istream &,
std::vector<Feature*>&, Target *,
int );
IBtree *read_local( std::istream &,
std::vector<Feature*>&, Target *,
int );
IBtree *read_list_hashed( std::istream &,
std::vector<Feature*>&, Target *,
int );
IBtree *read_local_hashed( std::istream &,
std::vector<Feature*>&, Target *,
int );
void write_tree( std::ostream &os, const IBtree * ) const;
void write_tree_hashed( std::ostream &os, const IBtree * ) const;
bool read_IB( std::istream &, std::vector<Feature *>&, Target *, int );
bool read_IB( std::istream &, std::vector<Feature *>&, Target *,
Hash::StringHash *, Hash::StringHash *, int );
void fill_index();
const IBtree *fast_search_node( FeatureValue * );
};
class IB_InstanceBase: public InstanceBase_base {
public:
IB_InstanceBase( size_t size, unsigned long& cnt, bool rand ):
InstanceBase_base( size, cnt, rand , false ) {
};
IB_InstanceBase *Copy() const;
IB_InstanceBase *clone() const;
const ValueDistribution *InitGraphTest( std::vector<FeatureValue *>&,
const std::vector<FeatureValue *> *,
size_t,
size_t );
const ValueDistribution *NextGraphTest( std::vector<FeatureValue *>&,
size_t& );
private:
size_t offSet;
size_t effFeat;
const std::vector<FeatureValue *> *testInst;
};
class IG_InstanceBase: public InstanceBase_base {
public:
IG_InstanceBase( size_t size, unsigned long& cnt,
bool rand, bool pruned, bool keep_dists ):
InstanceBase_base( size, cnt, rand, keep_dists ), Pruned( pruned ) {};
IG_InstanceBase *clone() const;
IG_InstanceBase *Copy() const;
void Prune( const TargetValue *, long = 0 );
void specialPrune( const TargetValue * );
bool IsPruned() const { return Pruned; };
const ValueDistribution *IG_test( const Instance& , size_t&, bool&,
const TargetValue *& );
bool ReadIB( std::istream &, std::vector<Feature *>&, Target *, int );
bool ReadIB( std::istream &, std::vector<Feature *>&, Target *,
Hash::StringHash *, Hash::StringHash *, int );
bool MergeSub( InstanceBase_base * );
protected:
bool Pruned;
};
class TRIBL_InstanceBase: public InstanceBase_base {
public:
TRIBL_InstanceBase( size_t size, unsigned long& cnt,
bool rand, bool keep_dists ):
InstanceBase_base( size, cnt, rand, keep_dists ), Threshold(0) {};
TRIBL_InstanceBase *clone() const;
TRIBL_InstanceBase *Copy() const;
IB_InstanceBase *TRIBL_test( const Instance&,
size_t,
const TargetValue *&,
const ValueDistribution *&,
size_t& );
private:
IB_InstanceBase *IBPartition( IBtree * ) const;
void AssignDefaults( size_t );
size_t Threshold;
};
class TRIBL2_InstanceBase: public InstanceBase_base {
public:
TRIBL2_InstanceBase( size_t size, unsigned long& cnt,
bool rand, bool keep_dists ):
InstanceBase_base( size, cnt, rand, keep_dists ) {
};
TRIBL2_InstanceBase *clone() const;
TRIBL2_InstanceBase *Copy() const;
IB_InstanceBase *TRIBL2_test( const Instance& ,
const ValueDistribution *&,
size_t& );
private:
IB_InstanceBase *IBPartition( IBtree * ) const;
};
}
#endif
|