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

Let the m to n steps return the data even if can't reach n steps. #2148

Merged
merged 9 commits into from May 28, 2020
Merged

Let the m to n steps return the data even if can't reach n steps. #2148

merged 9 commits into from May 28, 2020

Conversation

Shylock-Hg
Copy link
Contributor

@Shylock-Hg Shylock-Hg commented May 27, 2020

What changes were proposed in this pull request?

Keep return data even if can't reach N steps.

Why are the changes needed?

Does this PR introduce any user-facing change?

How was this patch tested?

Checklist

  • I've run the tests to see all new and existing tests pass
  • If this Pull Request resolves an issue, I linked to the issue in the text above
  • I've informed the technical writer about the documentation change if necessary

@Shylock-Hg Shylock-Hg added the ready-for-testing PR: ready for the CI test label May 27, 2020
@codecov-commenter
Copy link

codecov-commenter commented May 27, 2020

Codecov Report

Merging #2148 into master will decrease coverage by 0.00%.
The diff coverage is 85.39%.

Impacted file tree graph

@@            Coverage Diff             @@
##           master    #2148      +/-   ##
==========================================
- Coverage   86.84%   86.83%   -0.01%     
==========================================
  Files         641      641              
  Lines       61651    62022     +371     
==========================================
+ Hits        53541    53859     +318     
- Misses       8110     8163      +53     
Impacted Files Coverage Δ
src/meta/MetaServiceUtils.h 100.00% <ø> (ø)
src/meta/processors/BaseProcessor.h 81.39% <ø> (ø)
src/meta/processors/jobMan/JobManager.cpp 58.76% <ø> (+0.94%) ⬆️
.../meta/processors/schemaMan/CreateEdgeProcessor.cpp 74.74% <ø> (ø)
...c/meta/processors/schemaMan/CreateTagProcessor.cpp 76.00% <ø> (ø)
src/parser/Clauses.cpp 26.20% <0.00%> (ø)
src/meta/MetaServiceUtils.cpp 86.91% <36.36%> (-5.95%) ⬇️
src/graph/test/TestBase.h 70.00% <50.00%> (-0.34%) ⬇️
...c/meta/processors/schemaMan/AlterEdgeProcessor.cpp 77.77% <70.00%> (-1.91%) ⬇️
...rc/meta/processors/schemaMan/AlterTagProcessor.cpp 77.77% <70.00%> (-1.91%) ⬇️
... and 28 more

Continue to review full report at Codecov.

Legend - Click here to learn more
Δ = absolute <relative> (impact), ø = not affected, ? = missing data
Powered by Codecov. Last update 6cba753...adae510. Read the comment docs.

@@ -695,8 +703,8 @@ void GoExecutor::finishExecution() {
StatusOr<std::vector<cpp2::RowValue>> GoExecutor::toThriftResponse() const {
std::vector<cpp2::RowValue> rows;
int64_t totalRows = 0;
for (const auto &rpcResp : records_) {
for (const auto& resp : rpcResp.responses()) {
for (auto rpcResp = records_.begin() + recordFrom_ - 1; rpcResp != records_.end(); ++rpcResp) {
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Add a check?

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

What check?

@dutor dutor merged commit 2ba45b5 into vesoft-inc:master May 28, 2020
tong-hao pushed a commit to tong-hao/nebula that referenced this pull request Jun 1, 2021
…soft-inc#2148)

* Let the m to n steps return the data even if can't reach n steps.

* Unify the go exit entry.

* Revert "Unify the go exit entry."

This reverts commit fbe28b7.

* Unify the go exit entry.

* Fix the edges reserve count.

* Add a cases for record a part data in go.

* Fix DAIL-91
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
ready-for-testing PR: ready for the CI test
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

5 participants