Package com.intellij.openapi.editor.impl

Class RedBlackTree<K>

java.lang.Object

java.lang.Number

java.util.concurrent.atomic.AtomicInteger

com.intellij.openapi.editor.impl.RedBlackTree<K>

All Implemented Interfaces:

java.io.Serializable

public abstract class RedBlackTree<K>
extends java.util.concurrent.atomic.AtomicInteger

See Also:

Serialized Form

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	RedBlackTree.Node<K>

Field Summary

Fields

Modifier and Type	Field and Description
protected RedBlackTree.Node<K>	root
static boolean	VERIFY

Method Summary

Modifier and Type	Method and Description
void	clear()
protected void	deleteNode(RedBlackTree.Node<K> n)
protected RedBlackTree.Node<K>	maximumNode(RedBlackTree.Node<K> n)
void	print()
protected void	replaceNode(RedBlackTree.Node<K> oldn, RedBlackTree.Node<K> newn)
protected void	rotateLeft(RedBlackTree.Node<K> n)
protected void	rotateRight(RedBlackTree.Node<K> n)
int	size()
protected abstract RedBlackTree.Node<K>	swapWithMaxPred(RedBlackTree.Node<K> nowAscendant, RedBlackTree.Node<K> nowDescendant)

Methods inherited from class java.util.concurrent.atomic.AtomicInteger

accumulateAndGet, addAndGet, compareAndExchange, compareAndExchangeAcquire, compareAndExchangeRelease, compareAndSet, decrementAndGet, doubleValue, floatValue, get, getAcquire, getAndAccumulate, getAndAdd, getAndDecrement, getAndIncrement, getAndSet, getAndUpdate, getOpaque, getPlain, incrementAndGet, intValue, lazySet, longValue, set, setOpaque, setPlain, setRelease, toString, updateAndGet, weakCompareAndSet, weakCompareAndSetAcquire, weakCompareAndSetPlain, weakCompareAndSetRelease, weakCompareAndSetVolatile

Methods inherited from class java.lang.Number

byteValue, shortValue

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

VERIFY

public static boolean VERIFY

root

protected RedBlackTree.Node<K> root

Method Detail

rotateLeft

protected void rotateLeft(RedBlackTree.Node<K> n)

rotateRight

protected void rotateRight(RedBlackTree.Node<K> n)

replaceNode

protected void replaceNode(RedBlackTree.Node<K> oldn,
                           RedBlackTree.Node<K> newn)

deleteNode

protected void deleteNode(RedBlackTree.Node<K> n)

swapWithMaxPred

protected abstract RedBlackTree.Node<K> swapWithMaxPred(RedBlackTree.Node<K> nowAscendant,
                                                        RedBlackTree.Node<K> nowDescendant)

maximumNode

protected RedBlackTree.Node<K> maximumNode(RedBlackTree.Node<K> n)

print

public void print()

size

public int size()

clear

public void clear()