Uses of Interface
com.usatiuk.kleppmanntree.TreeNode
Packages that use TreeNode
Package
Description
-
Uses of TreeNode in com.usatiuk.dhfs.jkleppmanntree
Methods in com.usatiuk.dhfs.jkleppmanntree with parameters of type TreeNodeModifier and TypeMethodDescriptionvoid
JKleppmannTreeManager.JKleppmannTree.JKleppmannTreeStorageInterface.putNode
(TreeNode<Long, PeerId, JKleppmannTreeNodeMeta, JObjectKey> node) Method parameters in com.usatiuk.dhfs.jkleppmanntree with type arguments of type TreeNodeModifier and TypeMethodDescriptionorg.apache.commons.lang3.tuple.Pair
<String, JObjectKey> JKleppmannTreeManager.JKleppmannTree.findParent
(Function<TreeNode<Long, PeerId, JKleppmannTreeNodeMeta, JObjectKey>, Boolean> predicate) Get the parent of a node that matches the given predicate. -
Uses of TreeNode in com.usatiuk.dhfs.jkleppmanntree.structs
Classes in com.usatiuk.dhfs.jkleppmanntree.structs that implement TreeNodeModifier and TypeClassDescriptionfinal record
KleppmannTree node implementation for JKleppmannTree -
Uses of TreeNode in com.usatiuk.kleppmanntree
Methods in com.usatiuk.kleppmanntree that return TreeNodeModifier and TypeMethodDescriptionStorageInterface.createNewNode
(NodeIdT key, NodeIdT parent, MetaT meta) Create a new node with the specified key, parent, and metadata.Get the node by its ID.TreeNode.withChildren
(org.pcollections.PMap<String, NodeIdT> children) Make a copy of this node with new children.TreeNode.withLastEffectiveOp
(OpMove<TimestampT, PeerIdT, MetaT, NodeIdT> lastEffectiveOp) Make a copy of this node with a new last effective operation.Make a copy of this node with new metadata.TreeNode.withParent
(NodeIdT parent) Make a copy of this node with a new parent.Methods in com.usatiuk.kleppmanntree with parameters of type TreeNodeModifier and TypeMethodDescriptionvoid
Put a node into the storage.Method parameters in com.usatiuk.kleppmanntree with type arguments of type TreeNodeModifier and TypeMethodDescriptionKleppmannTree.findParent
(Function<TreeNode<TimestampT, PeerIdT, MetaT, NodeIdT>, Boolean> kidPredicate) Find the parent of a node that matches the given predicatevoid
Walk the tree and apply the given consumer to each node