protected static class SimpleBinaryTreeView.BTNodeLoc extends Object implements NodeLocation, Locatable<SimpleBinaryTreeView.BTNodeLoc>
Modifier and Type | Field and Description |
---|---|
int |
depth
Depth of this node in the tree.
|
jgrasp.viewer.presentation.SimpleBinaryTreeView.NodeInfo |
ni
Additional node information.
|
double |
p
Sibling position, in units of element width in sibling direction.
|
BitSet |
path
Path from the root to the node, where a zero bit indicates "left" and
a one bit indicates "right".
|
int |
row
Index of structure, where zero is the main tree structure and the
following indices are the local variable trees.
|
String |
rowId
Identifier that indicates which local variable the row came from.
|
Object |
scopeID
Local variable scope identifier.
|
Constructor and Description |
---|
BTNodeLoc(int r,
String rId,
Object scope,
int depthIn,
BitSet pathIn,
jgrasp.viewer.presentation.SimpleBinaryTreeView.NodeInfo nodeInfo)
Creates a new BTNodeLoc.
|
Modifier and Type | Method and Description |
---|---|
boolean |
equals(Object o)
Indicates whether some other object is "equal to" this one.
|
String |
getEntryDescription()
Gets a description to be used in a subview.
|
String |
getLabel()
Gets a label for the node location, such as an index label, or null if
none should be shown.
|
int |
getRow()
Gets the node's row, where row 0 is the main structure and nodes 1 and
beyond are local variable structures.
|
String |
getRowId()
Gets the node's row ID, where nodes with the same ID should be from the
same local variable.
|
Object |
getScope()
Gets a key for the scope of the local variable.
|
int |
hashCode()
Returns a hash code value for the object.
|
boolean |
isMoved(SimpleBinaryTreeView.BTNodeLoc loc)
Determines if the location of this and a node location are different
within a structure.
|
boolean |
isRepositioned(SimpleBinaryTreeView.BTNodeLoc loc)
Determines if the location of this and a node location would require
animation if they were two locations of a single node, assuming
Locatable.isMoved(NodeLocation) returned false for the other node. |
String |
toString()
Returns a string representation of the object.
|
public int row
public String rowId
public Object scopeID
public int depth
public double p
public BitSet path
public jgrasp.viewer.presentation.SimpleBinaryTreeView.NodeInfo ni
public BTNodeLoc(int r, String rId, Object scope, int depthIn, BitSet pathIn, jgrasp.viewer.presentation.SimpleBinaryTreeView.NodeInfo nodeInfo)
r
- the structure index, where zero is the main structure and the
following indices are the local variable trees.rId
- a row id, where this should be the same if the row
represents the same local variable.scope
- key for the scope of the local variable.depthIn
- the depth of this node in its tree.nodeInfo
- additional node information.pathIn
- path from the root to the node, where a zero bit
indicates "left" and a one bit indicates "right".public boolean equals(Object o)
The equals
method implements an equivalence relation
on non-null object references:
x
, x.equals(x)
should return
true
.
x
and y
, x.equals(y)
should return true
if and only if
y.equals(x)
returns true
.
x
, y
, and z
, if
x.equals(y)
returns true
and
y.equals(z)
returns true
, then
x.equals(z)
should return true
.
x
and y
, multiple invocations of
x.equals(y)
consistently return true
or consistently return false
, provided no
information used in equals
comparisons on the
objects is modified.
x
,
x.equals(null)
should return false
.
The equals
method for class Object
implements
the most discriminating possible equivalence relation on objects;
that is, for any non-null reference values x
and
y
, this method returns true
if and only
if x
and y
refer to the same object
(x == y
has the value true
).
Note that it is generally necessary to override the hashCode
method whenever this method is overridden, so as to maintain the
general contract for the hashCode
method, which states
that equal objects must have equal hash codes.
equals
in class Object
o
- the reference object with which to compare.true
if this object is the same as the obj
argument; false
otherwise.Object.hashCode()
,
HashMap
public String getEntryDescription()
getEntryDescription
in interface NodeLocation
public String getLabel()
getLabel
in interface NodeLocation
public int getRow()
getRow
in interface NodeLocation
public String getRowId()
getRowId
in interface NodeLocation
public Object getScope()
getScope
in interface NodeLocation
public int hashCode()
HashMap
.
The general contract of hashCode
is:
hashCode
method
must consistently return the same integer, provided no information
used in equals
comparisons on the object is modified.
This integer need not remain consistent from one execution of an
application to another execution of the same application.
equals(Object)
method, then calling the hashCode
method on each of
the two objects must produce the same integer result.
Object.equals(java.lang.Object)
method, then calling the hashCode
method on each of the
two objects must produce distinct integer results. However, the
programmer should be aware that producing distinct integer results
for unequal objects may improve the performance of hash tables.
As much as is reasonably practical, the hashCode method defined by
class Object
does return distinct integers for distinct
objects. (This is typically implemented by converting the internal
address of the object into an integer, but this implementation
technique is not required by the
Java™ programming language.)
hashCode
in class Object
Object.equals(java.lang.Object)
,
System.identityHashCode(java.lang.Object)
public boolean isMoved(SimpleBinaryTreeView.BTNodeLoc loc)
isMoved
in interface Locatable<SimpleBinaryTreeView.BTNodeLoc>
loc
- the node location to be compared.loc
and the location of this item are
different locations within a structure, false if they are in different
structures or are at the same location in the same structure.public boolean isRepositioned(SimpleBinaryTreeView.BTNodeLoc loc)
Locatable.isMoved(NodeLocation)
returned false for the other node.isRepositioned
in interface Locatable<SimpleBinaryTreeView.BTNodeLoc>
loc
- the node location to be compared.loc
and the
location of this, animation would be required, assuming that they are the
same location within a structure. For structures where structure location
defines screen position (linked lists, linked hashtables), this can just
return false.public String toString()
toString
method returns a string that
"textually represents" this object. The result should
be a concise but informative representation that is easy for a
person to read.
It is recommended that all subclasses override this method.
The toString
method for class Object
returns a string consisting of the name of the class of which the
object is an instance, the at-sign character `@
', and
the unsigned hexadecimal representation of the hash code of the
object. In other words, this method returns a string equal to the
value of:
getClass().getName() + '@' + Integer.toHexString(hashCode())