ptreenode.java
来自「多关联分类算法」· Java 代码 · 共 53 行
JAVA
53 行
/* -------------------------------------------------------------------------- *//* *//* P A R T I A L S U P P O R T T R E E N O D E *//* *//* Frans Coenen *//* *//* Wednesday 9 January 2003 *//* (Revised 5/7/2003) *//* *//* Department of Computer Science *//* The University of Liverpool *//* *//* -------------------------------------------------------------------------- *//** Tree structure to store Ptree nodes. <P> Same as top level structure but with the addition of a sibling branch. @author Frans Coenen@version 5 July 2003 */public class PtreeNode { /*------------------------------------------------------------------------*/ /* */ /* FIELDS */ /* */ /*------------------------------------------------------------------------*/ /** Partial support for the rows. */ public int support = 1; /** Array of short (16 bit) integers describing the row. */ public short[] itemSet = null; /** Pointer to child structure. */ public PtreeNode childRef = null; /** Pointer to sibling structurte. */ public PtreeNode siblingRef = null; /*---------------------------------------------------------------------*/ /* */ /* CONSTRUCTORS */ /* */ /*---------------------------------------------------------------------*/ /** Create P-tree node (other than top-level node) @param newItemSet the itemset to be stored at the node. */ public PtreeNode(short[] newItemSet) { itemSet = newItemSet; } }
⌨️ 快捷键说明
复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?