Package | Description |
---|---|
org.jboss.cache | |
org.jboss.cache.invocation | |
org.jboss.cache.mvcc | |
org.jboss.cache.statetransfer |
Modifier and Type | Class and Description |
---|---|
class |
PessimisticUnversionedNode<K,V>
Deprecated.
will be removed along with optimistic and pessimistic locking.
|
class |
UnversionedNode<K,V>
Basic data node class.
|
class |
VersionedNode<K,V>
Deprecated.
will be removed along with optimistic and pessimistic locking.
|
Modifier and Type | Method and Description |
---|---|
InternalNode<K,V> |
InternalNode.copy()
Creates a new instance of the same type and copies internal state.
|
InternalNode<K,V> |
UnversionedNode.copy() |
InternalNode<K,V> |
PessimisticUnversionedNode.copy()
Deprecated.
|
InternalNode<K,V> |
AbstractNodeFactory.createChildNode(Fqn fqn,
InternalNode<K,V> parent,
InvocationContext ctx,
boolean attachToParent) |
InternalNode<K,V> |
NodeFactory.createChildNode(Fqn fqn,
InternalNode<K,V> parent,
InvocationContext ctx,
boolean attachToParent)
Creates a new node, and optionally attaches the node to its parent.
|
InternalNode<K,V> |
AbstractNodeFactory.createInternalNode(Fqn fqn) |
InternalNode<K,V> |
NodeFactory.createInternalNode(Fqn childFqn)
Creates an internal node.
|
InternalNode<K,V> |
AbstractNode.getChild(Fqn f) |
InternalNode<K,V> |
InternalNode.getChild(Fqn f) |
InternalNode<K,V> |
UnversionedNode.getChild(Fqn f) |
InternalNode<K,V> |
AbstractNode.getChild(Object childName) |
InternalNode<K,V> |
InternalNode.getChild(Object childName) |
InternalNode<K,V> |
UnversionedNode.getChild(Object childName) |
InternalNode |
NodeSPI.getDelegationTarget() |
InternalNode |
DataContainer.peekInternalNode(Fqn f,
boolean includeInvalidNodes)
Similar to
DataContainer.peek(Fqn) except that the underlying node is NOT wrapped as a NodeSPI . |
InternalNode |
DataContainerImpl.peekInternalNode(Fqn fqn,
boolean includeInvalidNodes) |
InternalNode[] |
DataContainer.peekInternalNodeAndDirectParent(Fqn fqn,
boolean includeInvalidNodes)
Similar to
DataContainer.peekInternalNode(Fqn, boolean) except that the node AND its *direct* parent are retrieved. |
InternalNode[] |
DataContainerImpl.peekInternalNodeAndDirectParent(Fqn fqn,
boolean includeInvalidNodes) |
Modifier and Type | Method and Description |
---|---|
Set<InternalNode<K,V>> |
AbstractNode.getChildren() |
Set<InternalNode<K,V>> |
InternalNode.getChildren() |
Set<InternalNode<K,V>> |
UnversionedNode.getChildren() |
Set<InternalNode<K,V>> |
AbstractNode.getChildren(boolean includeMarkedForRemoval) |
Set<InternalNode<K,V>> |
InternalNode.getChildren(boolean includeMarkedForRemoval) |
Set<InternalNode<K,V>> |
UnversionedNode.getChildren(boolean includeMarkedForRemoval) |
Map<Object,InternalNode<K,V>> |
AbstractNode.getChildrenMap() |
ConcurrentMap<Object,InternalNode<K,V>> |
InternalNode.getChildrenMap() |
ConcurrentMap<Object,InternalNode<K,V>> |
UnversionedNode.getChildrenMap() |
Modifier and Type | Method and Description |
---|---|
void |
AbstractNode.addChild(InternalNode<K,V> child) |
void |
InternalNode.addChild(InternalNode<K,V> child) |
void |
UnversionedNode.addChild(InternalNode<K,V> child) |
void |
AbstractNode.addChild(InternalNode<K,V> child,
boolean safe) |
void |
InternalNode.addChild(InternalNode<K,V> child,
boolean safe)
Same as above, except that if safe is true, any Fqn ancestry checking is skipped.
|
void |
UnversionedNode.addChild(InternalNode<K,V> child,
boolean safe) |
void |
AbstractNode.addChild(Object nodeName,
InternalNode<K,V> nodeToAdd) |
void |
InternalNode.addChild(Object nodeName,
InternalNode<K,V> nodeToAdd) |
void |
UnversionedNode.addChild(Object nodeName,
InternalNode<K,V> nodeToAdd) |
InternalNode<K,V> |
AbstractNodeFactory.createChildNode(Fqn fqn,
InternalNode<K,V> parent,
InvocationContext ctx,
boolean attachToParent) |
InternalNode<K,V> |
NodeFactory.createChildNode(Fqn fqn,
InternalNode<K,V> parent,
InvocationContext ctx,
boolean attachToParent)
Creates a new node, and optionally attaches the node to its parent.
|
ReadCommittedNode |
AbstractNodeFactory.createWrappedNode(InternalNode<K,V> node,
InternalNode<K,V> parent) |
ReadCommittedNode |
AbstractNodeFactory.createWrappedNode(InternalNode<K,V> node,
InternalNode<K,V> parent) |
ReadCommittedNode |
NodeFactory.createWrappedNode(InternalNode<K,V> node,
InternalNode<K,V> parent) |
ReadCommittedNode |
NodeFactory.createWrappedNode(InternalNode<K,V> node,
InternalNode<K,V> parent) |
ReadCommittedNode |
AbstractNodeFactory.createWrappedNodeForRemoval(Fqn fqn,
InternalNode<K,V> node,
InternalNode<K,V> parent) |
ReadCommittedNode |
AbstractNodeFactory.createWrappedNodeForRemoval(Fqn fqn,
InternalNode<K,V> node,
InternalNode<K,V> parent) |
ReadCommittedNode |
NodeFactory.createWrappedNodeForRemoval(Fqn fqn,
InternalNode<K,V> node,
InternalNode<K,V> parent) |
ReadCommittedNode |
NodeFactory.createWrappedNodeForRemoval(Fqn fqn,
InternalNode<K,V> node,
InternalNode<K,V> parent) |
Modifier and Type | Method and Description |
---|---|
void |
AbstractNode.setChildrenMap(ConcurrentMap<Object,InternalNode<K,V>> children) |
void |
InternalNode.setChildrenMap(ConcurrentMap<Object,InternalNode<K,V>> children) |
void |
UnversionedNode.setChildrenMap(ConcurrentMap<Object,InternalNode<K,V>> children) |
Modifier and Type | Field and Description |
---|---|
protected InternalNode<K,V> |
NodeInvocationDelegate.node |
Modifier and Type | Method and Description |
---|---|
InternalNode |
NodeInvocationDelegate.getDelegationTarget() |
Constructor and Description |
---|
NodeInvocationDelegate(InternalNode<K,V> node) |
Modifier and Type | Class and Description |
---|---|
class |
NodeReference<K,V>
A node reference that delegates all calls to a different
InternalNode . |
Modifier and Type | Field and Description |
---|---|
protected InternalNode |
ReadCommittedNode.backup |
protected InternalNode |
ReadCommittedNode.parent |
Modifier and Type | Method and Description |
---|---|
InternalNode<K,V> |
NodeReference.copy() |
InternalNode<K,V> |
MVCCNodeFactory.createChildNode(Fqn fqn,
InternalNode<K,V> parent,
InvocationContext ctx,
boolean attachToParent) |
InternalNode<K,V> |
MVCCNodeFactory.createInternalNode(Fqn fqn) |
InternalNode<K,V> |
NodeReference.getChild(Fqn f) |
InternalNode<K,V> |
NodeReference.getChild(Object childName) |
InternalNode<K,V> |
NodeReference.getDelegate() |
InternalNode |
ReadCommittedNode.getInternalParent() |
protected InternalNode |
ReadCommittedNode.lookupParent(Fqn fqn,
InvocationContext ctx,
DataContainer container)
Performs a lookup for the parent node of the Fqn passed in.
|
Modifier and Type | Method and Description |
---|---|
Set<InternalNode<K,V>> |
NodeReference.getChildren() |
Set<InternalNode<K,V>> |
NodeReference.getChildren(boolean includeMarkedForRemoval) |
ConcurrentMap<Object,InternalNode<K,V>> |
NodeReference.getChildrenMap() |
Modifier and Type | Method and Description |
---|---|
void |
NodeReference.setChildrenMap(ConcurrentMap<Object,InternalNode<K,V>> children) |
Constructor and Description |
---|
NodeReference(InternalNode<K,V> delegate) |
NullMarkerNodeForRemoval(InternalNode parent,
Fqn fqn) |
ReadCommittedNode(InternalNode node,
InternalNode parent) |
ReadCommittedNode(InternalNode node,
InternalNode parent) |
RepeatableReadNode(InternalNode node,
InternalNode parent) |
RepeatableReadNode(InternalNode node,
InternalNode parent) |
Modifier and Type | Method and Description |
---|---|
protected void |
DefaultStateTransferGenerator.generateNodeDataList(InternalNode<?,?> node,
List<NodeData> list) |
protected void |
DefaultStateTransferIntegrator.integrateTransientState(ObjectInputStream in,
InternalNode target) |
protected void |
DefaultStateTransferGenerator.marshallTransientState(InternalNode node,
ObjectOutputStream out)
Do a preorder traversal: visit the node first, then the node's children
|
Copyright © 2012 JBoss, a division of Red Hat. All Rights Reserved.