Uses of Class
org.infinispan.tree.Fqn

Packages that use Fqn

Package	Description
org.infinispan.tree	This package contains the TreeCache.

Uses of Fqn in org.infinispan.tree

Fields in org.infinispan.tree declared as Fqn

Modifier and Type	Field and Description
static Fqn	Fqn.ROOT Immutable root Fqn.

Methods in org.infinispan.tree that return Fqn

Modifier and Type	Method and Description
static Fqn	Fqn.fromElements(Object... elements) Retrieves an Fqn that represents the array of elements passed in.
static Fqn	Fqn.fromList(List<?> names) Retrieves an Fqn that represents the list of elements passed in.
static Fqn	Fqn.fromRelativeElements(Fqn base, Object... relativeElements) Retrieves an Fqn that represents the array of elements passed in, relative to the base Fqn.
static Fqn	Fqn.fromRelativeFqn(Fqn base, Fqn relative) Retrieves an Fqn that represents the absolute Fqn of the relative Fqn passed in.
static Fqn	Fqn.fromRelativeList(Fqn base, List<?> relativeElements) Retrieves an Fqn that represents the List
static Fqn	Fqn.fromString(String stringRepresentation) Returns a new Fqn from a string, where the elements are deliminated by one or more separator (SEPARATOR) characters. Example use:
Fqn	Fqn.getAncestor(int generation) Obtains an ancestor of the current Fqn.
Fqn	NodeKey.getFqn()
Fqn	Node.getFqn() Returns the Fqn which represents the location of this Node in the cache structure.
Fqn	NodeImpl.getFqn()
Fqn	Fqn.getParent() Returns the parent of this Fqn.
Fqn	Fqn.getSubFqn(int startIndex, int endIndex) Obtains a sub-Fqn from the given Fqn.
Fqn	Fqn.Externalizer.readObject(ObjectInput input)
Fqn	Fqn.replaceAncestor(Fqn oldAncestor, Fqn newAncestor) Creates a new Fqn whose ancestor has been replaced with the new ancestor passed in.
static Fqn	Fqn.root()

Methods in org.infinispan.tree that return types with arguments of type Fqn

Modifier and Type	Method and Description
Set<Class<? extends Fqn>>	Fqn.Externalizer.getTypeClasses()

Methods in org.infinispan.tree with parameters of type Fqn

Modifier and Type	Method and Description
Node<K,V>	Node.addChild(Fqn f) Adds a child node with the given Fqn under the current node.
Node<K,V>	NodeImpl.addChild(Fqn f)
Node<K,V>	Node.addChild(Fqn f, Flag... flags)
Node<K,V>	NodeImpl.addChild(Fqn f, Flag... flags)
void	TreeCacheImpl.clearData(AdvancedCache<NodeKey,AtomicMap<?,?>> cache, Fqn fqn)
void	TreeCacheImpl.clearData(Fqn fqn)
void	TreeCache.clearData(Fqn fqn) Removes the keys and properties from a named node.
void	TreeCacheImpl.clearData(Fqn fqn, Flag... flags)
void	TreeCache.clearData(Fqn fqn, Flag... flags)
int	FqnComparator.compare(Fqn fqn1, Fqn fqn2) Returns -1 if the first comes before; 0 if they are the same; 1 if the second Fqn comes before.
int	Fqn.compareTo(Fqn fqn) Compares this Fqn to another using FqnComparator.
protected boolean	TreeStructureSupport.createNodeInCache(AdvancedCache<?,?> cache, Fqn fqn)
protected boolean	TreeStructureSupport.exists(AdvancedCache<?,?> cache, Fqn f)
boolean	TreeStructureSupport.exists(Fqn f)
boolean	TreeCache.exists(Fqn fqn) Tests if an Fqn exists.
boolean	TreeCacheImpl.exists(Fqn fqn, Flag... flags)
boolean	TreeCache.exists(Fqn fqn, Flag... flags)
static Fqn	Fqn.fromRelativeElements(Fqn base, Object... relativeElements) Retrieves an Fqn that represents the array of elements passed in, relative to the base Fqn.
static Fqn	Fqn.fromRelativeFqn(Fqn base, Fqn relative) Retrieves an Fqn that represents the absolute Fqn of the relative Fqn passed in.
static Fqn	Fqn.fromRelativeList(Fqn base, List<?> relativeElements) Retrieves an Fqn that represents the List
V	TreeCacheImpl.get(Fqn fqn, K key)
V	TreeCache.get(Fqn fqn, K key) Convenience method that allows for direct access to the data in a Node.
V	TreeCacheImpl.get(Fqn fqn, K key, Flag... flags)
V	TreeCache.get(Fqn fqn, K key, Flag... flags)
Node<K,V>	Node.getChild(Fqn f) Returns the child node
Node<K,V>	NodeImpl.getChild(Fqn f)
Node<K,V>	Node.getChild(Fqn f, Flag... flags)
Node<K,V>	NodeImpl.getChild(Fqn f, Flag... flags)
Map<K,V>	TreeCacheImpl.getData(Fqn fqn)
Map<K,V>	TreeCache.getData(Fqn fqn) Retrieves a defensively copied data map of the underlying node.
Map<K,V>	TreeCacheImpl.getData(Fqn fqn, Flag... flags)
Map<K,V>	TreeCache.getData(Fqn fqn, Flag... flags)
Set<K>	TreeCacheImpl.getKeys(Fqn fqn)
Set<K>	TreeCache.getKeys(Fqn fqn) Returns a set of attribute keys for the Fqn.
Set<K>	TreeCacheImpl.getKeys(Fqn fqn, Flag... flags)
Set<K>	TreeCache.getKeys(Fqn fqn, Flag... flags)
Node<K,V>	TreeCacheImpl.getNode(Fqn fqn)
Node<K,V>	TreeCache.getNode(Fqn fqn) A convenience method to retrieve a node directly from the cache.
Node<K,V>	TreeCacheImpl.getNode(Fqn fqn, Flag... flags)
Node<K,V>	TreeCache.getNode(Fqn fqn, Flag... flags)
boolean	Node.hasChild(Fqn f) Returns true if the child node denoted by the relative Fqn passed in exists.
boolean	NodeImpl.hasChild(Fqn f)
boolean	Node.hasChild(Fqn f, Flag... flags)
boolean	NodeImpl.hasChild(Fqn f, Flag... flags)
boolean	Fqn.isChildOf(Fqn parentFqn) Returns true if this Fqn is child of parentFqn.
boolean	Fqn.isChildOrEquals(Fqn parentFqn) Returns true if this Fqn is equals or the child of parentFqn.
boolean	Fqn.isDirectChildOf(Fqn parentFqn) Returns true if this Fqn is a direct child of a given Fqn.
static boolean	TreeStructureSupport.isLocked(LockManager lockManager, Fqn fqn)
void	TreeCacheImpl.move(Fqn nodeToMoveFqn, Fqn newParentFqn)
void	TreeCache.move(Fqn nodeToMove, Fqn newParent) Moves a part of the cache to a different subtree.
void	TreeCacheImpl.move(Fqn nodeToMoveFqn, Fqn newParentFqn, Flag... flags)
void	TreeCache.move(Fqn nodeToMove, Fqn newParent, Flag... flags)
V	TreeCacheImpl.put(Fqn fqn, K key, V value)
V	TreeCache.put(Fqn fqn, K key, V value) Associates the specified value with the specified key for a Node in this cache.
V	TreeCacheImpl.put(Fqn fqn, K key, V value, Flag... flags)
V	TreeCache.put(Fqn fqn, K key, V value, Flag... flags)
void	TreeCacheImpl.put(Fqn fqn, Map<? extends K,? extends V> data)
void	TreeCache.put(Fqn fqn, Map<? extends K,? extends V> data) Copies all of the mappings from the specified map to a Node.
void	TreeCacheImpl.put(Fqn fqn, Map<? extends K,? extends V> data, Flag... flags)
void	TreeCache.put(Fqn fqn, Map<? extends K,? extends V> data, Flag... flags)
V	TreeCacheImpl.remove(Fqn fqn, K key)
V	TreeCache.remove(Fqn fqn, K key) Removes the mapping for this key from a Node.
V	TreeCacheImpl.remove(Fqn fqn, K key, Flag... flags)
V	TreeCache.remove(Fqn fqn, K key, Flag... flags)
boolean	NodeImpl.removeChild(AdvancedCache<?,?> cache, Fqn f)
boolean	Node.removeChild(Fqn f) Removes a child node specified by the given relative Fqn.
boolean	NodeImpl.removeChild(Fqn f)
boolean	Node.removeChild(Fqn f, Flag... flags)
boolean	NodeImpl.removeChild(Fqn f, Flag... flags)
boolean	TreeCacheImpl.removeNode(Fqn fqn)
boolean	TreeCache.removeNode(Fqn fqn) Removes a Node indicated by absolute Fqn.
boolean	TreeCacheImpl.removeNode(Fqn fqn, Flag... flags)
boolean	TreeCache.removeNode(Fqn fqn, Flag... flags)
Fqn	Fqn.replaceAncestor(Fqn oldAncestor, Fqn newAncestor) Creates a new Fqn whose ancestor has been replaced with the new ancestor passed in.
void	Fqn.Externalizer.writeObject(ObjectOutput output, Fqn fqn)

Constructors in org.infinispan.tree with parameters of type Fqn

Constructor and Description
NodeImpl(Fqn fqn, AdvancedCache<?,?> cache, BatchContainer batchContainer)
NodeKey(Fqn fqn, NodeKey.Type contents)