baseCode - 0.2.5

Clover coverage report - baseCode - 0.2.5

Coverage timestamp: Tue Apr 12 2005 11:31:58 EDT

FRAMES NO FRAMES

file stats:	LOC:	98		Methods:	10
	NCLOC:	37		Classes:	1

30 day Evaluation Version distributed via the Maven Jar Repository. Clover is not free. You have 30 days to evaluate it. Please visit http://www.thecortex.net/clover to obtain a licensed version of Clover

Source file

Conditionals

Statements

Methods

TOTAL

BinaryTreeNode.java

 package baseCode.dataStructure.tree;
 
 import baseCode.common.Visitable;
 
 /**
  * <hr>
  * <p>
  * Copyright (c) 2004 Columbia University
  * 
  * @author pavlidis
  * @version $Id: BinaryTreeNode.java,v 1.1 2004/07/29 08:38:49 pavlidis Exp $
  */
 public class BinaryTreeNode extends Visitable {
 
    private BinaryTreeNode left;
    private BinaryTreeNode right;
    private Object contents;
 
    /**
     * @param left
     * @param right
     * @param contents
     */
    public BinaryTreeNode( Object contents ) {
       super();
       this.contents = contents;
    }
    
    public BinaryTreeNode() {
       super();
    }
 
    /*
     * (non-Javadoc)
     * 
     * @see java.lang.Comparable#compareTo(java.lang.Object)
     */
    public int compareTo( Object o ) {
       // TODO Auto-generated method stub
       return 0;
    }
 
    /**
     * 
     * @return
     */
    public Object getContents() {
       return contents;
    }
    
    /**
     * 
     * @param contents
     */
    public void setContents( Object contents ) {
       this.contents = contents;
    }
    
    /**
     * 
     * @return
     */
    public BinaryTreeNode getLeft() {
       return left;
    }
    
    /**
     * 
     * @param left
     */
    public void setLeft( BinaryTreeNode left ) {
       this.left = left;
    }
    
    /**
     * 
     * @return
     */
    public BinaryTreeNode getRight() {
       return right;
    }
    
    /**
     * 
     * @param right
     */
    public void setRight( BinaryTreeNode right ) {
       this.right = right;
    }
    
    /**
     * 
     * @return
     */
    public boolean isLeaf() {
       return left == null && right == null;
    }
 }

1		package baseCode.dataStructure.tree;
2
3		import baseCode.common.Visitable;
4
5		/**
6		* <hr>
7		* <p>
8		* Copyright (c) 2004 Columbia University
9		*
10		* @author pavlidis
11		* @version $Id: BinaryTreeNode.java,v 1.1 2004/07/29 08:38:49 pavlidis Exp $
12		*/
13		public class BinaryTreeNode extends Visitable {
14
15		private BinaryTreeNode left;
16		private BinaryTreeNode right;
17		private Object contents;
18
19		/**
20		* @param left
21		* @param right
22		* @param contents
23		*/
24	0	public BinaryTreeNode( Object contents ) {
25	0	super();
26	0	this.contents = contents;
27		}
28
29	0	public BinaryTreeNode() {
30	0	super();
31		}
32
33		/*
34		* (non-Javadoc)
35		*
36		* @see java.lang.Comparable#compareTo(java.lang.Object)
37		*/
38	0	public int compareTo( Object o ) {
39		// TODO Auto-generated method stub
40	0	return 0;
41		}
42
43		/**
44		*
45		* @return
46		*/
47	0	public Object getContents() {
48	0	return contents;
49		}
50
51		/**
52		*
53		* @param contents
54		*/
55	0	public void setContents( Object contents ) {
56	0	this.contents = contents;
57		}
58
59		/**
60		*
61		* @return
62		*/
63	0	public BinaryTreeNode getLeft() {
64	0	return left;
65		}
66
67		/**
68		*
69		* @param left
70		*/
71	0	public void setLeft( BinaryTreeNode left ) {
72	0	this.left = left;
73		}
74
75		/**
76		*
77		* @return
78		*/
79	0	public BinaryTreeNode getRight() {
80	0	return right;
81		}
82
83		/**
84		*
85		* @param right
86		*/
87	0	public void setRight( BinaryTreeNode right ) {
88	0	this.right = right;
89		}
90
91		/**
92		*
93		* @return
94		*/
95	0	public boolean isLeaf() {
96	0	return left == null && right == null;
97		}
98		}