Docjar: A Java Source and Docuemnt Enginecom.*    java.*    javax.*    org.*    all    new    plug-in

Quick Search    Search Deep

Class FileSystemElement  view FileSystemElement download

  extended byjavax.swing.tree.DefaultMutableTreeNode
      extended byorg.ccdtovcd.FileSystemElement
All Implemented Interfaces:
java.lang.Cloneable, java.lang.Comparable, javax.swing.tree.MutableTreeNode,, javax.swing.tree.TreeNode
Direct Known Subclasses:
FileSystemFile, FileSystemFolder

public class FileSystemElement
extends javax.swing.tree.DefaultMutableTreeNode
implements java.lang.Comparable,

Nested Class Summary
Nested classes inherited from class javax.swing.tree.DefaultMutableTreeNode
Field Summary
protected  java.lang.String name
protected  boolean reserved
Fields inherited from class javax.swing.tree.DefaultMutableTreeNode
allowsChildren, children, EMPTY_ENUMERATION, parent, userObject
Constructor Summary
FileSystemElement(java.lang.String name, boolean reserved)
Method Summary
 int compareTo(java.lang.Object elem1)
          Compares this object with another, and returns a numerical result based on the comparison.
 boolean equals(java.lang.Object elem2)
          Determine whether this Object is semantically equal to another Object.
 java.lang.String getName()
 boolean isReserved()
 void setName(java.lang.String name)
 void setReserved(boolean reserved)
 java.lang.String toString()
          Returns a string representation of the node.
Methods inherited from class javax.swing.tree.DefaultMutableTreeNode
add, breadthFirstEnumeration, children, clone, depthFirstEnumeration, getAllowsChildren, getChildAfter, getChildAt, getChildBefore, getChildCount, getDepth, getFirstChild, getFirstLeaf, getIndex, getLastChild, getLastLeaf, getLeafCount, getLevel, getNextLeaf, getNextNode, getNextSibling, getParent, getPath, getPathToRoot, getPreviousLeaf, getPreviousNode, getPreviousSibling, getRoot, getSharedAncestor, getSiblingCount, getUserObject, getUserObjectPath, insert, isLeaf, isNodeAncestor, isNodeChild, isNodeDescendant, isNodeRelated, isNodeSibling, isRoot, pathFromAncestorEnumeration, postorderEnumeration, preorderEnumeration, remove, remove, removeAllChildren, removeFromParent, setAllowsChildren, setParent, setUserObject
Methods inherited from class java.lang.Object
finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail


protected boolean reserved


protected java.lang.String name
Constructor Detail


public FileSystemElement(java.lang.String name,
                         boolean reserved)


public FileSystemElement()
Method Detail


public boolean isReserved()


public void setReserved(boolean reserved)


public java.lang.String getName()


public void setName(java.lang.String name)


public int compareTo(java.lang.Object elem1)
Description copied from interface: java.lang.Comparable
Compares this object with another, and returns a numerical result based on the comparison. If the result is negative, this object sorts less than the other; if 0, the two are equal, and if positive, this object sorts greater than the other. To translate this into boolean, simply perform o1.compareTo(o2) <op> 0, where op is one of <, <=, =, !=, >, or >=.

You must make sure that the comparison is mutual, ie. sgn(x.compareTo(y)) == -sgn(y.compareTo(x)) (where sgn() is defined as -1, 0, or 1 based on the sign). This includes throwing an exception in either direction if the two are not comparable; hence, compareTo(null) should always throw an Exception.

You should also ensure transitivity, in two forms: x.compareTo(y) > 0 && y.compareTo(z) > 0 implies x.compareTo(z) > 0; and x.compareTo(y) == 0 implies x.compareTo(z) == y.compareTo(z).

Specified by:
compareTo in interface java.lang.Comparable


public boolean equals(java.lang.Object elem2)
Description copied from class: java.lang.Object
Determine whether this Object is semantically equal to another Object.

There are some fairly strict requirements on this method which subclasses must follow:

  • It must be transitive. If a.equals(b) and b.equals(c), then a.equals(c) must be true as well.
  • It must be symmetric. a.equals(b) and b.equals(a) must have the same value.
  • It must be reflexive. a.equals(a) must always be true.
  • It must be consistent. Whichever value a.equals(b) returns on the first invocation must be the value returned on all later invocations.
  • a.equals(null) must be false.
  • It must be consistent with hashCode(). That is, a.equals(b) must imply a.hashCode() == b.hashCode(). The reverse is not true; two objects that are not equal may have the same hashcode, but that has the potential to harm hashing performance.

This is typically overridden to throw a java.lang.ClassCastException if the argument is not comparable to the class performing the comparison, but that is not a requirement. It is legal for a.equals(b) to be true even though a.getClass() != b.getClass(). Also, it is typical to never cause a java.lang.NullPointerException.

In general, the Collections API (java.util) use the equals method rather than the == operator to compare objects. However, java.util.IdentityHashMap is an exception to this rule, for its own good reasons.

The default implementation returns this == o.


public java.lang.String toString()
Description copied from class: javax.swing.tree.DefaultMutableTreeNode
Returns a string representation of the node. This implementation returns getUserObject().toString(), or null if there is no user object.