Changed-lines coverage:
  PR changed C/C++ lines covered by tests: 96.41% (376/390)

Uncovered changed code (with context):

================================================================================
src/AggregateFunctions/TimeSeries/AggregateFunctionTimeSeriesSelectGroups.cpp
================================================================================

--- uncovered block 73-75 ---
       71 |         {
       72 |             if (!isUInt64(argument_types[3]))
>>     73 |                 throw Exception(ErrorCodes::ILLEGAL_TYPE_OF_ARGUMENT,
>>     74 |                                 "Illegal type {} of 4th argument (sampling_key) for aggregate function {}, expected UInt64",
>>     75 |                                 argument_types[3]->getName(), name);
       76 |         }
       77 | 
================================================================================
src/AggregateFunctions/TimeSeries/AggregateFunctionTimeSeriesSelectGroups.h
================================================================================

--- uncovered block 171-174 ---
      169 | 
      170 |         if (state.heaps.size() != rhs_state.heaps.size() || state.k_per_step != rhs_state.k_per_step)
>>    171 |             throw Exception(ErrorCodes::BAD_ARGUMENTS,
>>    172 |                             "Cannot merge states of aggregate function {} created with different arguments: "
>>    173 |                             "the sizes of the `values` arrays and the values of `k` must be the same for all rows",
>>    174 |                             getName());
      175 | 
      176 |         /// The kept set is the k best entries of the union, so inserting one by one is order-independent.

--- uncovered block 211-213 ---
      209 |         readBinaryLittleEndian(format_version, buf);
      210 |         if (format_version != FORMAT_VERSION)
>>    211 |             throw Exception(ErrorCodes::INCORRECT_DATA,
>>    212 |                             "Cannot deserialize state of aggregate function {}: expected format version {}, got {}",
>>    213 |                             getName(), UInt32{FORMAT_VERSION}, UInt32{format_version});
      214 | 
      215 |         auto & state = this->data(place);

--- uncovered block 389-391 ---
      387 | 
      388 |         if (getKArraySize(columns, row_num, num_steps) != num_steps)
>>    389 |             throw Exception(ErrorCodes::BAD_ARGUMENTS,
>>    390 |                             "Aggregate function {} requires the `k` array to have the same size as the `values` array, got {} and {}",
>>    391 |                             getName(), getKArraySize(columns, row_num, num_steps), num_steps);
      392 | 
      393 |         const size_t num_k_to_check = k_is_per_step ? num_steps : (num_steps ? 1 : 0);
================================================================================
src/Storages/TimeSeries/PrometheusQueryToSQL/applyLimitAggregationOperator.cpp
================================================================================

--- uncovered block 124-124 ---
      122 |                 return make_intrusive<ASTIdentifier>(context.subqueries.back().name);
      123 |             }
>>    124 |             default:
      125 |             {
      126 |                 throwUnexpectedStoreMethod(k_arg, context);
WARNING: Failed to get start time for [Print Uncovered Code] - start time and duration won't be set

--- Coverage counts ---
Lines     : baseline 941,623/1,088,258  ->  current 941,899/1,088,584  (delta +276 / +326)
Functions : baseline 808,221/879,806  ->  current 808,301/880,090  (delta +80 / +284)
Branches  : baseline 309,239/392,580  ->  current 309,279/392,696  (delta +40 / +116)