I am reading clickhouse mutation code. In StorageMergeTree->selectPartsToMutate() function, there is a check 
`if (current_ast_elements + commands_size >= max_ast_elements)
                break;`

I think if there are many mutations then the check result will be true, so that it will skip the remaining mutations.
But the new part's mutation is set to the last one in mutation map, and it does not apply the remaining mutations actually.
`new_part_info.mutation = current_mutations_by_version.rbegin()->first;`

Then the new part will miss the remaining mutations in future mutation job.

I think it's wrong here. Am I right?

If it is right, I will submit a PR 

void removeQueryId(const String & query_id) const;
    void removeQueryIdNoLock(const String & query_id, const std::lock_guard<std::mutex> &) const;
    
    DataTypePtr getPartitionValueType() const;
    
    Block getSampleBlockWithVirtualColumns() const;
    
    
    Block getBlockWithVirtualPartColumns(const MergeTreeData::DataPartsVector & parts, bool one_part, bool ignore_empty = false) const;
    
    SimpleIncrement insert_increment;
    bool has_non_adaptive_index_granularity_parts = false;
    
    
    
    
    
    
    DataParts currently_moving_parts;
    
    mutable std::mutex moving_parts_mutex;
    PinnedPartUUIDsPtr getPinnedPartUUIDs() const;
    
    virtual bool scheduleDataProcessingJob(BackgroundJobsAssignee & assignee) = 0;
    
    bool scheduleDataMovingJob(BackgroundJobsAssignee & assignee);
    bool areBackgroundMovesNeeded() const;
    
    
    virtual void lockSharedData(const IMergeTreeDataPart &) const {}