#undef BB
#undef BBStr
#undef bb
#undef bbStr
#define BB
#define BBStr( x,y,z ) ;
#define bb
#define bbStr( x,y,z ) ;
#ifndef procNestOn
#undef LB_
#undef LE_
#undef LE_ret
#undef ret
#undef ret_
#undef __
#undef ___
#define LB_( x )
{
#define LE_
}
#define ret_ return ;
#define LE_ret( x ) return( x );
#define ret( x ) return( x );
#define __
#define ___
#endif
/* Module ut/Btree_ut Btree.ic
*****************************************************************************
Author Gebhard.Greiter@softlab.de
*/
#include rbuffer.h : cpp
#include btree.h : cpp
class Btree_ut
top . is_inc_for . C++
/* _____________________________________________________________________________ R e u s e . f o r . ALL Utilities around Btree. _____________________________________________________________________________ */ { public: protected: private: // exported methods: public: Btree * Btree_ut :: to_tree ( char * from /* ----------------------------------------------------------------------------- Read Btree from file 'from containing lines of the form \n~key~value~ ----------------------------------------------------------------------------- */ ) ; public: uint Btree_ut :: create_transitive_Closure /* ----------------------------------------------------------------------------- Create the transitive closure >> of a binary relation > given by records >f1=f2 in Btree REL Return the cardinality of >> and << ( << the invers of >> ). ----------------------------------------------------------------------------- */ ( Btree & REL , Btree * RELnN // is to contain the transitive closure << of <, Btree * RELNn // is to contain the transitive closure >> of > ) ; #include btree_ut.h3 : cpp } ; #endif