github-actions[bot] commented on code in PR #34334:
URL: https://github.com/apache/doris/pull/34334#discussion_r1584091421


##########
be/src/vec/runtime/vsorted_run_merger.cpp:
##########
@@ -98,120 +98,131 @@ Status VSortedRunMerger::prepare(const 
vector<BlockSupplier>& input_runs) {
 }
 
 Status VSortedRunMerger::get_next(Block* output_block, bool* eos) {

Review Comment:
   warning: function 'get_next' has cognitive complexity of 64 (threshold 50) 
[readability-function-cognitive-complexity]
   ```cpp
   Status VSortedRunMerger::get_next(Block* output_block, bool* eos) {
                            ^
   ```
   <details>
   <summary>Additional context</summary>
   
   **be/src/vec/runtime/vsorted_run_merger.cpp:106:** +1, including nesting 
penalty of 0, nesting level increased to 1
   ```cpp
           if (_pending_cursor != nullptr) {
           ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:108:** +2, including nesting 
penalty of 1, nesting level increased to 2
   ```cpp
               if (has_next_block(cursor)) {
               ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:114:** +1, including nesting 
penalty of 0, nesting level increased to 1
   ```cpp
           if (_priority_queue.empty()) {
           ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:117:** +1, nesting level 
increased to 1
   ```cpp
           } else if (_priority_queue.size() == 1) {
                  ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:119:** +2, including nesting 
penalty of 1, nesting level increased to 2
   ```cpp
               while (_offset != 0 && current->block_ptr() != nullptr) {
               ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:119:** +1
   ```cpp
               while (_offset != 0 && current->block_ptr() != nullptr) {
                                   ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:120:** +3, including nesting 
penalty of 2, nesting level increased to 3
   ```cpp
                   if (_offset >= current->rows - current->pos) {
                   ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:122:** +4, including nesting 
penalty of 3, nesting level increased to 4
   ```cpp
                       if (_pipeline_engine_enabled) {
                       ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:128:** +1, nesting level 
increased to 3
   ```cpp
                   } else {
                     ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:134:** +2, including nesting 
penalty of 1, nesting level increased to 2
   ```cpp
               if (current->isFirst()) {
               ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:135:** +3, including nesting 
penalty of 2, nesting level increased to 3
   ```cpp
                   if (current->block_ptr() != nullptr) {
                   ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:137:** +4, including nesting 
penalty of 3, nesting level increased to 4
   ```cpp
                       if (_pipeline_engine_enabled) {
                       ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:143:** +1, nesting level 
increased to 3
   ```cpp
                   } else {
                     ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:146:** +1, nesting level 
increased to 2
   ```cpp
               } else {
                 ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:147:** +3, including nesting 
penalty of 2, nesting level increased to 3
   ```cpp
                   if (current->block_ptr() != nullptr) {
                   ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:148:** +4, including nesting 
penalty of 3, nesting level increased to 4
   ```cpp
                       for (int i = 0; i < current->all_columns.size(); i++) {
                       ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:155:** +4, including nesting 
penalty of 3, nesting level increased to 4
   ```cpp
                       if (_pipeline_engine_enabled) {
                       ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:161:** +1, nesting level 
increased to 3
   ```cpp
                   } else {
                     ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:165:** +1, nesting level 
increased to 1
   ```cpp
           } else {
             ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:172:** +2, including nesting 
penalty of 1, nesting level increased to 2
   ```cpp
               if (num_columns != merged_columns.size()) {
               ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:181:** +2, including nesting 
penalty of 1, nesting level increased to 2
   ```cpp
               while (!_priority_queue.empty()) {
               ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:185:** +3, including nesting 
penalty of 2, nesting level increased to 3
   ```cpp
                   if (_offset > 0) {
                   ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:187:** +1, nesting level 
increased to 3
   ```cpp
                   } else {
                     ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:188:** +4, including nesting 
penalty of 3, nesting level increased to 4
   ```cpp
                       for (size_t i = 0; i < num_columns; ++i) {
                       ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:197:** +3, including nesting 
penalty of 2, nesting level increased to 3
   ```cpp
                   if (!next_heap(current)) {
                   ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:201:** +3, including nesting 
penalty of 2, nesting level increased to 3
   ```cpp
                   if (merged_rows == _batch_size) {
                   ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:207:** +2, including nesting 
penalty of 1, nesting level increased to 2
   ```cpp
               if (merged_rows == 0) {
               ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:214:** +1, including nesting 
penalty of 0, nesting level increased to 1
   ```cpp
           if (_limit != -1 && _num_rows_returned >= _limit) {
           ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:214:** +1
   ```cpp
           if (_limit != -1 && _num_rows_returned >= _limit) {
                            ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:220:** +1, including nesting 
penalty of 0, nesting level increased to 1
   ```cpp
       } catch (const std::runtime_error& e) {
         ^
   ```
   **be/src/vec/runtime/vsorted_run_merger.cpp:222:** +1, including nesting 
penalty of 0, nesting level increased to 1
   ```cpp
       } catch (...) {
         ^
   ```
   
   </details>
   



-- 
This is an automated message from the Apache Git Service.
To respond to the message, please log on to GitHub and use the
URL above to go to the specific comment.

To unsubscribe, e-mail: commits-unsubscr...@doris.apache.org

For queries about this service, please contact Infrastructure at:
us...@infra.apache.org


---------------------------------------------------------------------
To unsubscribe, e-mail: commits-unsubscr...@doris.apache.org
For additional commands, e-mail: commits-h...@doris.apache.org

Reply via email to