Main Page | Modules | Namespace List | Data Structures | File List | Data Fields | Globals

TreeNode.h

Go to the documentation of this file.
00001 /*
00002  
00003 Copyright (c) 2004, Cornell University
00004 All rights reserved.
00005  
00006 Redistribution and use in source and binary forms, with or without
00007 modification, are permitted provided that the following conditions are met:
00008  
00009    - Redistributions of source code must retain the above copyright notice,
00010        this list of conditions and the following disclaimer.
00011    - Redistributions in binary form must reproduce the above copyright
00012        notice, this list of conditions and the following disclaimer in the
00013        documentation and/or other materials provided with the distribution.
00014    - Neither the name of Cornell University nor the names of its
00015        contributors may be used to endorse or promote products derived from
00016        this software without specific prior written permission.
00017  
00018 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
00019 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
00020 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
00021 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
00022 LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
00023 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
00024 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
00025 INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
00026 CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
00027 ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
00028 THE POSSIBILITY OF SUCH DAMAGE.
00029  
00030 */
00031 
00032 
00033 /////////////////////////////////////////////////////////////////////
00034 ///
00035 /// TreeNode.h
00036 ///
00037 /////////////////////////////////////////////////////////////////////
00038 
00039 #ifndef __TREENODE_H
00040 #define __TREENODE_H
00041 
00042 #include "SeqBitmap.h"
00043 #include "DatasetInfo.h"
00044 
00045 /////////////////////////////////////////////////////////////////////
00046 /// @ingroup AlgorithmicComponents
00047 ///
00048 /// A class for representing nodes in the search tree.
00049 /////////////////////////////////////////////////////////////////////
00050 class TreeNode
00051 {
00052 
00053 public:
00054     /// Constructor
00055     TreeNode()
00056     {
00057         f1 = 0;
00058         f1Name = 0;
00059         f1Size = 0;
00060         sList = 0;
00061         sLength = 0;
00062         iList = 0;
00063         iLength = 0;
00064         iBitmap = 0;
00065         level = 0;
00066     }
00067 
00068     /// Destructor
00069     ~TreeNode()
00070     {}
00071 
00072 
00073     /// bitmaps of frequent-1 itemsets
00074     SeqBitmap** f1;
00075 
00076     /// names of the corresponding frequent-1 itemsets
00077     int* f1Name;
00078 
00079     /// number of frequent-1 itemsets
00080     int f1Size;
00081 
00082     /// list of s-extensions for this node
00083     int* sList;
00084 
00085     /// number of s-extensions
00086     int sLength;
00087 
00088     /// list of i-extensions for this node
00089     int* iList;
00090 
00091     /// number of i-extensions
00092     int iLength;
00093 
00094     /// the i-bitmap of the current node
00095     SeqBitmap* iBitmap;
00096 
00097     /// overall level of this node in the tree
00098     int level;
00099 
00100     /// the number of s-steps that have been taken to reach this node in the tree
00101     int sLevel;
00102 
00103     /// Whether or not compression will be performed at this node
00104     bool compress;
00105 
00106     /// Support count information for all of the frequent extensions from this node
00107     static CountInfo* countList;
00108 
00109 };
00110 
00111 #endif

Generated on Thu Mar 11 12:01:52 2004 for SPAM by doxygen 1.3.4