[#477] Add getTreeNodes method

Find multiple treeNodes from
subtree in single request.

Signed-off-by: Alex Vanin <alexey@nspcc.ru>
This commit is contained in:
Alex Vanin 2022-06-01 13:57:23 +03:00 committed by Alex Vanin
parent a02900a4f7
commit 5304e68b9a

View file

@ -476,25 +476,40 @@ func (c *TreeClient) DeleteBucketTagging(ctx context.Context, cnrID *cid.ID) err
} }
func (c *TreeClient) getTreeNode(ctx context.Context, cnrID *cid.ID, nodeID uint64, key string) (*TreeNode, error) { func (c *TreeClient) getTreeNode(ctx context.Context, cnrID *cid.ID, nodeID uint64, key string) (*TreeNode, error) {
nodes, err := c.getTreeNodes(ctx, cnrID, nodeID, key)
if err != nil {
return nil, err
}
// if there will be many allocations, consider having separate
// implementations of 'getTreeNode' and 'getTreeNodes'
return nodes[key], nil
}
func (c *TreeClient) getTreeNodes(ctx context.Context, cnrID *cid.ID, nodeID uint64, keys ...string) (map[string]*TreeNode, error) {
subtree, err := c.getSubTree(ctx, cnrID, versionTree, nodeID, 1) subtree, err := c.getSubTree(ctx, cnrID, versionTree, nodeID, 1)
if err != nil { if err != nil {
return nil, err return nil, err
} }
var treeNode *TreeNode treeNodes := make(map[string]*TreeNode, len(keys))
for _, s := range subtree { for _, s := range subtree {
node, err := newTreeNode(s) node, err := newTreeNode(s)
if err != nil { if err != nil {
return nil, err return nil, err
} }
if _, ok := node.Get(key); ok { for _, key := range keys {
treeNode = node if _, ok := node.Get(key); ok {
treeNodes[key] = node
break
}
}
if len(treeNodes) == len(keys) {
break break
} }
} }
return treeNode, nil return treeNodes, nil
} }
func (c *TreeClient) GetVersions(ctx context.Context, cnrID *cid.ID, filepath string) ([]*data.NodeVersion, error) { func (c *TreeClient) GetVersions(ctx context.Context, cnrID *cid.ID, filepath string) ([]*data.NodeVersion, error) {