Mercurial > hg > truffle
annotate agent/src/share/classes/sun/jvm/hotspot/utilities/RBNode.java @ 2042:0a8e0d4345b3 hs20-b05 jdk7-b124
7010068: Update all 2010 Oracle-changed OpenJDK files to have the proper copyright dates - first pass
Summary: Update the copyright to be 2010 on all changed files in OpenJDK
Reviewed-by: jcoomes
| author | trims |
|---|---|
| date | Mon, 03 Jan 2011 15:30:05 -0800 |
| parents | c18cbe5936b8 |
| children |
| rev | line source |
|---|---|
| 0 | 1 /* |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
2 * Copyright (c) 2000, Oracle and/or its affiliates. All rights reserved. |
| 0 | 3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 * | |
| 5 * This code is free software; you can redistribute it and/or modify it | |
| 6 * under the terms of the GNU General Public License version 2 only, as | |
| 7 * published by the Free Software Foundation. | |
| 8 * | |
| 9 * This code is distributed in the hope that it will be useful, but WITHOUT | |
| 10 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
| 11 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
| 12 * version 2 for more details (a copy is included in the LICENSE file that | |
| 13 * accompanied this code). | |
| 14 * | |
| 15 * You should have received a copy of the GNU General Public License version | |
| 16 * 2 along with this work; if not, write to the Free Software Foundation, | |
| 17 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. | |
| 18 * | |
|
1552
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
19 * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
20 * or visit www.oracle.com if you need additional information or have any |
|
c18cbe5936b8
6941466: Oracle rebranding changes for Hotspot repositories
trims
parents:
0
diff
changeset
|
21 * questions. |
| 0 | 22 * |
| 23 */ | |
| 24 | |
| 25 package sun.jvm.hotspot.utilities; | |
| 26 | |
| 27 /** This class implements a node in a red-black tree. It provides | |
| 28 accessors for the left and right children as well as the color of | |
| 29 the node. */ | |
| 30 | |
| 31 public class RBNode { | |
| 32 private Object data; | |
| 33 private RBNode left; | |
| 34 private RBNode right; | |
| 35 private RBNode parent; | |
| 36 private RBColor color; | |
| 37 | |
| 38 /** Newly-created nodes are colored red */ | |
| 39 public RBNode(Object data) { | |
| 40 this.data = data; | |
| 41 color = RBColor.RED; | |
| 42 } | |
| 43 | |
| 44 public Object getData() { | |
| 45 return data; | |
| 46 } | |
| 47 | |
| 48 /** Must copy all user-defined fields from the given node. For | |
| 49 example, the base implementation copies the "data" field. | |
| 50 However, it does not (and must not) copy the link fields | |
| 51 (parent, left child, right child). It also does not need to copy | |
| 52 any computed information for the node, as the node will be | |
| 53 updated when necessary. Subclasses must be careful to call the | |
| 54 superclass implementation. */ | |
| 55 public void copyFrom(RBNode arg) { | |
| 56 this.data = arg.data; | |
| 57 } | |
| 58 | |
| 59 /** This is called by the base RBTree's insertion and deletion | |
| 60 methods when necessary. Subclasses can use this to update any | |
| 61 computed information based on the information in their left or | |
| 62 right children. For multi-node updates it is guaranteed that | |
| 63 this method will be called in the correct order. This should | |
| 64 return true if an update actually occurred, false if not. */ | |
| 65 public boolean update() { | |
| 66 return false; | |
| 67 } | |
| 68 | |
| 69 public RBColor getColor() { return color; } | |
| 70 public void setColor(RBColor color) { this.color = color; } | |
| 71 | |
| 72 public RBNode getParent() { return parent; } | |
| 73 public void setParent(RBNode parent) { this.parent = parent; } | |
| 74 | |
| 75 /** Access to left child */ | |
| 76 public RBNode getLeft() { return left; } | |
| 77 public void setLeft(RBNode left) { this.left = left; } | |
| 78 | |
| 79 /** Access to right child */ | |
| 80 public RBNode getRight() { return right; } | |
| 81 public void setRight(RBNode right) { this.right = right; } | |
| 82 } |