Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

services/tree: do not restrict depth in GetSubTree #1753

Merged
merged 3 commits into from
Sep 7, 2022

Conversation

fyrchik
Copy link
Contributor

@fyrchik fyrchik commented Sep 5, 2022

Previously, the depth was restricted because with BFS the amount of
nodes we have in memory blows up exponentially. With DFS is is linear,
so we can process trees of arbitrary depth.

Refs nspcc-dev/neofs-s3-gw#624

Signed-off-by: Evgenii Stratonikov evgeniy@morphbits.ru

@codecov
Copy link

codecov bot commented Sep 5, 2022

Codecov Report

Merging #1753 (fc6ed8a) into master (e4dcc4d) will increase coverage by 0.16%.
The diff coverage is 69.44%.

@@            Coverage Diff             @@
##           master    #1753      +/-   ##
==========================================
+ Coverage   33.08%   33.24%   +0.16%     
==========================================
  Files         351      351              
  Lines       23481    23492      +11     
==========================================
+ Hits         7769     7811      +42     
+ Misses      15061    15028      -33     
- Partials      651      653       +2     
Impacted Files Coverage Δ
pkg/services/tree/service.pb.go 2.93% <0.00%> (+0.66%) ⬆️
pkg/services/tree/service_grpc.pb.go 0.00% <ø> (ø)
pkg/services/tree/service_neofs.pb.go 4.43% <0.00%> (-0.02%) ⬇️
pkg/services/tree/sync.go 0.00% <ø> (ø)
pkg/services/tree/types.pb.go 20.97% <ø> (ø)
pkg/services/tree/service.go 9.29% <83.33%> (+9.29%) ⬆️

📣 We’re building smart automated test selection to slash your CI/CD build times. Learn more

KirillovDenis
KirillovDenis previously approved these changes Sep 5, 2022
@KirillovDenis
Copy link
Contributor

Shouldn't we get rid of this?

cthulhu-rider
cthulhu-rider previously approved these changes Sep 6, 2022
alexvanin
alexvanin previously approved these changes Sep 6, 2022
Previously, the depth was restricted because with BFS the amount of
nodes we have in memory blows up exponentially. With DFS is is linear,
so we can process trees of arbitrary depth.

Signed-off-by: Evgenii Stratonikov <evgeniy@morphbits.ru>
It was used only in `GetOpLog` and ignored on the server side.

Signed-off-by: Evgenii Stratonikov <evgeniy@morphbits.ru>
…response

Currently, you need to use `GetSubTree` to get parent, which seems an
overkill.

Signed-off-by: Evgenii Stratonikov <evgeniy@morphbits.ru>
@fyrchik fyrchik merged commit 74c8613 into nspcc-dev:master Sep 7, 2022
@carpawell carpawell mentioned this pull request Sep 14, 2022
aprasolova pushed a commit to aprasolova/neofs-node that referenced this pull request Oct 19, 2022
Previously, the depth was restricted because with BFS the amount of
nodes we have in memory blows up exponentially. With DFS is is linear,
so we can process trees of arbitrary depth.

Signed-off-by: Evgenii Stratonikov <evgeniy@morphbits.ru>
aprasolova pushed a commit to aprasolova/neofs-node that referenced this pull request Oct 19, 2022
It was used only in `GetOpLog` and ignored on the server side.

Signed-off-by: Evgenii Stratonikov <evgeniy@morphbits.ru>
aprasolova pushed a commit to aprasolova/neofs-node that referenced this pull request Oct 19, 2022
…response

Currently, you need to use `GetSubTree` to get parent, which seems an
overkill.

Signed-off-by: Evgenii Stratonikov <evgeniy@morphbits.ru>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants