|
|||||||||||||||||||
| 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 | |||||||||||||||
| TreeNode.java | - | 0% | 0% | 0% |
|
||||||||||||||
| 1 |
package baseCode.dataStructure.tree;
|
|
| 2 |
|
|
| 3 |
import baseCode.common.Visitable;
|
|
| 4 |
|
|
| 5 |
/**
|
|
| 6 |
*
|
|
| 7 |
*
|
|
| 8 |
* <hr>
|
|
| 9 |
* <p>Copyright (c) 2004 Columbia University
|
|
| 10 |
* @author pavlidis
|
|
| 11 |
* @version $Id: TreeNode.java,v 1.1 2004/07/29 08:38:49 pavlidis Exp $
|
|
| 12 |
*/
|
|
| 13 |
public class TreeNode extends Visitable { |
|
| 14 |
|
|
| 15 |
private Object element;
|
|
| 16 |
private TreeNode firstChild;
|
|
| 17 |
private TreeNode nextSibling;
|
|
| 18 |
|
|
| 19 | 0 |
public Object getElement() {
|
| 20 | 0 |
return element;
|
| 21 |
} |
|
| 22 | 0 |
public void setElement( Object element ) { |
| 23 | 0 |
this.element = element;
|
| 24 |
} |
|
| 25 | 0 |
public TreeNode getFirstChild() {
|
| 26 | 0 |
return firstChild;
|
| 27 |
} |
|
| 28 | 0 |
public void setFirstChild( TreeNode firstChild ) { |
| 29 | 0 |
this.firstChild = firstChild;
|
| 30 |
} |
|
| 31 | 0 |
public TreeNode getNextSibling() {
|
| 32 | 0 |
return nextSibling;
|
| 33 |
} |
|
| 34 | 0 |
public void setNextSibling( TreeNode nextSibling ) { |
| 35 | 0 |
this.nextSibling = nextSibling;
|
| 36 |
} |
|
| 37 |
/**
|
|
| 38 |
*
|
|
| 39 |
*/
|
|
| 40 | 0 |
public TreeNode(Object k) {
|
| 41 | 0 |
element = k; |
| 42 |
} |
|
| 43 |
/* (non-Javadoc)
|
|
| 44 |
* @see java.lang.Comparable#compareTo(java.lang.Object)
|
|
| 45 |
*/
|
|
| 46 | 0 |
public int compareTo( Object o ) { |
| 47 | 0 |
return 0;
|
| 48 |
} |
|
| 49 |
|
|
| 50 |
|
|
| 51 |
|
|
| 52 |
} |
|
| 53 |
|
|
||||||||||