001: package java.util;
002:
003: import java.io.IOException;
004: import java.io.ObjectInputStream;
005: import java.io.ObjectOutputStream;
006: import java.io.Serializable;
007:
008: public class TreeMap extends AbstractMap implements SortedMap,
009: Cloneable, Serializable {
010: static final int RED = -1, BLACK = 1;
011: static final Node nil = new Node(null, null, BLACK);
012: static {
013: }
014: transient int size;
015: transient int modCount;
016: final Comparator comparator;
017:
018: private static final class Node extends AbstractMap.BasicMapEntry {
019: int color;
020: Node left = nil;
021: Node right = nil;
022: Node parent = nil;
023:
024: Node(Object key, Object value, int color) {
025: }
026: }
027:
028: public TreeMap() {
029: }
030:
031: public TreeMap(Comparator c) {
032: }
033:
034: public TreeMap(Map map) {
035: }
036:
037: public TreeMap(SortedMap sm) {
038: }
039:
040: public void clear() {
041: }
042:
043: public Object clone() {
044: }
045:
046: public Comparator comparator() {
047: }
048:
049: public boolean containsKey(Object key) {
050: }
051:
052: public boolean containsValue(Object value) {
053: }
054:
055: public Set entrySet() {
056: }
057:
058: public Object firstKey() {
059: }
060:
061: public Object get(Object key) {
062: }
063:
064: public SortedMap headMap(Object toKey) {
065: }
066:
067: public Set keySet() {
068: }
069:
070: public Object lastKey() {
071: }
072:
073: public Object put(Object key, Object value) {
074: }
075:
076: public void putAll(Map m) {
077: }
078:
079: public Object remove(Object key) {
080: }
081:
082: public int size() {
083: }
084:
085: public SortedMap subMap(Object fromKey, Object toKey) {
086: }
087:
088: public SortedMap tailMap(Object fromKey) {
089: }
090:
091: public Collection values() {
092: }
093:
094: final int compare(Object o1, Object o2) {
095: }
096:
097: private void deleteFixup(Node node, Node parent) {
098: }
099:
100: private void fabricateTree(final int count) {
101: }
102:
103: final Node firstNode() {
104: }
105:
106: final Node getNode(Object key) {
107: }
108:
109: final Node highestLessThan(Object key) {
110: }
111:
112: private void insertFixup(Node n) {
113: }
114:
115: private Node lastNode() {
116: }
117:
118: final Node lowestGreaterThan(Object key, boolean first) {
119: }
120:
121: private Node predecessor(Node node) {
122: }
123:
124: final void putFromObjStream(ObjectInputStream s, int count,
125: boolean readValues) throws IOException,
126: ClassNotFoundException {
127: }
128:
129: final void putKeysLinear(Iterator keys, int count) {
130: }
131:
132: private void readObject(ObjectInputStream s) throws IOException,
133: ClassNotFoundException {
134: }
135:
136: final void removeNode(Node node) {
137: }
138:
139: private void rotateLeft(Node node) {
140: }
141:
142: private void rotateRight(Node node) {
143: }
144:
145: final Node successor(Node node) {
146: }
147:
148: private void writeObject(ObjectOutputStream s) throws IOException {
149: }
150:
151: private final class TreeIterator implements Iterator {
152: TreeIterator(int type) {
153: }
154:
155: TreeIterator(int type, Node first, Node max) {
156: }
157:
158: public boolean hasNext() {
159: }
160:
161: public Object next() {
162: }
163:
164: public void remove() {
165: }
166: }
167:
168: private final class SubMap extends AbstractMap implements SortedMap {
169: final Object minKey;
170: final Object maxKey;
171:
172: SubMap(Object minKey, Object maxKey) {
173: }
174:
175: final boolean keyInRange(Object key) {
176: }
177:
178: public void clear() {
179: }
180:
181: public Comparator comparator() {
182: }
183:
184: public boolean containsKey(Object key) {
185: }
186:
187: public boolean containsValue(Object value) {
188: }
189:
190: public Set entrySet() {
191: }
192:
193: public Object firstKey() {
194: }
195:
196: public Object get(Object key) {
197: }
198:
199: public SortedMap headMap(Object toKey) {
200: }
201:
202: public Set keySet() {
203: }
204:
205: public Object lastKey() {
206: }
207:
208: public Object put(Object key, Object value) {
209: }
210:
211: public Object remove(Object key) {
212: }
213:
214: public int size() {
215: }
216:
217: public SortedMap subMap(Object fromKey, Object toKey) {
218: }
219:
220: public SortedMap tailMap(Object fromKey) {
221: }
222:
223: public Collection values() {
224: }
225: }
226: }
|