Changed-lines coverage:
  PR changed C/C++ lines covered by tests: 96.43% (378/392)

Uncovered changed code (with context):

================================================================================
src/AggregateFunctions/TimeSeries/AggregateFunctionTimeSeriesTopKMasks.cpp
================================================================================

--- uncovered block 65-67 ---
       63 |         {
       64 |             if (!isUInt64(argument_types[2]))
>>     65 |                 throw Exception(ErrorCodes::ILLEGAL_TYPE_OF_ARGUMENT,
>>     66 |                                 "Illegal type {} of 3rd argument (sampling_key) for aggregate function {}, expected UInt64",
>>     67 |                                 argument_types[2]->getName(), name);
       68 |         }
       69 | 
================================================================================
src/AggregateFunctions/TimeSeries/AggregateFunctionTimeSeriesTopKMasks.h
================================================================================

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

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

--- uncovered block 392-394 ---
      390 | 
      391 |         if (getKArraySize(columns, row_num, num_steps) != num_steps)
>>    392 |             throw Exception(ErrorCodes::BAD_ARGUMENTS,
>>    393 |                             "Aggregate function {} requires the `k` array to have the same size as the `values` array, got {} and {}",
>>    394 |                             getName(), getKArraySize(columns, row_num, num_steps), num_steps);
      395 | 
      396 |         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 943,166/1,089,303  ->  current 943,574/1,089,631  (delta +408 / +328)
Functions : baseline 808,586/880,116  ->  current 808,831/880,404  (delta +245 / +288)
Branches  : baseline 309,961/393,134  ->  current 310,161/393,252  (delta +200 / +118)