Overview  Package   Class  Use  Deprecated  Index
Home >> All >> org >> bdgp >> apps >> dagedit >> [ datamodel overview ]	PREV CLASS  NEXT CLASS
SUMMARY:  JAVADOC |  SOURCE |  DOWNLOAD | NESTED | FIELD | CONSTR | METHOD	DETAIL: FIELD | CONSTR | METHOD

---

org.bdgp.apps.dagedit.datamodel
Class TermRelationship  

java.lang.Object
  org.bdgp.apps.dagedit.datamodel.TermRelationship

All Implemented Interfaces:

java.lang.Cloneable, java.io.Serializable, javax.swing.undo.StateEditable

---

public class TermRelationship

extends java.lang.Object

implements javax.swing.undo.StateEditable, java.lang.Cloneable, java.io.Serializable

---

Field Summary
protected  Term	child
private static java.util.Hashtable	lookedAt
protected  Term	parent
protected  TermRelationshipType	type

 

Fields inherited from interface javax.swing.undo.StateEditable

RCSID

 

Constructor Summary

TermRelationship(Term child, Term parent, TermRelationshipType type)

 

Method Summary
java.lang.Object	clone()           This method may be called to create a new copy of the Object.
boolean	equals(java.lang.Object o)           Determine whether this Object is semantically equal to another Object.
protected  boolean	equals(java.lang.Object a, java.lang.Object b)
java.util.Enumeration	getAllDescendants(boolean includeSelf)
Term	getChild()
private  java.lang.String	getNSpaces(int depth)
Term	getParent()
javax.swing.tree.TreePath[]	getPaths()
java.util.Vector	getPathsAsVector()
protected  java.util.Vector	getPathsAsVector(int depth, java.util.Hashtable lookedAt)
TermRelationshipType	getType()
private static void	getUniqueChildNodesHash(java.util.Hashtable hash, TermRelationship tr)
int	hashCode()           Get a value that represents this Object, as uniquely as possible within the confines of an int.
static boolean	pathIsCircular(javax.swing.tree.TreePath path)
void	restoreState(java.util.Hashtable in)           Performs an edit action, taking any editable state information from the specified hash table.
void	setType(TermRelationshipType in)
void	storeState(java.util.Hashtable in)           Stores any editable state information into the specified hash table.
java.lang.String	toString()           Convert this Object to a human-readable String.
static javax.swing.tree.TreePath	trimCircularPath(javax.swing.tree.TreePath path)

 

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

 

Field Detail

child

protected Term child

---

parent

protected Term parent

---

type

protected TermRelationshipType type

---

lookedAt

private static final java.util.Hashtable lookedAt

Constructor Detail

TermRelationship

public TermRelationship(Term child,
                        Term parent,
                        TermRelationshipType type)

Method Detail

clone

public java.lang.Object clone()

Description copied from class: java.lang.Object

This method may be called to create a new copy of the Object. The typical behavior is as follows:

• o == o.clone() is false
• o.getClass() == o.clone().getClass() is true
• o.equals(o) is true

However, these are not strict requirements, and may be violated if necessary. Of the three requirements, the last is the most commonly violated, particularly if the subclass does not override Object.equals(Object)>Object.equals(Object) 55 .

If the Object you call clone() on does not implement java.lang.Cloneable (which is a placeholder interface), then a CloneNotSupportedException is thrown. Notice that Object does not implement Cloneable; this method exists as a convenience for subclasses that do.

Object's implementation of clone allocates space for the new Object using the correct class, without calling any constructors, and then fills in all of the new field values with the old field values. Thus, it is a shallow copy. However, subclasses are permitted to make a deep copy.

All array types implement Cloneable, and override this method as follows (it should never fail):

 public Object clone()
 {
   try
     {
       super.clone();
     }
   catch (CloneNotSupportedException e)
     {
       throw new InternalError(e.getMessage());
     }
 }
 

---

getChild

public Term getChild()

---

getParent

public Term getParent()

---

getType

public TermRelationshipType getType()

---

pathIsCircular

public static boolean pathIsCircular(javax.swing.tree.TreePath path)

---

trimCircularPath

public static javax.swing.tree.TreePath trimCircularPath(javax.swing.tree.TreePath path)

---

getAllDescendants

public java.util.Enumeration getAllDescendants(boolean includeSelf)

---

getUniqueChildNodesHash

private static void getUniqueChildNodesHash(java.util.Hashtable hash,
                                            TermRelationship tr)

---

setType

public void setType(TermRelationshipType in)

---

storeState

public void storeState(java.util.Hashtable in)

Description copied from interface: javax.swing.undo.StateEditable

Stores any editable state information into the specified hash table.

Specified by:

storeState in interface javax.swing.undo.StateEditable

---

restoreState

public void restoreState(java.util.Hashtable in)

Description copied from interface: javax.swing.undo.StateEditable

Performs an edit action, taking any editable state information from the specified hash table.

Note to implementors of this interface: To increase efficiency, the StateEdit class StateEdit.removeRedundantState()>StateEdit.removeRedundantState() 55 removes redundant state information. Therefore, implementations of this interface must be prepared for the case where certain keys were stored into the table by StateEditable.storeState(java.util.Hashtable)>StateEditable.storeState(java.util.Hashtable) 55 , but are not present anymore when the restoreState method gets called.

Specified by:

restoreState in interface javax.swing.undo.StateEditable

---

getPaths

public javax.swing.tree.TreePath[] getPaths()

---

getPathsAsVector

public java.util.Vector getPathsAsVector()

---

getPathsAsVector

protected java.util.Vector getPathsAsVector(int depth,
                                            java.util.Hashtable lookedAt)

---

getNSpaces

private java.lang.String getNSpaces(int depth)

---

equals

protected boolean equals(java.lang.Object a,
                         java.lang.Object b)

---

hashCode

public int hashCode()

Description copied from class: java.lang.Object

Get a value that represents this Object, as uniquely as possible within the confines of an int.

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

• Semantic equality implies identical hashcodes. In other words, if a.equals(b) is true, then a.hashCode() == b.hashCode() must be as well. However, the reverse is not necessarily true, and two objects may have the same hashcode without being equal.
• It must be consistent. Whichever value o.hashCode() returns on the first invocation must be the value returned on all later invocations as long as the object exists. Notice, however, that the result of hashCode may change between separate executions of a Virtual Machine, because it is not invoked on the same object.

Notice that since hashCode is used in java.util.Hashtable and other hashing classes, a poor implementation will degrade the performance of hashing (so don't blindly implement it as returning a constant!). Also, if calculating the hash is time-consuming, a class may consider caching the results.

The default implementation returns System.identityHashCode(this)

---

equals

public boolean equals(java.lang.Object o)

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.

---

toString

public java.lang.String toString()

Description copied from class: java.lang.Object

Convert this Object to a human-readable String. There are no limits placed on how long this String should be or what it should contain. We suggest you make it as intuitive as possible to be able to place it into System.out.println() 55 and such.

It is typical, but not required, to ensure that this method never completes abruptly with a java.lang.RuntimeException.

This method will be called when performing string concatenation with this object. If the result is null, string concatenation will instead use "null".

The default implementation returns getClass().getName() + "@" + Integer.toHexString(hashCode()).

---

Overview  Package   Class  Use  Deprecated  Index
Home >> All >> org >> bdgp >> apps >> dagedit >> [ datamodel overview ]	PREV CLASS  NEXT CLASS
SUMMARY:  JAVADOC |  SOURCE |  DOWNLOAD | NESTED | FIELD | CONSTR | METHOD	DETAIL: FIELD | CONSTR | METHOD

---