134 lines
3.2 KiB
Java
134 lines
3.2 KiB
Java
|
/*
|
||
|
|
* Copyright (c) 2008, 2018, Oracle and/or its affiliates. All rights reserved.
|
||
|
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
|
||
|
|
*
|
||
|
|
* This code is free software; you can redistribute it and/or modify it
|
||
|
|
* under the terms of the GNU General Public License version 2 only, as
|
||
|
|
* published by the Free Software Foundation.
|
||
|
|
*
|
||
|
|
* This code is distributed in the hope that it will be useful, but WITHOUT
|
||
|
|
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
|
||
|
|
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
|
||
|
|
* version 2 for more details (a copy is included in the LICENSE file that
|
||
|
|
* accompanied this code).
|
||
|
|
*
|
||
|
|
* You should have received a copy of the GNU General Public License version
|
||
|
|
* 2 along with this work; if not, write to the Free Software Foundation,
|
||
|
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
|
||
|
|
*
|
||
|
|
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
|
||
|
|
* or visit www.oracle.com if you need additional information or have any
|
||
|
|
* questions.
|
||
|
|
*/
|
||
|
|
package jit.graph;
|
||
|
|
|
||
|
|
import nsk.share.TestFailure;
|
||
|
|
// This class define the tree node.
|
||
|
|
|
||
|
|
public class Node
|
||
|
|
{
|
||
|
|
public final static int Black = 0; // constants used to define the
|
||
|
|
public final static int Red = 1; // node color
|
||
|
|
public final static int Left_son = 2; // constants used to identify
|
||
|
|
public final static int Right_son = 3;// the node parent and sons.
|
||
|
|
public final static int Parent = 4;
|
||
|
|
|
||
|
|
|
||
|
|
private int color;
|
||
|
|
private int key;
|
||
|
|
private Node L,R,P; // L-left son,R-right son,P-parent
|
||
|
|
|
||
|
|
// constructor create a new node the default color is red
|
||
|
|
// the default appearance (bold) is regular.
|
||
|
|
// initialize the key field.
|
||
|
|
|
||
|
|
public Node(int k)
|
||
|
|
{
|
||
|
|
color = Red;
|
||
|
|
key = k;
|
||
|
|
L = null;
|
||
|
|
R = null;
|
||
|
|
P = null;
|
||
|
|
}
|
||
|
|
|
||
|
|
// constructor for constructing a tree null object, is color
|
||
|
|
// is black.
|
||
|
|
|
||
|
|
public Node()
|
||
|
|
{
|
||
|
|
color = Black;
|
||
|
|
key = -1;
|
||
|
|
L = null;
|
||
|
|
R = null;
|
||
|
|
P = null;
|
||
|
|
}
|
||
|
|
|
||
|
|
// This method set the node key.
|
||
|
|
|
||
|
|
public void setKey(int k)
|
||
|
|
{
|
||
|
|
key = k;
|
||
|
|
}
|
||
|
|
|
||
|
|
// This method return the node key.
|
||
|
|
|
||
|
|
public int getKey()
|
||
|
|
{
|
||
|
|
return (key);
|
||
|
|
}
|
||
|
|
|
||
|
|
// This method set the node color.
|
||
|
|
|
||
|
|
public void setColor(int c)
|
||
|
|
{
|
||
|
|
if (c == Black)
|
||
|
|
color = Black;
|
||
|
|
else
|
||
|
|
if (c == Red)
|
||
|
|
color = Red;
|
||
|
|
}
|
||
|
|
|
||
|
|
// This method return the node color.
|
||
|
|
|
||
|
|
public int getColor()
|
||
|
|
{
|
||
|
|
return (color);
|
||
|
|
}
|
||
|
|
|
||
|
|
// This method set the node parent or childs acording to the who
|
||
|
|
// parameter.
|
||
|
|
|
||
|
|
public void setNode(int who,Node n)
|
||
|
|
{
|
||
|
|
switch (who)
|
||
|
|
{
|
||
|
|
case Left_son:
|
||
|
|
L = n;
|
||
|
|
break;
|
||
|
|
case Right_son:
|
||
|
|
R = n;
|
||
|
|
break;
|
||
|
|
case Parent:
|
||
|
|
P = n;
|
||
|
|
break;
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
// This method return the node parent or childs acording to the who
|
||
|
|
// parameter.
|
||
|
|
|
||
|
|
public Node getNode(int who)
|
||
|
|
{
|
||
|
|
switch (who)
|
||
|
|
{
|
||
|
|
case Left_son:
|
||
|
|
return (L);
|
||
|
|
case Right_son:
|
||
|
|
return (R);
|
||
|
|
case Parent:
|
||
|
|
return (P);
|
||
|
|
}
|
||
|
|
return (null);
|
||
|
|
}
|
||
|
|
}
|