classtree__instance.tex

这是一个用于数据挖掘的常用算法的模板库（数据挖掘的C++模板库for UNIX)

\section{tree\_\-instance$<$ MATCH\_\-LABEL\_\-T, order $>$ Class Template Reference}
\label{classtree__instance}\index{tree_instance@{tree\_\-instance}}
\doxyref{tree\_\-instance}{p.}{classtree__instance} class represents one \doxyref{tree\_\-instance}{p.}{classtree__instance} in a transaction  


{\tt \#include $<$tree\_\-instance.h$>$}

\subsection*{Public Types}
\begin{CompactItemize}
\item 
typedef MATCH\_\-LABEL\_\-T$<$ int $>$ \textbf{ML}\label{classtree__instance_9a56417d084ed4682ec652017b940f61}

\item 
typedef \bf{tree\_\-instance}$<$ MATCH\_\-LABEL\_\-T, order $>$ \textbf{TREE\_\-INSTANCE}\label{classtree__instance_ed7449cd69fe6b0457d3a5fdee8a225f}

\end{CompactItemize}
\subsection*{Public Member Functions}
\begin{CompactItemize}
\item 
\textbf{tree\_\-instance} (const int \&lx, const int \&ux, const int \&d=0, bool ind=0)\label{classtree__instance_17b205d8b47859ef4444a93be6a57957}

\item 
\textbf{tree\_\-instance} (ML \&ml, const int \&lx, const int \&ux, const int \&d=0, bool ind=0)\label{classtree__instance_920603c699cb234ccdaa4a22ae2f86c3}

\item 
\textbf{tree\_\-instance} (const \bf{TREE\_\-INSTANCE} \&i2, const int \&lx, const int \&d=0, bool ind=0)\label{classtree__instance_b5e3d53302329d2a1aadaf2c9d4c5f83}

\item 
const int \& \textbf{lower} () const \label{classtree__instance_eeefbae752a3a24c51776d7f53dafc9c}

\item 
const int \& \textbf{upper} () const \label{classtree__instance_d9752b471af774e1dfbd752c0e7a6a41}

\item 
bool \bf{less\_\-than} (const \bf{TREE\_\-INSTANCE} \&i2) const 
\item 
bool \bf{contains} (const \bf{TREE\_\-INSTANCE} \&i2) const 
\item 
bool \bf{match\_\-label} (const ML \&ml2) const 
\item 
bool \bf{child\_\-test} (const \bf{TREE\_\-INSTANCE} \&i2) const 
\item 
int \bf{depth\_\-diff} (const \bf{TREE\_\-INSTANCE} \&i2) const 
\item 
bool \textbf{induced} () const \label{classtree__instance_e0bc369a375ebb08c4db060a6ce33c11}

\item 
const int \& \textbf{depth} () const \label{classtree__instance_34c7f799ecd7325e6634083e472eb102}

\item 
int \textbf{get\_\-lb} () const \label{classtree__instance_c538c021a5e3531d87ca54d51fca36ee}

\item 
int \textbf{get\_\-ub} () const \label{classtree__instance_7d537121221371d8518ba2e4c9a53c69}

\item 
int \textbf{get\_\-depth} () const \label{classtree__instance_6c2363ae31cd77a73c4811e19157bc75}

\item 
ML::const\_\-iterator \textbf{get\_\-ml\_\-begin} () const \label{classtree__instance_aea0582b8ad5e0236f3154236ce60498}

\item 
ML::const\_\-iterator \textbf{get\_\-ml\_\-end} () const \label{classtree__instance_7955f864dff0481d147b786950b3512e}

\item 
int \textbf{get\_\-ml\_\-size} () const \label{classtree__instance_8d8bf7f37f6e411e51b85c9e58d1c800}

\end{CompactItemize}
\subsection*{Friends}
\begin{CompactItemize}
\item 
bool \textbf{cousin\_\-test} (const \bf{TREE\_\-INSTANCE} \&, const \bf{TREE\_\-INSTANCE} \&)\label{classtree__instance_a6ab1c983353909d6e0558266bf06e90}

\item 
ostream \& \textbf{operator$<$$<$} (ostream \&, const \bf{TREE\_\-INSTANCE} \&)\label{classtree__instance_c5a00060f3b813c76e4f8ac618187edf}

\end{CompactItemize}


\subsection{Detailed Description}
\subsubsection*{template$<$template$<$ typename $>$ class MATCH\_\-LABEL\_\-T, class order$>$ class tree\_\-instance$<$ MATCH\_\-LABEL\_\-T, order $>$}

\doxyref{tree\_\-instance}{p.}{classtree__instance} class represents one \doxyref{tree\_\-instance}{p.}{classtree__instance} in a transaction 

This class is part of tree VAT. A instance of this class represents exactly one tree instance in a transaction. It takes two template arguments. MATCH\_\-LABEL\_\-T denotes the data structure that is used to make up the tree match label. Usually a vector of int is used. order denotes a class that determine whether the tree is ordered/unordered. 



\subsection{Member Function Documentation}
\index{tree_instance@{tree\_\-instance}!child_test@{child\_\-test}}
\index{child_test@{child\_\-test}!tree_instance@{tree\_\-instance}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$template$<$ typename $>$ class MATCH\_\-LABEL\_\-T, class order$>$ bool \bf{tree\_\-instance}$<$ MATCH\_\-LABEL\_\-T, order $>$::child\_\-test (const \bf{TREE\_\-INSTANCE} \& {\em i2}) const\hspace{0.3cm}{\tt  [inline]}}\label{classtree__instance_85fb6ef92b0780fc7ffe8b5f2ac143c0}


Returns true if child test holds on $\ast$this and i2 \index{tree_instance@{tree\_\-instance}!contains@{contains}}
\index{contains@{contains}!tree_instance@{tree\_\-instance}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$template$<$ typename $>$ class MATCH\_\-LABEL\_\-T, class order$>$ bool \bf{tree\_\-instance}$<$ MATCH\_\-LABEL\_\-T, order $>$::contains (const \bf{TREE\_\-INSTANCE} \& {\em i2}) const\hspace{0.3cm}{\tt  [inline]}}\label{classtree__instance_6c2027a604839cbe2fd1ff6573ac4b0f}


Returns true if scope of $\ast$this contains that of i2 \index{tree_instance@{tree\_\-instance}!depth_diff@{depth\_\-diff}}
\index{depth_diff@{depth\_\-diff}!tree_instance@{tree\_\-instance}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$template$<$ typename $>$ class MATCH\_\-LABEL\_\-T, class order$>$ int \bf{tree\_\-instance}$<$ MATCH\_\-LABEL\_\-T, order $>$::depth\_\-diff (const \bf{TREE\_\-INSTANCE} \& {\em i2}) const\hspace{0.3cm}{\tt  [inline]}}\label{classtree__instance_fd87975b2521f09b5ba343d1a363b513}


Returns true if depth difference trees makes them induced \index{tree_instance@{tree\_\-instance}!less_than@{less\_\-than}}
\index{less_than@{less\_\-than}!tree_instance@{tree\_\-instance}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$template$<$ typename $>$ class MATCH\_\-LABEL\_\-T, class order$>$ bool \bf{tree\_\-instance}$<$ MATCH\_\-LABEL\_\-T, order $>$::\bf{less\_\-than} (const \bf{TREE\_\-INSTANCE} \& {\em i2}) const\hspace{0.3cm}{\tt  [inline]}}\label{classtree__instance_a9935c93b299c6827fd281215cbebb1f}


Returns true if scope of $\ast$this is strictly less than that of i2 \index{tree_instance@{tree\_\-instance}!match_label@{match\_\-label}}
\index{match_label@{match\_\-label}!tree_instance@{tree\_\-instance}}
\subsubsection{\setlength{\rightskip}{0pt plus 5cm}template$<$template$<$ typename $>$ class MATCH\_\-LABEL\_\-T, class order$>$ bool \bf{tree\_\-instance}$<$ MATCH\_\-LABEL\_\-T, order $>$::match\_\-label (const ML \& {\em ml2}) const\hspace{0.3cm}{\tt  [inline]}}\label{classtree__instance_84d628f3015c0e71353bf29a7309b566}


Returns true if this-$>$ml is equal to ml2 

The documentation for this class was generated from the following file:\begin{CompactItemize}
\item 
tree\_\-instance.h\end{CompactItemize}